Formal grammars, normal forms and parsing algorithms

[Aho and Ullman, 1972]
A. Aho and J. Ullman. The Theory of Parsing, Translation and Compiling, Vol. 1: Parsing. Prentice-Hall, Englewood Cliffs, 1972.

[Chomsky, 1957]
N. Chomsky. Syntactic Structures. Mouton, La Haye, 1957.

[Earley, 1970]
J. Earley. An efficient context-free parsing algorithm. Communications of the Association for Computing Machinery, 13(2):94-102, 1970.

[Gazdar and Mellish, 1989]
G. Gazdar and C. Mellish. Natural Language Processing in Prolog : An Introduction to Computational Linguistics. Addison-Wesley, Reading, Massachusetts, 1989.

[Gazdar et al., 1985]
G. Gazdar, E. Klein, G. Pullum, and I. Sag. Generalized Phrase Structure Grammar. Basil Blackwell, Oxford, 1985.

[Gross and Lentin, 1970]
M. Gross and A. Lentin. Notion sur les Grammaires Formelles. Gauthier-Villars, Paris, 2-ème edition, 1970.

[Harrison, 1978]
M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Massachusetts, 1978.

[Hopcroft and Ullman, 1979]
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading, Massachusetts, 1979.

[Miller and Torris, 1990]
P. Miller and T. Torris. Formalismes Syntaxiques pour le Traitement Automatique du Langage Naturel. Hermès, Paris, 1990.

[Pereira and Warren, 1980]
F. Pereira and D. Warren. Definite clause grammar for language analysis -- a survey of the formalism and a comparison with ATN. Artificial Intelligence, 13:231-278, 1980.

[Rosenkrantz, 1967]
D.J. Rosenkrantz. Matrix equations and normal forms for context-free grammars. Journal of the Association for Computing Machinery, 14(3):501-507, 1967.

[Younger, 1967]
D. Younger. Recognition and parsing of context-free languages in time n3. Information and Control, 10(2):189-208, 1967.

pdupont@info.ucl.ac.be