Name
Abstract | ||
|---|---|---|
In any language designed to express transformations, the notion of rewrite rule is a key feature. Its conciseness as well as its strong theoretical foundations are essential. The notion of strategy is complementary: this describes how rules are applied. In this paper, we show how a high-level strategy language can be implemented in a Java setting. We present the integration of the visitor combinator design pattern into Tom. This corresponds to an interpreter for strategy expressions. To be more efficient, we present a compilation method based on bytecode specialization. This low-level transformation is expressed in Tom itself, using rules and strategies. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.entcs.2008.10.037 | Electronic Notes in Theoretical Computer Science |
Keywords | DocType | Volume |
design pattern,high-level strategy language,low-level transformation,rewriting strategy,key feature,tom,compilation method,java setting,strategy expression,rewriting strategies,strong theoretical foundation,bytecode specialization,java,visitor combinator design pattern | Journal | 219, |
ISSN | Citations | PageRank |
Electronic Notes in Theoretical Computer Science | 5 | 0.43 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emilie Balland | 1 | 233 | 14.22 |
| Pierre-etienne Moreau | 2 | 598 | 40.40 |
| Antoine Reilles | 3 | 119 | 6.79 |