Efficiently building a parse tree from a regular expression

DOI10.1007/s002360000037zbMath0960.68029OpenAlexW2071685823MaRDI QIDQ1587303

Marc Feeley, Danny Dubé

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)

Related Items (5)

From Ambiguous Regular Expressions to Deterministic Parsing Automata ⋮ A deterministic parsing algorithm for ambiguous regular expressions ⋮ Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions ⋮ From Regular Expression Matching to Parsing ⋮ From regular expression matching to parsing

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