Shift-Reduce Parsers for Transition Networks

DOI10.1007/978-3-319-04921-2_18zbMath1407.68238OpenAlexW124915390MaRDI QIDQ5404914

Angelo Morzenti, Luca Breveglieri, Stefano Crespi Reghizzi

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_18

zbMATH Keywords

EBNFbottom-up parserextended grammarLR syntax analysis

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

From Ambiguous Regular Expressions to Deterministic Parsing Automata ⋮ Fast deterministic parsers for transition networks

This page was built for publication: Shift-Reduce Parsers for Transition Networks