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

Aho, 1972-1973, Vols. I and II Backhouse, 1979 Beatty, 1980, Two iteration theorems for the LL(k) languages, Theoret. Comput. Sci., 12, 193, 10.1016/0304-3975(80)90029-8 Beatty, 1979, On the relationship between the LL(1) and LR(1) grammars Brosgol, 1974, Deterministic translation grammars Conway, 1963, Design of a separable transition diagram compiler, Comm. ACM, 6, 396, 10.1145/366663.366704 Demers, 1977, Generalized left corner parsing, Conf. Record of the 4th ACM Symp. on Principles of Programming Languages, 170 DeRemer, 1971, Simple LR(k) grammars, Comm. ACM, 14, 453, 10.1145/362619.362625 Friede, 1979, Transition diagrams and strict deterministic grammars, 67, 113, 10.1007/3-540-09118-1_13 Geller, 1977, On LR(k) grammars and languages, Theoret. Comput. Sci., 4, 245, 10.1016/0304-3975(77)90013-5 Geller, 1977, Characteristic parsing: A framework for producing compact deterministic parsers, J. Comput. System Sci., 14, 265, 10.1016/S0022-0000(77)80017-2 Griffiths, 1974, Toute grammaire LL(k) est LR(k), RAIRO Theoret. Comput. Sci., 18, 55 Hammer, 1974, A new grammatical transformation into deterministic top-down form Hammer, 1974, A new grammatical transformation into LL(k) form, Conf. Record of the 6th Ann. Symp. on Theory of Computing, 266 Harrison, 1978 Harrison, 1974, On the parsing of deterministic languages, J. Assoc. Comput. Mach., 21, 525, 10.1145/321850.321851 Heilbrunner, 1981, A parsing automata approach to LR theory, Theoret. Comput. Sci., 15, 117, 10.1016/0304-3975(81)90067-0 Hunt, 1978, Lower bounds and reductions between grammar problems, J. Assoc. Comput. Mach., 25, 32, 10.1145/322047.322051 Knuth, 1965, On the translation of languages from left to right, Inform. and Control, 8, 607, 10.1016/S0019-9958(65)90426-2 Knuth, 1971, Top-down syntax analysis, Acta Inform., 1, 79, 10.1007/BF00289517 Kral, 1973, A note on the number of states of DeRemer's recognizer, Inform. Process Lett., 2, 22, 10.1016/0020-0190(73)90021-5 Lewis, 1968, Syntax-directed transduction, J. Assoc. Comput. Mach., 15, 465, 10.1145/321466.321477 Lomet, 1973, A formalization of transition diagram systems, J. Assoc. Comput. Mach., 20, 235, 10.1145/321752.321756 Moura, 1980, Syntactic equivalence of grammar classes nijholt, 1979, Simple chain grammars and languages, Theoret. Comput. Sci., 9, 287, 10.1016/0304-3975(79)90032-X Nijholt, 1980, A framework for classes of grammars between the LL(k) and LR(k) grammars Nijholt, 1981, Parsing strategies: A concise survey, 118, 103, 10.1007/3-540-10856-4_77 Pittl, 1981, On LLP(k) grammars and languages, Theoret. Comput. Sci., 16, 149, 10.1016/0304-3975(81)90073-6 Rosenkrantz, 1970, Properties of deterministic top-down grammars, Inform. and Control, 17, 226, 10.1016/S0019-9958(70)90446-8 Soisalon-Soininen, 1980, On comparing LL(k) and LR(k) grammars, Math. Systems Theory, 13, 323, 10.1007/BF01744303 Soisalon-Soininen, 1979, A method for transforming grammars into LL(k) form, Acta Inform., 12, 339, 10.1007/BF00268320