[1] M. Chytil: Automata and Grammars (in Czech). SNTL, Prague 1984.

[2] K.S. Fu: Syntactic Pattern Recognition and Applications. Prentice-Hall, Englewood Cliffs, N.J. 1982. Zbl 0521.68091

[3] R. Kurki-Suonio: On top-to-bottom recognition and left recursion. Coram. ACM 9 (1966), 7, 527 - 528. Zbl 0138.10107

[4] W.F. Clocksin, C.S. Mellish: Programming in Prolog. Second edition. Springer-Verlag, Berlin - Heidelberg - New York 1984.

[5] Turbo Prolog - the natural language of artificial intelligence. Owner's Handbook, Borland Inter- national, Inc. 1988.

[6] T. V. Griffiths, S. R. Petrick: On the relative efficiencies of context-free grammar recognizers. Comm. ACM 8 (1965), 5, 289 - 300. Zbl 0131.16006

[7] J. Earley: An efficient context-free parsing algorithm. Comm. ACM 13 (1970), 2, 94 - 102. Zbl 0185.43401

[8] J. Kepka: The Top-Down Parsing of Context-Free Languages and Its Realization in Turbo Prolog (in Czech). Research Report No. 1681, UTIA CSAV, Prague 1990.