Natural Language Communication with Computers

Volume 63 of the series Lecture Notes in Computer Science pp 133-188


Metamorphosis grammars

  • A. ColmerauerAffiliated withGROUPE D'INTELLIGENCE ARTIFICIELLE U.E.R. Scientifique de Luminy, Université d'Aix-Marseille II

* Final gross prices may vary according to local VAT.

Get Access


We present some very general grammars in which each re-writing rule is of the type: “replace such and such sequence of trees by such and such another sequence of trees”. Within the framework of programming in first-order logic, we propose axioms for these grammars which produce efficient parsing and syntheses algorithms. We illustrate this work by the programming-language PROLOG and by two important examples: writing of a compiler and writing of an intelligent system conversing in French.


Grammars syntactic analysis 1st order logic predicate calculus automatic demonstration compilation natural language