Results 161 to 170 of about 168,331 (215)
Some of the next articles are maybe not open access.
On the reduction of LR(k) parsers
Information Processing Letters, 1993We propose a new formalism for merging \(LR(k)\) states without any conflict, after constructing the full \(LR(k)\) parsing table. First, we define a new relation compatible \(C\) and \(C\)-covering for a core block, both of which are different from the notion in dynamic reduction methods. Then, we propose well-defined reduction (WDR) which is a set of
PARK, WJ +2 more
openaire +2 more sources
Information Processing Letters, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Soisalon-Soininen, Eljas, Tarhio, Jorma
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Soisalon-Soininen, Eljas, Tarhio, Jorma
openaire +1 more source
Optimization of LR(k) “Reduced parsers”
Information Processing Letters, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ANCONA, MASSIMO +2 more
openaire +3 more sources
Semantic routines and LR(k) parsers
Acta Informatica, 1980zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Purdom, Paul, Brown, Cynthia A.
openaire +1 more source
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
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 +2 more sources
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 +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.
Kai Koskimies, Eljas Soisalon-Soininen
openaire +1 more source
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
An LR Substring Parser Applied in a Parallel Environment
Journal of Parallel and Distributed Computing, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Clarke, Gwen, Barnard, David T.
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 +1 more source