gp is the TOM parser generator. It generates a recursive descent
parser given an LL(1) grammar. The current implementation of gp
is a quick hack, especially with respect to error recovery (which is
totally absent) en the lexer interface (which is a manual retrofit to
flex, with all limitations implied by it). However, being written in
TOM, gp serves as an excellent compiler and environment test
case.
Go to the first, previous, next, last section, table of contents.