An append-rule (ID/LP) grammar in Prolog

A linguistic application of the basic principles of fact, rules and queries in Prolog is applied in this section to grammar writing. This is the first of three different kinds of grammar writing in Prolog:

1. Append-rule grammars.
2. Finite State Automata and Finite State Transducers (FSAs and FSTs).
3. Definite Clause Grammars (DCGs)

The kind of grammar introduced in this section will be referred to as the `append-rule' type. The other types will be introduced, and explained further, at the appropriate places.

 
• Grammar development as an interactive process
• ID/LP grammar and lexicon
• Prolog implementation
• Main Prolog caller
• Query output
• Error Messages
• Tasks