Abstract
We give a new direct construction of the shift-reduce ELR (1) parsers for recursive Transition Networks (TN), which is suitable for languages specified by Extended BNF grammars (EBNF). Such parsers are characterized by their absence of conflicts, not just the classical shift-reduce and reduce-reduce types, but also a new type named convergence conflict. Such a condition is proved correct and is more general than the past proposed conditions for the shift-reduce parsing of EBNF grammars or TN's. The corresponding parser is smaller than a classical one, without any extra bookkeeping. A constraint on TN's is mentioned, which enables top-down deterministic ELL (1) analysis. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Breveglieri, L., Crespi Reghizzi, S., & Morzenti, A. (2014). Shift-reduce parsers for transition networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8370 LNCS, pp. 222–235). https://doi.org/10.1007/978-3-319-04921-2_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
