Shift-Resolve parsing: simple, unbounded lookahead, linear time

Authors:
José Fortes Gálvez;Sylvain Schmitz;Jacques Farré
Affiliations:
Universidad de Las Palmas de Gran Canaria, Spain;Laboratoire I3S, Université de Nice, Sophia Antipolis, France;Laboratoire I3S, Université de Nice, Sophia Antipolis, France
Venue:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 10
Cited 3

Parsing techniques: a practical guide

Parsing techniques: a practical guide
Noncanonical SLR(1) Grammars

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the complexity of LR(k) testing

Communications of the ACM
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
A Bounded Graph-Connect Construction for LR-regular Parsers

CC '01 Proceedings of the 10th International Conference on Compiler Construction
Bounded-connect noncanonical discriminating-reverse parsers

Theoretical Computer Science - Implementation and application automata
LR-regular grammars-an extension of LR(k) grammars

Journal of Computer and System Sciences
Noncanonical LALR(1) parsing

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

An Experimental Ambiguity Detection Tool

Electronic Notes in Theoretical Computer Science (ENTCS)
Conservative ambiguity detection in context-free grammars

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On LR parsing with selective delays

CC'13 Proceedings of the 22nd international conference on Compiler Construction

Quantified Score

Hi-index	0.00

Visualization

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.