Results 101 to 110 of about 298 (140)
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
openaire +1 more source
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 +1 more source
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
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 ...
Gillett, Will D., Leach, Sandra
openaire +2 more sources
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
Full LR(1) parser generation is discussed and shown to be useful and practical, in contrast to current widespread misconception.
openaire +1 more source
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
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.
P. Degano, Priami, Corrado
openaire +4 more sources
ACM SIGPLAN Notices, 1986
The general trend in the development of parser theory is in the direction of exploring implementing methods of increasing power. In particular, ways of improving the efficiency of LR parsers and the generation of LR tables have been receiving a lot of attention.
openaire +1 more source
The general trend in the development of parser theory is in the direction of exploring implementing methods of increasing power. In particular, ways of improving the efficiency of LR parsers and the generation of LR tables have been receiving a lot of attention.
openaire +1 more source
Complexity of Extended vs. Classic LR Parsers
2014For the deterministic context-free languages, we compare the space and time complexity of their LR (1) parsers, constructed in two different ways: the classic method by Knuth [7] for BNF grammars, and the recent one by the authors [2], which directly builds the parser from EBNF grammars represented as transition networks.
A. Borsotti +3 more
openaire +1 more source
Automatic error recovery for LR parsers
Communications of the ACM, 1978In 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.
Mickunas, M. Dennis, Modry, John A.
openaire +1 more source