Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Average running time of the Boyer-Moore-Horspool algorithm
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
A fast string searching algorithm
Communications of the ACM
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Tools to Implement Automata, a First Step: ASTL
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Theoretical Computer Science
| Hi-index | 0.00 |
Regular expressions are often an integral part of program customization and many algorithms have been proposed for transforming them into suitable data structures. These algorithms can be divided into two main classes: backtracking or automaton-based algorithms. Surprisingly, the latter class draws less attention than the former, even though automaton-based algorithms represent the oldest and by far the fastest solutions when carefully designed. Only two open-source automatonbased implementations stand out: PCRE and the recent RE2 from Google. We have developed, and present here, a competitive automaton-based regular expression engine on top of the LGPL C++ Automata Standard Template Library (ASTL), whose efficiency and scalability remain unmatched and which distinguishes itself through a unique and rigorous STL-like design.