Karel Culikand Rina Cohen. LR-Regular grammars---an extension of LR(k) grammars. Journal of Computer and System Sciences, 7:66--96, 1973. ISSN 0022-0000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
LL and LR Translators Need k > 1 Lookahead - Parr, Quong (1995) (Correct)
....O(jT j k ) space, where jT j is the number of token types. In practice, it is expensive for a parser generator to compute full lookahead for k 1 and the resulting parsers are usually impractically large. Various methods have been examined to obtain k 1 lookahead. For example, 2] and [4] explored using infinite regular languages for lookahead decisions and [1] computed lookahead k sequences at parse time rather than statically. Unfortunately, practical and widely used parser generators have not been developed using these techniques. We have implemented an effective heuristic ....
Karel Culik and Rina Cohen. LR-Regular Grammars---an Extension of LR(k) Grammars. Journal of Computer and System Sciences, 7:66--96, 1973.
Shift-Resolve Parsing: Simple, - Unbounded Lookahead Linear (Correct)
No context found.
Karel Culikand Rina Cohen. LR-Regular grammars---an extension of LR(k) grammars. Journal of Computer and System Sciences, 7:66--96, 1973. ISSN 0022-0000.
Noncanonical LALR(1) Parsing - Sylvain Schmitz Laboratoire (Correct)
No context found.
Karel Culikand Rina Cohen. LR-Regular grammars---an extension of LR(k) grammars. Journal of Computer and System Sciences, 7:66--96, 1973. ISSN 0022-0000.
Parameterized LR Parsing - Thiemann, Neubauer (2004) (Correct)
No context found.
K. Culik and R. Cohen. LR-regular grammars---an extension of LR(k) grammars. J. Comput. Syst. Sci., 7:66--96, 1973.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC