JournalofProgrammingLanguages5,1997,189-199 Kyung-WooKang,Kwang-MooChoe...  Home/Search
Context
Related
| compscinet.dcs.kcl.ac.uk...jp050107.pdf 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: compscinet.dcs.kcl...jp050107.abs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we consider a bottom-up tree pattern matching scheme that allows arbitrary cost values, emphasizing the efficiency of the scheme and the size of the code generator. To find the efficiency of the scheme, we observe that a solution can be systematically derived by close examination of some relations between tree patterns. The bottom-up tree pattern matching scheme with DP (Fraser et al. 1992, Gough 1996) traverses the intermediate representation tree twice. (Update)
Similar documents (at the sentence level):
14.3%: An Efficient Method of Constructing States in Bottom-Up Tree.. - Kang, Choe (1996) (Correct)
Active bibliography (related documents): More All
0.5: An Evaluation of an Automatically Generated Compiler - Sloane (1995) (Correct)
0.3: The Systematic Development of a Pattern-Matching Algorithm using.. - Nymeyer (1997) (Correct)
0.2: Optimal Code-Selection using MBURG - John Gough Jeff (Correct)
Similar documents based on text: More All
0.1: New Prescription in light-cone gauge theories - Park Department (Correct)
0.1: A Spatial Scheduling System and its Application to.. - Lee, Lee, Choi (1996) (Correct)
0.1: Estimating Uncaught Exceptions in Standard ML Programs from.. - Yi, Ryu, Pyun (Correct)
BibTeX entry: (Update)
@misc{ min-soojung-efficient,
author = "Kyung-Wookang Kwang-Moochoe Min-Soojung",
title = "An Efficient Bottom-Up Tree Pattern Matching That Performs Dynamic Programming
for Code Generation",
url = "citeseer.ist.psu.edu/404099.html" }
Citations (may not include all citations):1399 Compilers -- Principles (context) - Aho, Sethi et al. - 1986
98 Compiler: Design and Implementation (context) - Fraser, Hanson et al. - 1995
91 Code generation using tree matching and dynamic programming (context) - Aho, Ganapathi et al. - 1989
67 BURG -- fast optimal instruction selection and tree parsing - Fraser, Henry et al. - 1991
56 Pattern matching in trees (context) - Hoffmann, O'Donnell - 1982
36 Compiler Design (context) - Wilhelm, Maurer - 1995
26 Department of Computer Science - bottom-up, matching et al. - 1992
22 Simple and efficient BURS table generation (context) - Proebsting - 1992
21 The complexity of trie index construction (context) - Comer, Sethi - 1977
20 An improvement to bottom-up tree pattern matching (context) - Chase - 1987
19 Optimal code generation for expression trees: an application.. (context) - Pelegri-Liopart, Graham - 1988
17 Efficient retargetable code generation using bottom-up tree .. (context) - Balachandran, Dhamdhere et al. - 1990
4 Bottom-up tree rewriting tool MBURG - Gough - 1996
2 Engineering a simple (context) - Fraser, Hanson et al. - 1992
2 the automatic generation of instruction selector using botto.. - Kwang, Choe - 1995
1 Rewrite systems (context) - Pelegri-Liopart - 1988
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