Regular Expressions at Their Best: A Case for Rational Design

DOI10.1007/978-3-642-18098-9_33zbMath1297.68150OpenAlexW1604726724MaRDI QIDQ3073651

Vincent le Maout

Publication date: 11 February 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_33

zbMATH Keywords

efficiencyautomatascalabilityC++regular expressiongeneric programmingASTL

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source

Uses Software

• PCRE
• RE2

Cites Work

• Average running time of the Boyer-Moore-Horspool algorithm
• A fast string searching algorithm
• Programming Techniques: Regular expression search algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item