Abstract
This paper introduces a mechanism for combining unbounded lookahead exploration with linear time complexity in a deterministic parser. The idea is to use a resolve parsing action in place of the classical reduce. The construction of shift-resolve parsers is presented as a two-step algorithm, from the grammar to a finite nondeterministic automaton, and from this automaton to the deterministic parser. Grammar classes comparisons are provided. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Gálvez, J. F., Schmitz, S., & Farré, J. (2006). Shift-resolve parsing: Simple, unbounded lookahead, linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4094 LNCS, pp. 253–264). Springer Verlag. https://doi.org/10.1007/11812128_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
