Christopher W. Fraser
Robert R. Henry
- [AGT89] Alfred V. Aho, Mahadevan Ganapathi, and Steven W. K. Tjiang. Code generation using tree matching and dynamic programming. ACM Transactions on Programming Languages and Systems, 11(4):491-516, October 1989. Google Scholar
Digital Library
- [AJ79] Alfred V. Aho and Steven C. Johnson. Optimal code generation for expression trees. Journal of the ACM, 23(3):458-501, July 1976. Google ScholarDigital Library
- [APP87] Andrew W. Appel. Concise specification of locally optimal code generators. Technical report CS-TR-080-87, Princeton University, 1987.Google Scholar
- [BDB90] A. Balachandran, D. M. Dhamdhere, and S. Biswas. Efficient retargetable code generation using bottom-up tree pattern matching. Computer Languages, 15(3):127-140, 1990. Google ScholarDigital Library
- [BMW87] Jürgen Börstler, Ulrich Mönche, and Reinhard Wilhelm. Table compression for tree automata. Technical Report Aachener Informatik-Berichte No. 87-12, RWTH Aachen, Fachgruppe Informatik, Aachen, Fed. Rep. of Germany, 1987.Google Scholar
- [Cha87] David R. Chase. An improvement to bottom up tree pattern matching. Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 168-177, January 1987. Google ScholarDigital Library
- [FH91] Christopher W. Fraser and Robert R. Henry. Hard-coding bottom-up code generation tables to save time and space. Software-Practice & Experience, 21(1):1-12, January 1991. Google ScholarDigital Library
- [HC86] Philip J. Hatcher and Thomas W. Christopher. High-quality code generation via bottom-up tree pattern matching. Thirteenth Annual ACM Symposium on Principles of Programming Languages, pages 119-130, January 1986. Google ScholarDigital Library
- [Hen89] Robert R. Henry. Encoding optimal pattern selection in a table-driven bottom-up tree-pattern matcher. Technical Report 89-02-04, University of Washington Computer Science Department, Seattle, WA, February 1989.Google Scholar
- [HO82] Christoph Hoffmann and Michael J. O'Donnell. Pattern matching in trees. Journal of the ACM, 29(1):68-95, January 1982. Google ScholarDigital Library
- [Kro75] H. H. Kron. Tree Templates and Subtree Transformational Grammars. PhD thesis, UC Santa Cruz, December 1975. Google ScholarDigital Library
- [PL87] Eduardo Pelegri-Llopart. Tree Transformations in Compiler Systems. PhD thesis, UC Berkeley, December 1987.Google Scholar
- [PLG88] Eduardo Pelegri-Llopart and Susan L. Graham. Optimal code generation for expression trees: An application of BURS theory. Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 294-308, January 1988. Google ScholarDigital Library
- [Pro91] Todd A. Proebsting. Simple and efficient BURS table generation. Technical report, Department of Computer Sciences, University of Wisconsin, 1991.Google Scholar
Index Terms
- BURG: fast optimal instruction selection and tree parsing
Recommendations
An evaluation of speculative instruction execution on simultaneous multithreaded processors
Modern superscalar processors rely heavily on speculative execution for performance. For example, our measurements show that on a 6-issue superscalar, 93% of committed instructions for SPECINT95 are speculative. Without speculation, processor resources ...
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced
Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced
Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...
Comments