| BURS ? | |
| ? | |
| parser generator? | |
| Christopher W. Fraser <cwf@research.att.com>, David R. Hanson <drh@princeton.edu>, Todd A. Proebsting <todd@cs.arizona.edu> | |
| ftp://ftp.cs.princeton.edu/pub/iburg.tar.Z | |
| Iburg is a program that generates a fast tree parser. 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. | |
| Febuary 10th, 1993 |
category: compiler generators and related tools summary, or expanded.
category: text manipulation summary, or expanded.
Please send updates to free-compilers@idiom.com
The HTML is maintained by David Muir Sharnoff and the entries themselves are currently maintained by Bryan Miller.
Copyright (c) 1992-1998 David Muir Sharnoff, All Rights Reserved
Copyright (c) 1994-1996, Steven Allen Robenalt, All Rights Reserved