Date: 24 Nov 2005

Metamorphosis grammars

* Final gross prices may vary according to local VAT.

Get Access

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.