Rewriting Strategies in Java | Zendy

Émilie Balland | Zendy; PierreEtienne Moreau | Zendy; Antoine Reilles | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Rewriting Strategies in Java

Author(s) -

Émilie Balland,

PierreEtienne Moreau,

Antoine Reilles

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.10.037

Subject(s) - programming language , computer science , rewriting , bytecode , java , interpreter , java bytecode , combinatory logic , transformation (genetics) , scala , key (lock) , program transformation , visitor pattern , feature (linguistics) , theoretical computer science , java annotation , java applet , linguistics , biochemistry , chemistry , philosophy , computer security , gene

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research