Efficiently building a parse tree from a regular expression

DOI10.1007/S002360000037MaRDI QIDQ1587303zbMATH OpenOpenAlexFDO

Authors Danny Dubé, Marc Feeley

Publication date 7 December 2000

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

parsing

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Recommendations

• Bit-coded Regular Expression Parsing
• A deterministic parsing algorithm for ambiguous regular expressions
• Optimally streaming greedy regular expression parsing
• From ambiguous regular expressions to deterministic parsing automata
• Two-pass greedy regular expression parsing

Cited in

(10)

• From Regular Expression Matching to Parsing
• Disambiguation in regular expression matching via position automata with augmented transitions
• Two-pass greedy regular expression parsing
• Relaxed parsing of regular approximations of string-embedded languages
• A deterministic parsing algorithm for ambiguous regular expressions
• From regular expression matching to parsing
• Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression
• \textit{BSP}: a parsing tool for ambiguous regular expressions
• From ambiguous regular expressions to deterministic parsing automata
• Optimally streaming greedy regular expression parsing

This page was built for publication: Efficiently building a parse tree from a regular expression

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