By Letter: Non-alphabet | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
  Email this page to a friend


Iburg




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).



< Previous TermsTerms Containing IburgNext Terms >
IBM PCjr
IBM PC XT
IBM Systems Engineer
IBM zSeries
Ibpag2
Iburg
Tbl
IC
ICAM
ICANN
I-CASE
ICBM address


Web Standards & Support:

Link to and support eLook.org Powered by LoadedWeb Web Hosting
Valid XHTML 1.0! Valid CSS! eLook.org FireFox Extensions