Results 161 to 170 of about 163,441 (217)
Some of the next articles are maybe not open access.
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
semanticscholar +3 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
semanticscholar +3 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 ...
W. Gillett, S. Leach
semanticscholar +4 more sources
An LR Parser with Pre-Determined Reduction Goals
Information Processing Letters, 1999전산학과
Gyung-Ok Lee, K. Choe
semanticscholar +4 more sources
Information Processing Letters, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jorma Tarhio, Eljas Soisalon-Soininen
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jorma Tarhio, Eljas Soisalon-Soininen
openaire +2 more sources
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 +3 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 +2 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 +3 more sources
Optimization of LR(k) “Reduced parsers”
Information Processing Letters, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ANCONA, MASSIMO +2 more
openaire +4 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 +4 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 +4 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