From Ambiguous Regular Expressions to Deterministic Parsing Automata

DOI10.1007/978-3-319-22360-5_4zbMath1465.68134OpenAlexW1153797264MaRDI QIDQ2947407

Angelo Morzenti, Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi

Publication date: 23 September 2015

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

Full work available at URL: http://www.springer.com/us/book/9783319223599

zbMATH Keywords

ambiguityparsingregular expressionBerry-Sethi algorithmsyntax tree

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

BSP: A Parsing Tool for Ambiguous Regular Expressions, A deterministic parsing algorithm for ambiguous regular expressions, ebs, Derivative-Based Diagnosis of Regular Expression Ambiguity, On the semantics of regular expression parsing in the wild

Uses Software

• GitHub

Cites Work

• Unnamed Item
• From regular expressions to deterministic automata
• Local languages and the Berry-Sethi algorithm
• Efficiently building a parse tree from a regular expression
• Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions
• POSIX Regular Expression Parsing with Derivatives
• Shift-Reduce Parsers for Transition Networks
• Automata, Languages and Programming
• Ambiguity in Graphs and Expressions
• A Unified Construction of the Glushkov, Follow, and Antimirov Automata