A deterministic parsing algorithm for ambiguous regular expressions
From MaRDI portal
Publication:2035007
DOI10.1007/s00236-020-00366-7zbMath1487.68142OpenAlexW3005310062MaRDI QIDQ2035007
Angelo Morzenti, Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Borsotti
Publication date: 23 June 2021
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-020-00366-7
Uses Software
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
- A benchmark production tool for regular expressions
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity
- Derivative-Based Diagnosis of Regular Expression Ambiguity
- From Ambiguous Regular Expressions to Deterministic Parsing Automata
- Bit-coded Regular Expression Parsing
- Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions
- Efficient Submatch Extraction for Practical Regular Expressions
- From Regular Expression Matching to Parsing
- POSIX Regular Expression Parsing with Derivatives
- Two-Pass Greedy Regular Expression Parsing
- Automata, Languages and Programming
- Ambiguity in Graphs and Expressions
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- Formal languages and compilation
This page was built for publication: A deterministic parsing algorithm for ambiguous regular expressions
