Rewriting Strategies in Java - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Rewriting Strategies in Java


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.
Fichier principal
Vignette du fichier
final.pdf (237.58 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00274919 , version 1 (21-04-2008)


  • HAL Id : inria-00274919 , version 1


Emilie Balland, Pierre-Etienne Moreau, Antoine Reilles. Rewriting Strategies in Java. The Eighth International Workshop on Rule-Based Programming - RBP'07, Jun 2007, Paris, France. ⟨inria-00274919⟩
105 View
196 Download


Gmail Mastodon Facebook X LinkedIn More