Results 121 to 130 of about 7,126 (164)

Semantic routines and LR(k) parsers

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

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   +1 more source

Incremental LR parsers

Acta Informatica, 1978
The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to ...
openaire   +3 more sources

Embedding semantics in LR parser tables

Software: Practice and Experience, 1978
AbstractThis paper addresses two of the problems commonly associated with LR parsing and syntax directed translation schemes, namely grammar stratification and excessively large table size, A solution is discussed which can eliminate stratification of the grammar by allowing the designer to embed semantics directly within the LR table (i.e., at shift ...
Will D. Gillett, Sandra Leach
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   +1 more source

Automatic error recovery for LR parsers

Communications of the ACM, 1978
In this paper we present a scheme for detecting and recovering from syntax errors in programs. The scheme, which is based on LR parsing, is driven by information which is directly and automatically obtainable from the information that is already present in an LR parser.
M. Dennis Mickunas, John A. Modry
openaire   +1 more source

Generation of LR parsers by partial evaluation

ACM Transactions on Programming Languages and Systems, 2000
The combination of modern programming languages and partial evaluation yields new approaches to old problems. In particular, the combination of functional programming and partial evaluation can turn a general parser into a parser generator.
Sperber, Michael, Thiemann, Peter
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   +1 more source

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.
Kai Koskimies, Eljas Soisalon-Soininen
openaire   +1 more source

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   +1 more source