Complexity of Extended vs. Classic LR Parsers

DOI10.1007/978-3-319-09704-6_8zbMath1417.68073OpenAlexW204725881MaRDI QIDQ5496179

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

Publication date: 7 August 2014

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09704-6_8

zbMATH Keywords

transition networkEBNFbottom-up parsershift-reduceELR(1)extended BNF grammarLR(1)parsing performanceTN

Mathematics Subject Classification ID

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

Related Items (1)

Fast deterministic parsers for transition networks

This page was built for publication: Complexity of Extended vs. Classic LR Parsers