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.
Supported by SeGraVis (www.segravis.org), a European research training network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mens, T., Demeyer, S., Janssens, D.: Formalising behaviour-preserving transformation. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 286–301. Springer, Heidelberg (2002)
Habel, A. (ed.): Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992)
Drewes, F., Habel, A., Kreowski, H.-J.: Hyperedge replacement graph grammars, ch. 2. In: Rozenberg, G. (ed.) [14], pp. 95–162
Engelfriet, J., Rozenberg, G.: Node replacement graph grammars, ch. 1. In: Rozenberg [14], pp. 1–94
Schürr, A., Winter, A., Zündorf, A.: The Progres approach: Language and environment, ch. 13. In: Engels, G., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, Applications, Languages, and Tools, vol. II, pp. 487–550. World Scientific, Singapore (1999)
Niere, J., Zündorf, A.: Using fujaba for the development of production control systems. In: Münch, M., Nagl, M. (eds.) AGTIVE 1999. LNCS, vol. 1779, pp. 181–191. Springer, Heidelberg (2000)
Sendall, S.: Combining generative and graph transformation techniques for model transformation: An effective alliance? In: Proc. OOPSLA 2003 Workshop on Generative Techniques in the Context of MDA (2003), URL: www.softmetaware.com/oopsla2003/mda-workshop.html
Hoffmann, B., Janssens, D., Van Eetvelde, N.: Cloning and expanding graph transformation rules for refactoring. ENTCS 152(4) (2006); Proc. Graph and Model Transformation Workshop (GraMoT 2005)
Ehrig, H.: Introduction to the algebraic theory of graph grammars. In: Ng, E.W., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol. 73, pp. 1–69. Springer, Heidelberg (1979)
Hoffmann, B., Van Eetvelde, N.: A graph grammar for program graphs. Technical report, University of Antwerp (March 2006) UA WIS/INF 2006
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Hoffmann, B.: Graph transformation with variables. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 101–115. Springer, Heidelberg (2005)
Drewes, F., Hoffmann, B., Klein, R., Minas, M.: Rule-based programming with diaplan. ENTCS 117(1) (2005)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol. I. World Scientific, Singapore (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drewes, F., Hoffmann, B., Janssens, D., Minas, M., Van Eetvelde, N. (2006). Adaptive Star Grammars. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds) Graph Transformations. ICGT 2006. Lecture Notes in Computer Science, vol 4178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841883_7
Download citation
DOI: https://doi.org/10.1007/11841883_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38870-8
Online ISBN: 978-3-540-38872-2
eBook Packages: Computer ScienceComputer Science (R0)