An efficient implementation of static string pattern matching machines
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 15 (8) , 1010-1016
- https://doi.org/10.1109/32.31357
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A Method for Improving String Pattern Matching MachinesIEEE Transactions on Software Engineering, 1984
- A Practical Method for Reducing Weak Precedence ParsersIEEE Transactions on Software Engineering, 1983
- Using Peephole Optimization on Intermediate CodeACM Transactions on Programming Languages and Systems, 1982
- A practical method for reducing sparse matrices with invariant entriesInternational Journal of Computer Mathematics, 1982
- Table-Driven Code GenerationComputer, 1980
- Automatic Derivation of Code Generators from Machine DescriptionsACM Transactions on Programming Languages and Systems, 1980
- Minimal perfect hash functions made simpleCommunications of the ACM, 1980
- Perfect hashing functionsCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Efficient string matchingCommunications of the ACM, 1975