Generating attribute grammar-based bidirectional transformations from rewrite rules

• Type: Article in International Conference Proceedings Book
• Date: 2014

Authors

Martins, P (Author) Other; Saraiva, J (Author) Other; Joao Paulo Fernandes (Author) Other; Van Wyk, E (Author) Other

Conference proceedings International

Title: Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, PEPM 2014, January 20-21, 2014, San Diego, California, USA

Pages: 63-70

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2014 - Co-located with POPL 2014

San Diego, CA, 20 January 2014 through 21 January 2014

Indexing

Scopus - 4 Citations

Other information

Authenticus ID: P-009-C14

DOI: 10.1145/2543728.2543745

Abstract (EN): 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. Categories and Subject Descriptors D.3.3 [Programming Languages]: Data Types and Structures, Recursion; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages- Algebraic approaches to semantics; I.1.1 [Symbolic and Algebraic Manipulation]: Expressions and Their Representation.

Language: English

Type (Professor's evaluation): Scientific