Results 161 to 170 of about 169,566 (212)
Some of the next articles are maybe not open access.
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.
Hong-jun Tang
semanticscholar +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.
Hong-jun Tang
semanticscholar +2 more sources
LR—Automatic Parser Generator and LR(1) Parser
IEEE Transactions on Software Engineering, 1981LR is an LR(1) parser generation system. It is written entirely in portable ANS1 standard Fortran 66 and has been successfully operated on a number of computers. LR uses a powerful algorithm of Pager's to generate a space efficient parser for any LR(1) grammar.
C. Wetherell, A. Shannon
openaire +1 more source
DR parsers: a generalization of LR parsers
Proceedings of the 1990 IEEE Workshop on Visual Languages, 2002A method is presented to construct a parser for a visual language whose specification can be done by a context-free grammar. The main idea is to allow a traditional LR parser to choose the next symbol to parse from a two-dimensional space. The positional grammar is defined, and some examples are given.
Costagliola G., Chang S. K.
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
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
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
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
LR(0) grammars generated by LR(0) parsers
Acta Informatica, 1981Let ? 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