Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression

DOI10.1007/11812128_31MaRDI QIDQ5757220zbMATH OpenOpenAlexFDO

Authors Adrian D. Thurston

Publication date 6 September 2007

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

Full work available at URL https://doi.org/10.1007/11812128_31

Mathematics Subject Classification ID

Theory of programming languages (68N15) Formal languages and automata (68Q45)

Recommendations

• Efficiently building a parse tree from a regular expression
• Parsing expression grammars: a recognition-based syntactic foundation
• An efficient ELL(1)-parser generator
• Certified parsing of regular languages
• Bit-coded Regular Expression Parsing

Cited in

(4)

• Managing and using mixed computations for the systematic construction of language-oriented parsers
• Schrödinger's token
• Relaxed parsing of regular approximations of string-embedded languages
• A language-theoretic view on network protocols

This page was built for publication: Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757220)