A program by Christopher W. Fraser <cwf@research.att.com>,
David R. Hanson <drh@princeton.edu> and Todd A. Proebsting
<todd@cs.arizona.edu> that generates a fast tree parser.

Iburg is compatible with Burg. Both programs accept a
cost-augmented tree grammar and emit a C program that
discovers an optimal parse of trees in the language described
by the grammar. They have been used to construct fast optimal
instruction selectors for use in code generation. Burg uses
BURS. Iburg's matchers do dynamic programming at compile
time.

ftp://ftp.cs.princeton.edu/pub/iburg.tar.Z.

(1993-02-10)