BSP: A Parsing Tool for Ambiguous Regular Expressions

DOI10.1007/978-3-319-22360-5_26zbMath1465.68135OpenAlexW2293560034MaRDI QIDQ2947431

Angelo Borsotti, Angelo Morzenti, 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: https://doi.org/10.1007/978-3-319-22360-5_26

Mathematics Subject Classification ID

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

Related Items (1)

BSP

Uses Software

• JavaScript
• GitHub

Cites Work

• From Ambiguous Regular Expressions to Deterministic Parsing Automata
• Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions
• Automata, Languages and Programming

This page was built for publication: BSP: A Parsing Tool for Ambiguous Regular Expressions