Examples: Recognition Revisited

	..	Index to Examples.
	10/01	Simple state table.
	10/02	Bootstrapping the BNF-based parser generator.
	10/03	Shift/reduce conflict: dangling 'else'.
	10/04	Reduce/reduce conflict.
	10/05	Immediate evaluation of arithmetic expressions.
	10/06	Immediate evaluation of arithmetic expressions: conflicts.
	10/07	Immediate evaluation of arithmetic expressions using precedence table.
	10/08	Conflict-free "dangling else" using rule precedence.
	10/09	Unary minus.
	10/10	Unary minus with (lower) rule precedence.
	10/11	BNF rule precedence in EBNF.
	10/12	EBNF structures in BNF: one or more sequences.
	10/13	EBNF structures in EBNF: one or more sequences.
	10/14	EBNF to BNF translations of { x }.
	10/15	Error recovery in a non-empty list.
	10/16	Error recovery in typical iteration constructs.
	10/17	Error recovery in typical iteration constructs: collect rule usage.
	10/18	Error recovery in successive non-empty lists.
	10/19	Error recovery in EBNF iteration constructs.