(Enter summary)
Abstract: This document describes only that fraction of the BURS model that is required to use Burg.
Readers interested in more detail might start with Reference [4]. Other relevant documents include
References [5-14] (Update)
Context of citations to this paper: More
...on the accumulated cost of a tree. Dynamic programming techniques can be used to compute all possible parses in one traversal. Burg [24, 25, 45] is a system for code generation from intermediate representation (ir) expression trees. A mapping from ir trees to machine...
Cited by: More
A Survey of Strategies in Program Transformation Systems - Visser (2001)
(Correct)
Active bibliography (related documents): More All
1.4: Code Generation Techniques - Proebsting (1992)
(Correct)
0.7: BURG - Fast Optimal Instruction Selection and Tree Parsing - Fraser, Henry, al. (1991)
(Correct)
0.6: Code Generation = A* + BURS - Nymeyer, Katoen, Westra, Alblas (1996)
(Correct)
Similar documents based on text: More All
0.2: Detecting Pipeline Structural Hazards Quickly - Proebsting, Fraser (1994)
(Correct)
0.2: Hard-coding Bottom-up Code Generation Tables to Save Time and.. - Fraser, Henry (1991)
(Correct)
0.2: Induction Operators and Intermediate Forms - Fraser, Proebsting
(Correct)
BibTeX entry: (Update)
C. W. Fraser, R. R. Henry, and T. A. Proebsting. BURG|fast optimal instruction selection and tree parsing. ACM SIGPLAN Notices, 27(4):68-76, April 1992. http://citeseer.ist.psu.edu/fraser92fast.html More
@misc{ fraser92fast,
author = "C. Fraser and R. Henry and T. Proebsting",
title = "fast optimal instruction selection and tree parsing",
text = "C. W. Fraser, R. R. Henry, and T. A. Proebsting. BURG|fast optimal instruction
selection and tree parsing. ACM SIGPLAN Notices, 27(4):68-76, April 1992.",
year = "1992",
url = "citeseer.ist.psu.edu/fraser92fast.html" }
Citations (may not include all citations):
91
Code generation using tree matching and dynamic programming (context) - Aho, Ganapathi et al. - 1989
56
Pattern matching in trees (context) - Hoffmann, O'Donnell - 1982
53
Optimal code generation for expression trees (context) - Aho, Johnson - 1976
22
Simple and efficient BURS table generation (context) - Proebsting - 1991
20
An improvement to bottom up tree pattern matching (context) - Chase - 1987
19
Optimal code generation for expression trees: An application.. (context) - Pelegri-Llopart, Graham - 1988
17
Efficient retargetable code generation using bottom-up tree .. (context) - Balachandran, Dhamdhere et al. - 1990
8
Hard-coding bottom-up code generation tables to save time an..
- Fraser, Henry - 1991
8
Encoding optimal pattern selection in a table-driven bottom-.. (context) - Henry - 1989
6
High-quality code generation via bottom-up tree pattern matc.. (context) - Hatcher, Christopher - 1986
5
Tree Templates and Subtree Transformational Grammars (context) - Kron - 1975
4
Concise specification of locally optimal code generators
- Appel - 1987
3
Technical Report Aachener Informatik-Berichte No (context) - Borstler, Monche et al. - 1987
1
Tree Transformations in Compiler Systems (context) - Pelegri-Llopart - 1987
Documents on the same site (http://www.cs.ucsb.edu/~ckrintz/papers/): More
NWSLite: A Non-Parametric Prediction Utility for.. - Gurun, Krintz, Wolski
(Correct)
Efficient Representation and Validation of Proofs - Necula, Lee (1998)
(Correct)
A Machine Learning Approach to Automatic Production of.. - Monsifrot, Bodin.. (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC