In this appendix we define the grammar that we are going to use
to demonstrate the uniform tabular algorithm. It is basically the same
grammar (with minor changes) as the one introduced in [VanNoord1993] to
demonstrate his head-driven bottom-up algorithms. In the rules we
already make use of the more readable notation introduced in chapter
3. The rules will be enumerated using the index ( 
).
In the text, we basically refer to the individual rules using this index.
First, the grammar rules.
Next, the lexical entries.
