|Iburg now available drh@Princeton.EDU (1993-02-10)|
|Iburg paper available drh@Princeton.EDU (1993-02-13)|
|Keywords:||tools, parse, FTP|
|Date:||Wed, 10 Feb 1993 04:42:23 GMT|
Iburg, a program that generates a fast tree parser, is now available. It
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.
Its matchers are slower but can be useful during development and for
teaching. The generated code is easy to read and to debug. It mirrors the
BURS specification in the same way that the code for a recursive-descent
parser mirrors its LL(1) grammar. Iburg has been used in compiler courses
and is described in the forthcoming LOPLAS paper "Engineering a simple,
efficient code generator generator."
Iburg and its documentation are available via anonymous ftp from
ftp.cs.princeton.edu (188.8.131.52) in pub/iburg.tar.Z.
Christopher W. Fraser, AT&T Bell Laboratories, email@example.com
David R. Hanson, Princeton University, firstname.lastname@example.org
Todd A. Proebsting, University of Arizona, email@example.com
Return to the
Search the comp.compilers archives again.