Results 191 to 200 of about 163,637 (234)

On the reduction of LR(k) parsers

Information Processing Letters, 1993
Abstract The problem of reducing the number of states in a given LR(k) parser is treated from the standpoint of static merging, introducing a well-defined reduction of the parser. In addition, a locally optimal reduction is presented as a method for reducing the number of states.
Woo-Jun Park, Kwang-Moo Choe, Myung-Joon Lee   +2 more
openaire   +2 more sources

On a method for optimizing LR parsers

International Journal of Computer Mathematics, 1979
It is shown that if the basic method for eliminating single productions from canonical LR parsers developed by Pager is applied to an SLR parser and the resulting parser is free of conflicts, then the resulting parser is a valid parser which accepts exactly the strings in the language.
Eljas Soisalon-Soininen, Kai Koskimies
openaire   +2 more sources

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   +4 more sources

Incremental generation of LR parsers

Computer Languages, 1990
Abstract Implementation of a new compiler usually requires making frequent adjustments to grammar definitions. An incremental technique for updating the parser tables after a monor change to the grammer could potentially save much computational effort.
openaire   +2 more sources

Semantic routines and LR(k) parsers

Acta Informatica, 1980
Most applications of parsing require that the parser call semantic action routines while processing the input. For LR(k) parsers it is well known that a semantic action routine can be called when the end of a production is recognized. Often, however, it is desirable to call routines at other times. This paper presents fast algorithms that determine,
Cynthia A. Brown, Paul Walton Purdom
openaire   +2 more sources

LR(0) grammars generated by LR(0) parsers

Acta Informatica, 1981
Let ? be an LR(0) parser of a given LR(0) grammar G. Generally, ? does not only parse the words generated by G but also the words of some other LR(0) grammars different from G. In this paper we shall define a class of LR(0) parsers and shall present a characterization and a method for the construction of all LR(0) grammars which can be parsed by a ...
openaire   +2 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, David Cabrero, Manuel Vilares Ferro   +2 more
openaire   +2 more sources

Construction and Implementation of LR(1) Parsers

1990
This chapter is devoted to the practical issues involved in the construction and use of deterministic LR(1) parsers. We shall show how the practical versions of LR (1) parsers, most notably the LALR (1) parsers, can be constructed efficiently, and we shall present methods for encoding LR(1) parsers as efficient RAM programs. Two versions of RAM program
Eljas Soisalon-Soininen, Seppo Sippu
openaire   +2 more sources

A forward move algorithm for LL and LR parsers

Proceedings of the 1982 SIGPLAN symposium on Compiler construction - SIGPLAN '82, 1982
A wide variety of algorithms have been suggested for the repair of syntactic errors in a computer program. Since there is usually more than one possible repair for any syntax error, many algorithms employ a cost function to guide the the repair, and some [1,3,4,6], guarantee that the repair chosen will be least-cost, according to some definition.
Charles N. Fischer, Jon Mauney
openaire   +2 more sources

Practical Error Recovery for LR Parsers

1977
Abstract : A 'forward move algorithm' and some of its formal properties are presented for use in a practical syntactic error recovery scheme for LR parsers. The algorithm finds a 'valid fragment' (comparable to a valid prefix) just to the right of a point of error detection.
Frank DeRemer, Thomas J. Pennello
openaire   +2 more sources