论文信息 - On the relationship between LL(1) and LR(1) grammars

On the relationship between LL(1) and LR(1) grammars

It is shown that every p-reduced LL(I) grammar is LALR(I) and, as a corollary, that every A-free LL(I) grammar is SLR(I) A partial converse to this result is also demonstrated: If there is at most one marked rule m the basis of every state set in the canonical collection of sets of LR(k) items for a grammar G in which S i ~ S-/ts impossible, then G ~s LL(k).

John C. Beatty | J. C. Beatty

[1] Daniel J. Rosenkrantz,et al. Properties of deterministic top down grammars , 1969, STOC.

[2] Daniel J. Rosenkrantz,et al. Properties of Deterministic Top-Down Grammars , 1970, Inf. Control..

[3] Franklin L. DeRemer,et al. Simple LR(k) grammars , 1971, Commun. ACM.

[4] Ivan M. Havel,et al. Strict Deterministic Grammars , 1973, J. Comput. Syst. Sci..

[5] Jaroslav Král,et al. A Note on the Number of States of the DeRemer's Recognizer , 1973, Inf. Process. Lett..

[6] Ivan M. Havel,et al. On the Parsing of Deterministic Languages , 1974, JACM.

[7] Harry B. Hunt,et al. Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems'' , 1978, JACM.

[8] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[9] John C. Beatty. Two Iteration Theorems for the LL(k) Languages , 1980, Theor. Comput. Sci..