Andrew W. Appel  Home/Search
Context Related
| princeton.edu/~appel/papers/80.ps princeton.edu/faculty/appel/pap...80.ps princeton.edu/fac/appel/papers/80.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: princeton.edu/~appel/vita (more) From: princeton.edu/faculty/appe...vita (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Dynamic programming allows locally optimal instruction selection for expression trees. More importantly, the algorithm allows concise and elegant specification of code generators. Aho, Ganapathi, and Tjiang have built the Twig code-generator-generator, which produces dynamic-programming code-generators from grammar-like specifications. Encoding a complex architecture as a grammar for a dynamic-programming codegenerator -generator shows the expressive power of the technique. Each instruction,... (Update)
Context of citations to this paper: More
...to construct fast optimal instruction selectors for use in code generation. Burg addresses many of the problems addressed by Twig [AG85, App87] but it is somewhat less flexible and much faster. Burg is available via anonymous ftp from kaese.cs.wisc.edu. The compressed shar...
...manipulation program implemented in C by S. W. K. Tjiang, which can be used for various purposes, especially for writing code generators [4]. ML Twig is not a clone of Twig, but a similar tool adjusted to fit the Standard ML environment. The user writes a specification of a...
Cited by: More
Fast Optimal Instruction Selection and Tree Parsing - Christopher Fraser Att (1992) (Correct)
BURG - Fast Optimal Instruction Selection and Tree Parsing - Fraser, Henry, al. (1991) (Correct)
ML-Twig User's Manual - Rintanen (1989) (Correct)
Active bibliography (related documents): More All
0.6: Retargetable Instruction Scheduling for Pipelined Processors - Bradlee (1991) (Correct)
0.4: CSDL: Reusable Computing System Descriptions for Retargetable.. - Bailey (Correct)
0.3: Semantics-Directed Code Generation - Appel (1985) (Correct)
Similar documents based on text: More All
0.2: Static Resource Models for Code-Size Efficient Embedded.. - Zhao, Mesman, Basten (2002) (Correct)
0.1: Counting Twig Matches in a Tree - Chen, Jagadish, Korn, Koudas (2001) (Correct)
0.1: Engineering Efficient Code Generators using Tree.. - Fraser, Hanson.. (1992) (Correct)
Related documents from co-citation: More All
4: Code generation using tree matching and dynamic programming (context) - Aho, Ganapathi et al. - 1989
4: Optimal Code Generation for Expression Trees (context) - Aho, Johnson - 1976
3: Technical Report Aachener Informatik-Berichte (context) - Borstler, Monche et al. - 1987
BibTeX entry: (Update)
Andrew W. Appel. Concise specifications of locally optimal code generators. Technical Report CS-TR-080-87, Princeton University, Dept. of Computer Science, Princeton, New Jersey, February 1987. http://citeseer.ist.psu.edu/appel87concise.html More
@misc{ appel87concise,
author = "A. Appel",
title = "Concise specifications of locally optimal code generators",
text = "Andrew W. Appel. Concise specifications of locally optimal code generators.
Technical Report CS-TR-080-87, Princeton University, Dept. of Computer Science,
Princeton, New Jersey, February 1987.",
year = "1987",
url = "citeseer.ist.psu.edu/appel87concise.html" }
Citations (may not include all citations):91 Code generation using tree matching and dynamic programming (context) - Aho, Ganapathi et al. - 1989
87 Recognition and parsing of context-free languages in time n .. (context) - Younger - 1967
66 The generation of optimal code for arithmetic expressions (context) - Sethi, Ullman - 1970
56 Pattern matching in trees (context) - Hoffmann, O'Donnell - 1982
54 Complete register allocation problems (context) - Sethi - 1975
53 Optimal code generation for expression trees (context) - Aho, Johnson - 1976
35 Computer Structures: Readings and Examples (context) - Bell, Newell - 1971
27 An efficient recognition and syntax algorithm for context-fr.. (context) - Kasami - 1965
26 A New Method for Compiler Code Generation (context) - Glanville, Graham - 1978
21 A generalization of Dijkstra's algorithm (context) - Knuth - 1977
20 Code generation for a one-register machine (context) - Bruno, Sethi - 1976
16 On programming of arithmetic operations (context) - Ershov - 1958
12 Automatic Generation of Peephole Optimizations (context) - Davidson, Fraser - 1984
11 Anatomy of a hardware compiler (context) - Keutzer, Wolf - 1988
10 Formalization and automatic derivation of code generators (context) - Cattell - 1978
8 An Experiment in Table Driven Code Generation (context) - Graham, Henry et al. - 1983
8 Twig Reference Manual (context) - Tjiang - 1986
7 Generalizations of the Sethi-Ullman algorithm for register a.. - Appel, Supowit - 1987
6 Englewood Cliffs (context) - -Bit, Manual - 1985
6 Digital Equipment Corp (context) - Handbook - 1979
5 Simplifying Code Generation Through Peephole Optimization (context) - Davidson - 1981
5 Experience with a Graham-Glanville style code generator (context) - Aigrain, Graham et al. - 1984
4 Discovering machine-specific code improvements (context) - Kessler - 1986
4 A compact, machine-independent peephole optimizer (context) - Fraser - 1979
3 Retargetable Code Generation and Optimization using Attribut.. (context) - Ganapathi - 1980
Documents on the same site (http://www.cs.princeton.edu/~appel/vita.html): More
Generalizations of the Sethi-Ullman algorithm for register.. - Appel, Supowit (1987) (Correct)
Standard ML of New Jersey - Appel, MacQueen (1991) (Correct)
An Empirical and Analytic Study of Stack vs. Heap Cost for.. - Appel, Shao (1993) (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