%0 Conference Paper %B Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation - PEPM %D 2014 %T Generating Attribute Grammar-based Bidirectional Transformations from Rewrite Rules %A Pedro Martins %A João Alexandre Saraiva %A João Paulo Fernandes %A Eric Van Wyk %C San Diego, USA %X

Higher order attribute grammars provide a convenient means for specifying uni-directional transformations, but they provide no direct support for bidirectional transformations. In this paper we show how rewrite rules (with non-linear right hand sides) that specify a forward/get transformation can be inverted to specify a partial backward/put transformation. These inverted rewrite rules can then be extended with additional rules based on characteristics of the source language grammar and forward transformations to create, under certain circumstances, a total backward transformation. Finally, these rules are used to generate attribute grammar specifications implementing both transformations.

%8 January %> https://haslab.uminho.pt/sites/default/files/prmartins/files/pepm2014.pdf