Results 131 to 140 of about 7,126 (164)

A technique for speeding up LR(k) parsers

Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72, 1972
We present a new transformation that reduces the size and increases the speed of LR(k) parsers. This transformation can be applied to all LR(k) parsers including those produced by Knuth's and DeRemer's techniques. The transformation causes the parser to avoid reductions by productions of the form A → B where A and B are non-terminals.
Alfred V. Aho, Jeffrey D. Ullman
openaire   +1 more source

Shift-reduce conflicts in LR parsers

ACM SIGPLAN Notices, 1989
In this note, the shift-reduce conflicts of LR(1) and LR(0) are compared. It is concluded that, if LR(1) has no shift-reduce conflicts, or, if the LR(1) shift-reduce conflicts are resolved in favor of the shift, then all shift-reduce conflicts of the corresponding LR(0) can be correctly resolved by the simple rule: resolve in favor of the shift.
openaire   +1 more source

Comparison of syntactic error handling in LR parsers

Software: Practice and Experience, 1995
AbstractError recovery techniques for LR parsers presented in the literature are described and classified. The techniques considered range from the non‐correcting ones to interactive and incremental ones. Also, some of the techniques presented are compared and evaluated.
DEGANO, PIERPAOLO, Priami C.
openaire   +3 more sources

Construction of efficient generalized LR parsers

1998
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing algorithm working at complexity O(n3) in the worst case, which is achieved by the use of dynamic programming to represent the non-deterministic evolution of the stack instead of ...
Miguel A. Alonso 0001, David Cabrero Souto, Manuel Vilares Ferro   +2 more
openaire   +1 more source

An LR Substring Parser Applied in a Parallel Environment

Journal of Parallel and Distributed Computing, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gwen Clarke, David T. Barnard
openaire   +2 more sources

An LR parser with pre-determined reduction goals

Information Processing Letters, 1999
전산학과
Lee, GO, Choe, KM Choe, Kwang-Moo
openaire   +2 more sources

An LR Parser with Less States

Applied Mechanics and Materials, 2013
This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata. The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalent states.
openaire   +1 more source

Complexity of Extended vs. Classic LR Parsers

2014
For the deterministic context-free languages, we compare the space and time complexity of their LR (1) parsers, constructed in two different ways: the classic method by Knuth [7] for BNF grammars, and the recent one by the authors [2], which directly builds the parser from EBNF grammars represented as transition networks.
Angelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti   +3 more
openaire   +1 more source

Are LR parsers too powerful?

ACM SIGPLAN Notices, 1986
The general trend in the development of parser theory is in the direction of exploring implementing methods of increasing power. In particular, ways of improving the efficiency of LR parsers and the generation of LR tables have been receiving a lot of attention.
openaire   +1 more source

Syntax-Error Recovery in LR-parsers

1976
An efficient algorithm for error-recovery in LR-parsers is presented. The algorithm is capable of repairing all syntax errors without backtracking, in time proportional to the stack depth. It needs only a small table, a mapping from the states of the parser into the terminal symbols. The algorithm is very similiar to the parser itself. Thus, it has the
openaire   +1 more source