Metamorphosis grammars

  • A. Colmerauer
Conference paper

DOI: 10.1007/BFb0031371

Part of the Lecture Notes in Computer Science book series (LNCS, volume 63)
Cite this paper as:
Colmerauer A. (1978) Metamorphosis grammars. In: Bolc L. (eds) Natural Language Communication with Computers. Lecture Notes in Computer Science, vol 63. Springer, Berlin, Heidelberg

Abstract

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.

Key-words

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1978

Authors and Affiliations

  • A. Colmerauer
    • 1
  1. 1.GROUPE D'INTELLIGENCE ARTIFICIELLE U.E.R. Scientifique de LuminyUniversité d'Aix-Marseille IIMarseilleFrance

Personalised recommendations