Parse-Tree Annotations Meet Re-Engineering Concerns

Authors

Jan Kort and Ralf Lämmel

Download

• Final paper in proceedings: [.ps], [.pdf]
• Slides presented at conference: [.ps], [.pdf]

Paper abstract

We characterise a computational model for processing annotated parse trees. The model is basically rewriting-based with specific provisions for dealing with annotations along the ordinary rewrite steps. Most notably, there are progression methods, which define a default for annotating the results of rewriting. There are also access methods, which can be used in the rewrite rules in order to retrieve annotations from the input and to establish annotations in the output.

Our approach extends the basic rewriting paradigm with support for the separation of concerns that involve annotations. This is motivated in the context of transformations for software re-engineering where annotations can be used to implement concerns such as layout preservation and reversible preprocessing.

Bibtex entry

@inproceedings{KL-SCAM03,
 author      = "J.~Kort and R.~L{\"a}mmel",
 title       = "{Parse-Tree Annotations Meet Re-Engineering Concerns}",
 booktitle   = "{Proc.\ Source Code Analysis and Manipulation (SCAM'03)}",
 publisher   = "IEEE Computer Society Press",
 year        = 2003,
 month       = sep,
 note        = "10 pages"
}

Note

An early version of this paper was presented at the German Workshop on Aspect-Oriented Software Development (AOSD-GI 2003) of the Special Interest Group Object-Oriented Software Development of the German Informatics Society, in Essen (Germany), in March 2003.