From LL-regular to LL(1) grammars : transformations, covers and parsing
RAIRO. Informatique théorique, Tome 16 (1982) no. 4, pp. 387-406. 
@article{ITA_1982__16_4_387_0,
     author = {Nijholt, Anton},
     title = {From $LL$-regular to $LL(1)$ grammars : transformations, covers and parsing},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {387--406},
     publisher = {EDP-Sciences},
     volume = {16},
     number = {4},
     year = {1982},
     mrnumber = {707639},
     zbl = {0498.68052},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1982__16_4_387_0/}
}
TY  - JOUR
AU  - Nijholt, Anton
TI  - From $LL$-regular to $LL(1)$ grammars : transformations, covers and parsing
JO  - RAIRO. Informatique théorique
PY  - 1982
SP  - 387
EP  - 406
VL  - 16
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1982__16_4_387_0/
LA  - en
ID  - ITA_1982__16_4_387_0
ER  - 
%0 Journal Article
%A Nijholt, Anton
%T From $LL$-regular to $LL(1)$ grammars : transformations, covers and parsing
%J RAIRO. Informatique théorique
%D 1982
%P 387-406
%V 16
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1982__16_4_387_0/
%G en
%F ITA_1982__16_4_387_0
Nijholt, Anton. From $LL$-regular to $LL(1)$ grammars : transformations, covers and parsing. RAIRO. Informatique théorique, Tome 16 (1982) no. 4, pp. 387-406. http://archive.numdam.org/item/ITA_1982__16_4_387_0/

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. 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. | MR | Zbl

3. M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass., 1978. | MR | Zbl

4. J. E. Hopcroft and J. D. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969. | MR | Zbl

5. S. Jarzabek and T. Krawczyk, LL-Regular Grammars, Information Processing Letters, Vol. 4, 1975, pp. 31-37. | MR | Zbl

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. | Zbl

7. A. Nijholt, LL-Regular Grammars, Int. J. of Computer Mathematics, Vol. 8, 1980, pp. 303-318. | MR | Zbl

8. A. Nijholt, Context-Free Grammars: Covers, Normal Forms, and Parsing, Lect. Notes in Comput. Science, Vol. 93, Springer, Berlin, 1980. | MR | Zbl

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. | MR | Zbl

10. D. A. Poplawski, Error Recovery for Extended LL-Regular Parsers, Ph. D. Thesis, Purdue University, August 1978.

11. D. A. Poplawski, On LL-Regular Grammars, J. Comput. System Sc., Vol. 18, 1979, pp. 218-227. | MR | Zbl

12. D. Wood, Lecture Notes on Top-Down Syntax Analysis, J. of the Computer Society of India, Vol. 8, 1978, pp. 1-22.