Results 21 to 30 of about 31,102,731 (54)
LALR(1) : LL(1) = LR(0) : LL(0)
, 1992 It is shown that LL(l) and LALR(l) acceptors can be obtained by restricting the action tables of the corresponding LL(O) and LR(O) acceptors to those entries that are accessed in at least one accepting sequence (of a sentence from the language).
Kruseman Aretz, F.E.J. +1 more
core
, 1991 A grammar is LR{1} if it can be parsed deterministically from left to right while looking ahead no more than one symbol. Because of the difficulty in generating full LR{l) parsers, many parser generators such as YACC limit themselves to LALR(1} grammars ...
Ssager, Thomas J.
core +1 more source
An Insertion Only Error Corrector for LR(1), LALR(1), SLR(1) Parsers
, 1978 An error-corrector working with LR(1) parsers and variations such as SLR(1) and LALR(1) is studied. The corrector is able to correct and parse any input string.
Dion, Bernard, Fischer, Charles
core
An imperial comparison of generalized LR tables [PDF]
, 1991 In this study, table sizes and parsing efficiency of Tomita's algorithm with LR(0), SLR(1), LALR(1) and LR(1) parsing tables are compared on the basis of empirical data.
Sikkel, Klaas +3 more
core +2 more sources
, 1994 this paper we present an incremental LR parsing technique. The technique is applicable to all grammars in the LR, SLR, and LALR families. We present the technique in terms of the LR(1) grammars in this paper.
Wuu Yang
core
SLR(1) and LALR(1) Parsing for Unrestricted Grammars
, 2008 Simple LR(1) and lookahead LR(1) phrase structure grammars are defined and corresponding deterministic two-pushdown automata which parse all sentences are given. These grammars include a wide variety of grammars for non context-free languages.
Lawrence A. Harris
core
, 1984 학위논문(박사) - 한국과학기술원 : 전산학과, 1984.2, [ [v], 78 p. ]In traditional methods of computing LR(O) states and LALR(K) lookahead sets, certain relationships between nonterminals in the grammar are repeatedly re-examined, and the values dependent only on these ...
최광무, Choe, Kwang-Moo
core +1 more source
The Lane Table Method Of Constructing LR(1) Parsers [PDF]
, 2009 The first practical application of the LR algorithm was by [1] for the LALR(1) subset of LR(1) grammars. In [2] an efficient method of producing an LR(1) parser for all LR(1) grammars was described which involves resolving conflicts at states of the LR(0)
Pager, D.
core +1 more source
Methods for Computing LALR(k) Lookahead
, 1979 Methods for constructing LALR(k) parsers are discussed. Algorithms for computing LALR(k)-lookahead are presented together with the necessary theory to prove their correctness. Firstly a special algorithm for the LALR(1) case is presented.
Kristensen, Bent Bruun +1 more
core
, 1989 학위논문(석사) - 한국과학기술원 : 전산학과, 1989.2, [ [iii], 57 p. ]Tracing of conflicts manually is not so easy in LALR(1) analysis; It involves troublesome tracing of LR(0) states and/or examination of productions in the grammar.
박광순, Park, Kwang-Soon
core +1 more source