Results 161 to 170 of about 7,184 (201)
Some of the next articles are maybe not open access.
Optimization of LR(k) “Reduced parsers”
Information Processing Letters, 1992Abstract Some optimization algorithms for LR( k ) tables presented by A.V. Aho and J.D. Ullman ( J. Comput. System Sci. 6 (1972) 573-602) are extended to a new type of parsing tables, called Reduced Tables . The corresponding algorithms are compared and a sufficient condition which guarantees a lower space size of the new tables with respect to the
ANCONA, MASSIMO +2 more
openaire +3 more sources
ACM SIGPLAN Notices, 2006
Here a scheme is presented, which reduces the size of an LR parser. It is accomplished by merging two states, which do not perform differently on the same input symbol or non-terminal. This state merging has following advantages:1. The reduction in number of states is greater than the reduction in an LALR parser.2. The power of parser is not reduced as
Dillip Kumar Lenka, Pawan Kumar
openaire +2 more sources
Here a scheme is presented, which reduces the size of an LR parser. It is accomplished by merging two states, which do not perform differently on the same input symbol or non-terminal. This state merging has following advantages:1. The reduction in number of states is greater than the reduction in an LALR parser.2. The power of parser is not reduced as
Dillip Kumar Lenka, Pawan Kumar
openaire +2 more sources
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
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
On the reduction of LR(k) parsers
Information Processing Letters, 1993Abstract 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 +2 more
openaire +2 more sources
On a method for optimizing LR parsers
International Journal of Computer Mathematics, 1979It 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
Incremental generation of LR parsers
Computer Languages, 1990Abstract 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
Embedding semantics in LR parser tables
Software: Practice and Experience, 1978AbstractThis 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
Parglare: A LR/GLR parser for Python
Science of Computer Programming, 2022Abstract 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
Comparison of syntactic error handling in LR parsers
Software: Practice and Experience, 1995AbstractError 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
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 +2 more sources
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 +2 more sources