CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Generalising tree traversals and tree transformations to DAGs: Exploiting sharing without the pain

Patrick Bahr ; Emil Axelsson (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
Science of Computer Programming (0167-6423). Vol. 137 (2016), p. 63-97.
[Artikel, refereegranskad vetenskaplig]

We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal or a tree transformation and then apply it to compact graph representations of trees instead. The resulting graph traversal or graph transformation avoids recomputation of intermediate results for shared nodes – even if intermediate results are used in different contexts. Consequently, this approach leads to asymptotic speedup proportional to the compression provided by the graph representation. In general, however, this sharing of intermediate results is not sound. Therefore, we complement our implementation of the recursion scheme with a number of correspondence theorems that ensure soundness for various classes of traversals. We illustrate the practical applicability of the implementation as well as the complementing theory with a number of examples.

Nyckelord: Attribute grammars; Sharing; Graph traversal; Graph transformation; Directed acyclic graphs

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2016-08-29. Senast ändrad 2017-05-08.
CPL Pubid: 240912


Läs direkt!

Länk till annan sajt (kan kräva inloggning)