From $LL$-regular to $LL\left(1\right)$ grammars : transformations, covers and parsing

 Access to full text

 Full (PDF)

1. 1. A. V. AHO and J. D. ULLMAN, The Theory of Parsing, Translation and Compiling, Vols. I and II, Prentice Hall, Inc., Englewood Cliffs, N. J., 1972 and 1973. 
2. 2. J. N. GRAY and M. A. HARRISON, On the Covering and Reduction Problems for Contex-Free Grammars, J. Assoc. Comput. Mach., Vol. 19, 1972, pp. 675-697. Zbl0259.68035MR359410
3. 3. M. A. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass., 1978. Zbl0411.68058MR526397
4. 4. J. E. HOPCROFT and J. D. ULLMAN, Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969. Zbl0196.01701MR237243
5. 5. S. JARZABEK and T. KRAWCZYK, LL-Regular Grammars, Information Processing Letters, Vol. 4, 1975, pp. 31-37. Zbl0314.68026MR502296
6. 6. A. NIJHOLT, On the Parsing of LL-Regular Grammars, Proc. of the 5th Sympos. On the Mathematical Foundations of Computer Science, A. MAZURKIEWICZ, Ed., Lect. Notes in Comput. Science, Vol. 45, Springer, Berlin, 1976, pp. 446-452. Zbl0335.68053
7. 7. A. NIJHOLT, LL-Regular Grammars, Int. J. of Computer Mathematics, Vol. 8, 1980, pp. 303-318. Zbl0452.68083MR596308
8. 8. A. NIJHOLT, Context-Free Grammars: Covers, Normal Forms, and Parsing, Lect. Notes in Comput. Science, Vol. 93, Springer, Berlin, 1980. Zbl0477.68077MR590047
9. 9. A. NIJHOLT, The Equivalence Problem for LL- and LR-Regular Grammars, Proc. of the 3rd Sympos. On Fundamentals of Computation Theory, Lect. Notes in Comput. Science 117, M. CHYTIL and J. GRUSKA, Ed., Springer, Berlin, 1981, pp. 291-300. Zbl0465.68038MR652996
10. 10. D. A. POPLAWSKI, Error Recovery for Extended LL-Regular Parsers, Ph. D. Thesis, Purdue University, August 1978. 
11. 11. D. A. POPLAWSKI, On LL-Regular Grammars, J. Comput. System Sc., Vol. 18, 1979, pp. 218-227. Zbl0411.68060MR536397
12. 12. D. WOOD, Lecture Notes on Top-Down Syntax Analysis, J. of the Computer Society of India, Vol. 8, 1978, pp. 1-22.