A practical method for implementing string pattern matching machines

DOI10.1016/0020-0255(92)90113-MzbMath0800.68340OpenAlexW2092822581MaRDI QIDQ1193694

S. Singh

Publication date: 27 September 1992

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(92)90113-m

zbMATH Keywords

information retrievalkeywordsdata structuretext stringstring pattern matching machine

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05) Information storage and retrieval of data (68P20)

Uses Software

• YACC

Cites Work

• Unnamed Item
• Unnamed Item
• A relational theory of computing
• The programming language Pascal
• A Method for Improving String Pattern Matching Machines
• Storing a sparse table
• Collections of Functions for Perfect Hashing
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Reciprocal hashing
• Using Peephole Optimization on Intermediate Code
• A practical method for reducing sparse matrices with invariant entries
• Efficient string matching
• Compressed tries
• Perfect hashing functions
• Fast Pattern Matching in Strings
• Analyses of deterministic parsing algorithms
• Median split trees
• Evaluating and Improving Recursive Descent Parsers

This page was built for publication: A practical method for implementing string pattern matching machines