Pelegri-Liopart, E. (1988) Rewrite systems, pattern matching, and code generation. PhD Dissertation. Report No. UCB/CSD 84/184, CSD, EECS, University of California, Berkeley, CA. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
An Efficient Bottom-Up Tree Pattern Matching That.. - Kyung-Wookang.. (Correct)
.... fficiently,anditsmanipulationiseasy(ProebstingandFischer1992) SinceitsdevelopmentbyHoffman et al. 1982) treepatternmatchingwithdynamicprogramming(DP)hasbeenacceptedasapractical techniqueforcodegeneratorsandcodegeneratorgenerators(CGGs)(Pelegri Liopart1988,Ahoetal. 1989,Balachandranetal.1990,Fraseretal.1991,Proebsting1992,ProebstingandFischer1992, Fraseretal.1992,FraserandHanson1995,Gough1996) CodegeneratorswhichusestreepatternmatchingcanbeautomaticallygeneratedfrommachinespecificationbyaCGG. ....
.... tree pattern matching is theoretically much faster than any other tree pattern matching (Hoffman et al. 1982, Pelegri Liopart and Graham 1988, Fraser et al. 1992) We can say that the bottom up rewrite system (BURS) is efficient because it executes the DP technique at compile compile time (Pelegri Liopart 1988, Proebsting and Fischer 1992) However, BURS requires a lot of time and space to generate a pattern matcher and has the restriction that the costs used in the tree rewrite system must be constant. A typical CGG based on BURS is burg (Proebsting 1992) The matching scheme adopting the DP technique ....
[Article contains additional citation context not shown here]
Pelegri-Liopart, E. (1988) Rewrite systems, pattern matching, and code generation. PhD Dissertation. Report No. UCB/CSD 84/184, CSD, EECS, University of California, Berkeley, CA.
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