What Are Logic Grammars?
Part of the Symbolic Computation book series (SYMBOLIC)
Logic grammars can be thought of as ordinary grammars in the sense of formal language theory, in that they comprise generalized type-0 rewriting rules-rules of the form: “rewrite α into β,” noted:
where α and β are strings of terminals and nonterminals. A terminal indicates a word in the input sequence. A sequence of terminals takes the form of a Prolog list. Nonterminals indicate constituents. In this text, they take the form of a Prolog structure, where the functor names the category of the constituent and the arguments give information like number class, meaning etc.
$$\alpha \to \beta $$
Unable to display preview. Download preview PDF.
© Springer-Verlag New York Inc. 1989