Reference Attribute Grammar Controlled Graph Rewriting: Motivation and Overview
(2015) 8th ACM SIGPLAN International Conference on Software Language Engineering p.89-100- Abstract
- Reference attribute grammars are a well-known language engineering technique for the implementation of semantic analyses. Reference attributes provide declarative means to extend abstract syntax trees to graphs and analyse such graphs; they are well-suited to deduce and reason about abstract syntax graphs. Efficient attribute re-evaluation in case of abstract syntax graph changes and a systematic integration of attribute-based analyses with further rewrite-based transformations are open research problems however. To solve these problems, a novel incremental syntax-directed compiler-compiler technique is presented, that seamlessly combines reference attribute grammars and graph rewriting. The presented technique not only permits incremental... (More)
- Reference attribute grammars are a well-known language engineering technique for the implementation of semantic analyses. Reference attributes provide declarative means to extend abstract syntax trees to graphs and analyse such graphs; they are well-suited to deduce and reason about abstract syntax graphs. Efficient attribute re-evaluation in case of abstract syntax graph changes and a systematic integration of attribute-based analyses with further rewrite-based transformations are open research problems however. To solve these problems, a novel incremental syntax-directed compiler-compiler technique is presented, that seamlessly combines reference attribute grammars and graph rewriting. The presented technique not only permits incremental reference attribute evaluation, but also the reuse of analyses to ease the specification of, and guide, rewrite-based transformations. It enables efficient, mutually dependent, memoized analyses and transformations. The paper motivates and explains the concepts of such a reference attribute grammar controlled graph rewriting. For evaluation, a reference implementation is used to specify fUML Activity Diagram and Petri net interpreters. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/7890386
- author
- Bürger, Christoff LU
- organization
- publishing date
- 2015
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- reference attribute grammar, graph rewriting, dynamic evaluation, memoization
- host publication
- Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering
- pages
- 12 pages
- publisher
- Association for Computing Machinery (ACM)
- conference name
- 8th ACM SIGPLAN International Conference on Software Language Engineering
- conference location
- Pittsburg, United States
- conference dates
- 2015-10-26
- external identifiers
-
- scopus:84962570255
- ISBN
- 978-1-4503-3686-4
- language
- English
- LU publication?
- yes
- id
- 68e5f684-79d8-43fc-9fb3-9812283c13b7 (old id 7890386)
- alternative location
- http://dl.acm.org/citation.cfm?id=2814257
- date added to LUP
- 2016-04-04 11:22:43
- date last changed
- 2022-01-29 21:47:10
@inproceedings{68e5f684-79d8-43fc-9fb3-9812283c13b7,
abstract = {{Reference attribute grammars are a well-known language engineering technique for the implementation of semantic analyses. Reference attributes provide declarative means to extend abstract syntax trees to graphs and analyse such graphs; they are well-suited to deduce and reason about abstract syntax graphs. Efficient attribute re-evaluation in case of abstract syntax graph changes and a systematic integration of attribute-based analyses with further rewrite-based transformations are open research problems however. To solve these problems, a novel incremental syntax-directed compiler-compiler technique is presented, that seamlessly combines reference attribute grammars and graph rewriting. The presented technique not only permits incremental reference attribute evaluation, but also the reuse of analyses to ease the specification of, and guide, rewrite-based transformations. It enables efficient, mutually dependent, memoized analyses and transformations. The paper motivates and explains the concepts of such a reference attribute grammar controlled graph rewriting. For evaluation, a reference implementation is used to specify fUML Activity Diagram and Petri net interpreters.}},
author = {{Bürger, Christoff}},
booktitle = {{Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering}},
isbn = {{978-1-4503-3686-4}},
keywords = {{reference attribute grammar; graph rewriting; dynamic evaluation; memoization}},
language = {{eng}},
pages = {{89--100}},
publisher = {{Association for Computing Machinery (ACM)}},
title = {{Reference Attribute Grammar Controlled Graph Rewriting: Motivation and Overview}},
url = {{http://dl.acm.org/citation.cfm?id=2814257}},
year = {{2015}},
}