One-pass, optimal tree parsing --- with or without trees (1996) [5 citations — 0 self]
Download:
|
|
by Todd A. Proebsting, Benjamin R. Whaley
Compiler Construction (CC'96), pages 294--308, Linkoping
ftp://ftp.cs.arizona.edu/reports/1995/TR95-10.ps
Add To MetaCart
Abstract:
This paper describes the theory behind and implementation of wburg, a code-generator generator that accepts tree grammars as input and produces a code generator that emits an optimal parse of an IR tree in just a single bottom-up pass. Furthermore, wburg eliminates the need for an explicit IR tree altogether. The generated parser emits optimal code, and can do so without retaining an entire IR tree during its single pass. The grammars that wburg-generated parsers can parse are a proper subset of those that the two-pass systems can handle. However, analysis indicates that wburg can optimally handle grammars for most major instruction sets, including the SPARC, the MIPS R3000, and the x86.
Citations
| 134 | A Retargetable C Compiler: Design and Implementation – Fraser, C, et al. - 1995 |
| 115 | Pattern matching in trees – Hoffmann, O'Donnell - 1982 |
| 98 | Engineering a simple, efficient codegenerator generator – Fraser, Hanson, et al. - 1992 |
| 96 | Project Oberon: The Design of an Operating System and Compiler – Wirth, Gutknecht - 1992 |
| 88 | Code generation using tree matching and dynamic programming – Aho, Ganapathi, et al. - 1989 |
| 61 | BEG--a generator for efficient back ends – Emmelmann, Schroer, et al. - 1989 |
| 42 | fast optimal instruction selection and tree parsing – BURG - 1992 |
| 40 | Optimal code generation for expression trees: An application of BURS theory – Pelegr'i-Llopart, Graham - 1988 |
| 28 | Efficient retargetable code generation using bottom-up tree pattern matching. Computer Languages – Balachandran, Dhamdhere, et al. - 1990 |
| 26 | Simple and efficient BURS table generation – Proebsting - 1992 |
