\textit{BSP}: a parsing tool for ambiguous regular expressions

DOI10.1007/978-3-319-22360-5_26MaRDI QIDQ2947431zbMATH OpenOpenAlexFDO

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

Publication date 23 September 2015

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

Full work available at URL https://doi.org/10.1007/978-3-319-22360-5_26

Mathematics Subject Classification ID

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

Recommendations

• A deterministic parsing algorithm for ambiguous regular expressions
• From ambiguous regular expressions to deterministic parsing automata
• Bit-coded Regular Expression Parsing
• Efficiently building a parse tree from a regular expression

Cites work

• Automata, Languages and Programming
• Disambiguation in regular expression matching via position automata with augmented transitions
• From ambiguous regular expressions to deterministic parsing automata

Cited in

(3)

• A deterministic parsing algorithm for ambiguous regular expressions
• BSP
• From ambiguous regular expressions to deterministic parsing automata

Describes a project that uses

Uses Software

• JavaScript
• GitHub

This page was built for publication: \textit{BSP}: a parsing tool for ambiguous regular expressions

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