Publication type: |
Article in Proceedings |
Author: |
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde |
Editor: |
Andrea Corradini, Hartmut Ehrig, Ugo Montanari,, Leila Ribeiro , Grzegorz Rozenberg |
Title: |
Adaptive Star Grammars |
Book / Collection title: |
3rd International Conference on Graph Transformation (ICGT'06) |
Volume: |
4178 |
Page(s): |
77 – 91 |
Series: |
Lecture Notes in Computer Science |
Year published: |
2006 |
Publisher: |
Springer |
Abstract: |
We propose an extension of node and hyperedge replacement grammars, called adaptive star grammars, and study their basic properties. A rule in an adaptive star grammar is actually a rule schema which, via the so-called cloning operation, yields a potentially infinite number of concrete rules. Adaptive star grammars are motivated by application areas such as modeling and refactoring object-oriented programs. We prove that cloning can be applied lazily. Unrestricted adaptive star grammars are shown to be capable of generating every type-0 string language. However, we identify a reasonably large subclass for which the membership problem is decidable. |
PDF Version: |
http://www.informatik.uni-bremen.de/~hof/papers/06-ICGT.pdf |
Status: |
Reviewed |
Last updated: |
17. 10. 2006 |
|
|