Code Index
All Code from this Course.
| A transducer that translates | |
| A grammar generating | |
| An active bottom-up chart recognizer. | |
| A transducer that doubles the number of | |
| A DCG for simple English sentences with pronouns that uses additional rules (see Section 5.2.3). | |
|
| |
| A very naive bottom-up recognizer. | |
| FSA-based parser for FSA with categories. | |
| A DCG for simple English relative clauses using gap threading. | |
| A DCG for simple English relative clauses (see Section 5.3.2). | |
| A not very promising extension of | |
| A DCG for simple English sentences with pronouns using features (see Section 5.2.3). | |
| A small DCG for very simple English sentences (see Section 5.2.1). | |
| Deterministic and | |
| A grammar with an empty production. | |
| ``laughing-machines'' from Section 1.4.1. | |
| Further ``laughing-machines'' needed in the Practical session. | |
| FSAs for ``Harry Potter-phrases'' from Exercise 1.1 (with and without categories). | |
| A left corner recognizer. | |
| The left corner recognizer using a left-corner table | |
| A left recursive context free grammar. | |
| The complete program for operations on FSAs. | |
| Our English grammar fragment. | |
| An FSA-based parser. | |
| A bottom-up chart recognizer. | |
| Predicate | |
| A recognizer/generator for FSAs (with or without jump arcs). | |
| A version of the recognizer/generator that only works for FSAs without jump arcs (use it in the Practical Session). | |
| The driver predicate for our implementation of the | |
| A semantically annotated DCG. | |
| Auxiliary predicates for semantics construction. | |
| Definitions of operators used in semantic representations | |
| Simplified version of | |
| A driver for transducers. | |
| A driver for transducers using lexicon entries ( | |
| A DCG for simple English sentences with pronouns that overgenerates (see Section 5.2.3). |
.
-conversion. 
free ``laughing machine'' for use in the Exercises. 
-calculus.