Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

ECOOP
2004
Springer

favoriteEmaildiscussreport

82views Programming Languages» more ECOOP 2004»

Rewritable Reference Attributed Grammars

14 years 4 months ago

Rewritable Reference Attributed Grammars

Download www.cs.lth.se

This paper presents an object-oriented technique for rewriting abstract syntax trees in order to simplify compilation. The technique, Rewritable Reference Attributed Grammars (ReRAGs), is completely declarative and supports both rewrites and computations by means of attributes. We have implemented ReRAGs in our aspect-oriented compiler compiler tool JastAdd II. Our largest ap

Torbjörn Ekman, Görel Hedin

Real-time Traffic

Abstract Syntax Trees | Compiler Tool Jastadd | ECOOP 2004 | Programming Languages | Reference Attributed Grammars |

claim paper

Related Content

» Reference Attributed Grammars

» Program Visualization Using Reference Attributed Grammars

» The JastAdd extensible Java compiler

» Recognition of Linear ContextFree Rewriting Systems

» Modularity first a case for mixing AOP and attribute grammars

» A Segmentation Method for Bibliographic References by Contextual Tagging of Fields

» Graph Transformation with Variables

» Graph Grammar Based Product Family Modeling

» Implementing Circularity Using Partial Evaluation

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ECOOP
Authors	Torbjörn Ekman, Görel Hedin

Comments (0)