Adaptive star grammars

  • Authors:
  • Frank Drewes;Berthold Hoffmann;Dirk Janssens;Mark Minas;Niels Van Eetvelde

  • Affiliations:
  • Umeå universitet, Sweden;Universität Bremen, Germany;Universiteit Antwerpen, Belgium;Universität der Bundeswehr München, Germany;Universiteit Antwerpen, Belgium

  • Venue:
  • ICGT'06 Proceedings of the Third international conference on Graph Transformations
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.