Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time

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 th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Gálvez, José Fortes, Schmitz, Sylvain, Farré, Jacques
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems Equivalence Relation Exact sciences and technology Input String Linear Time Nondeterministic Automaton Position Graph Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!