Results 171 to 180 of about 163,441 (217)

Semantic routines and LR(k) parsers

Acta Informatica, 1980
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cynthia A. Brown, Paul Walton Purdom
openaire   +2 more sources

EfficientLR (1) parsers

Acta Informatica, 1973
Knuth'sLR(1) parsing algorithm is sufficiently general to handle the parsing of most programming languages with the additional benefit of earlier detection of syntax errors than in other formal methods used in compilers. The major obstacle impeding the use of this algorithm is the large space requirement for parsing tables.
Anderson T, Eve J, Horning JJ
openaire   +3 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

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

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

Parglare: A LR/GLR parser for Python

Science of Computer Programming, 2022
Abstract Parglare is a Python parsing library that implements deterministic LR and its generalized extension GLR algorithms. Parglare strives to be easy to use by providing rich error messages, visualization, a CLI tool for grammar development, and good documentation. The same grammar format is used for both algorithms. It is easy to choose either LR
openaire   +2 more sources

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.
David T. Barnard, Gwen Clarke
openaire   +3 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

Full LR(1) parser generation

ACM SIGPLAN Notices, 1981
Full LR(1) parser generation is discussed and shown to be useful and practical, in contrast to current widespread misconception.
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