Advanced

Reference Attribute Grammar Controlled Graph Rewriting: Motivation and Overview

Bürger, Christoff LU (2015) 8th ACM SIGPLAN International Conference on Software Language Engineering In Proceedings of the 2015 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:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
reference attribute grammar, graph rewriting, dynamic evaluation, memoization
in
Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering
pages
12 pages
publisher
ACM
conference name
8th ACM SIGPLAN International Conference on Software Language Engineering
external identifiers
  • Scopus:84962570255
ISBN
978-1-4503-3686-4
DOI
10.1145/2814251.2814257
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
2015-09-21 14:02:46
date last changed
2016-10-13 04:45:25
@misc{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},
  isbn         = {978-1-4503-3686-4},
  keyword      = {reference attribute grammar,graph rewriting,dynamic evaluation,memoization},
  language     = {eng},
  pages        = {89--100},
  publisher    = {ARRAY(0x9bdd480)},
  series       = {Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering},
  title        = {Reference Attribute Grammar Controlled Graph Rewriting: Motivation and Overview},
  url          = {http://dx.doi.org/10.1145/2814251.2814257},
  year         = {2015},
}