Ll-regular grammars

References

• Aho , A.V. and Ullman , J.D. 1972 . The Theory of Parsing, Translation and Compiling , Vol. 1 and 2 , Englewood Cliffs, N.J : Prentice Hall . 1973
   Google Scholar
• Anisimov , A.V. 1973 . Top-down analysis of programming languages without backtracking . Proc. 2nd Symp. on Mathematical Foundations of Computer Science . 1973 . pp. 175 – 180 . Czechoslovakia : High Tatras . in Russian
   Google Scholar
• Beatty , J.C. 1977 . “ Ph.D. Thesis ” . In Iteration theorems for the LL(k) languages , Livermore : University of California .
   Google Scholar
• Culik , K. II . 1968 . Contribution to deterministic top-down analysis of context-free languages . Kybernetika , 4 : 422 – 431 .
   Google Scholar
• Culik , K. II and Cohen , R. 1973 . LR-regular grammars-an extension of LR(k) grammars . J. Comput. System Sci , 7 : 66 – 96 .
   Google Scholar
• Friede , D. . Transition diagrams and strict deterministic grammars . 4th GI Conf. on Theoretical Computer Science . Edited by: Weihrauch , K. Vol. 67 , pp. 113 – 123 . Berlin : Springer . Aachen, Lecture Notes in Computer Science
   Google Scholar
• Geller , M.M. and Harrison , M.A. 1977 . On LR(k) grammars and languages . Theor. Compute Sci , 4 : 245 – 276 .
   Google Scholar
• Jarzabek , S. and Krawczyk , T. 1974 . LL-regular grammars . Prace Instytutu Màszyn Matematycznych , 16 : 95 – 106 . Prace I MM 17 (1975) 107-116
   Google Scholar
• Jarzabek , S. and Krawczyk , T. 1975 . LL-regular grammars . Information Processing Letters , 4 : 31 – 37 .
   Google Scholar
• Nijholt , A. . On the parsing of LL-regular grammars . Proc. 5th Symp. on Mathematical Foundations of Computer Science . Edited by: Mazurkiewicz , A. Vol. 45 , pp. 446 – 452 . Berlin : Springer . Gdansk, Lecture Notes in Computer Science
   Google Scholar
• Nijholt , A. and Soisalon-Soininen , E. . Ch(k) grammars: A ckaracterization of LL(k) languages . Proc. 8th Symp. on Mathematical Foundations of Computer Science . Edited by: Becvar , J. Vol. 74 , pp. 390 – 397 . Berlin : Springer . Olomouc, Lecture Notes in Computer Science
   Google Scholar
• Poplawski , D.A. 1979 . On LL-regular grammars . J. Comput System Sci , 18 : 218 – 227 .
   Google Scholar
• Rosenkrantz , D.J. and Lewis , P.M. II . . Deterministic left corner parsing . Proc. 11th Annual IEEE Symp . pp. 139 – 152 . Springer . on Switching and Automata Theory
   Google Scholar
• Rosenkrantz , D.J. and Steams , R.E. 1970 . Properties of deterministic top-down grammars . Info, and Control , 17 : 226 – 256 .
   Google Scholar
• Soisalon-Soininen , E. 1977 . Characterization of LL(k) languages by restricted LR(k) grammars , University of Helsinki . Ph.D. Thesis
   Google Scholar
• Wood , D. Lecture Notes on Top-down Syntax Analysis , Hamilton : McMaster University . Technical Report 78-CS-12
   Google Scholar