%0 Journal Article %1 DHJM10 %A Drewes, Frank %A Hoffmann, Berthold %A Janssens, Dirk %A Minas, Mark %D 2010 %J Theoretical Computer Science %K 2010 Article DiaPlan GraGra myown %N 34-36 %P 3090 - 3109 %T Adaptive Star Grammars and Their Languages %U http://www2.cs.unibw.de/publ/minas/DHJM10.pdf %V 411 %X Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties are studied. In adaptive star grammars, rules are actually schemata which, via the cloning of so-called multiple nodes, may adapt to potentially infinitely many contexts when they are applied. This mechanism makes adaptive star grammars more powerful than context-free graph grammars. Nevertheless, they turn out to be restricted enough to share some of the basic characteristics of context-free devices. In particular, the underlying substitution operator enjoys associativity and confluence properties quite similar to those of context-free graph grammars, and the membership problem for adaptive star grammars is decidable.

@article{DHJM10, abstract = {Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties are studied. In adaptive star grammars, rules are actually schemata which, via the cloning of so-called multiple nodes, may adapt to potentially infinitely many contexts when they are applied. This mechanism makes adaptive star grammars more powerful than context-free graph grammars. Nevertheless, they turn out to be restricted enough to share some of the basic characteristics of context-free devices. In particular, the underlying substitution operator enjoys associativity and confluence properties quite similar to those of context-free graph grammars, and the membership problem for adaptive star grammars is decidable. }, added-at = {2010-02-13T14:42:29.000+0100}, author = {Drewes, Frank and Hoffmann, Berthold and Janssens, Dirk and Minas, Mark}, bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAaQAAAAAAaQAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAMarmBZIKwAAACx0mQpESEpNMTAucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALHozx5xWTyBGRFBPUkFDAAIABQAACSAAAAAAAAAAAAAAAAAAAAAEMjAxMAAQAAgAAMare/YAAAARAAgAAMecSD8AAAABABwALHSZAAtrpQALJIwACx2vAAhMrgAH+XEAAJDnAAIARU1hY2ludG9zaCBIRDpVc2VyczptaW5hczpFaWdlbmUgRGF0ZWllbjpUZXh0OlBhcGVyOlBTOjIwMTA6REhKTTEwLnBkZgAADgAWAAoARABIAEoATQAxADAALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASADhVc2Vycy9taW5hcy9FaWdlbmUgRGF0ZWllbi9UZXh0L1BhcGVyL1BTLzIwMTAvREhKTTEwLnBkZgATAAEvAAAVAAIADP//AACABdIcHR4fWCRjbGFzc2VzWiRjbGFzc25hbWWjHyAhXU5TTXV0YWJsZURhdGFWTlNEYXRhWE5TT2JqZWN0XxAjLi4vLi4vVGV4dC9QYXBlci9QUy8yMDEwL0RISk0xMC5wZGbSHB0kJaIlIVxOU0RpY3Rpb25hcnkSAAGGoF8QD05TS2V5ZWRBcmNoaXZlcgAIABEAFgAfACgAMgA1ADoAPABFAEsAUgBdAGUAbABvAHEAcwB2AHgAegB8AIYAkwCYAKACSAJKAk8CWAJjAmcCdQJ8AoUCqwKwArMCwALFAAAAAAAAAgEAAAAAAAAAKAAAAAAAAAAAAAAAAAAAAtc=}, biburl = {https://www.bibsonomy.org/bibtex/22a56feb5a82a3374c06b04d8517dcf9b/minas}, date-added = {2010-02-13 12:54:34 +0100}, date-modified = {2010-02-13 14:31:55 +0100}, interhash = {d97b1dd724a841f58043cfa304f34a87}, intrahash = {2a56feb5a82a3374c06b04d8517dcf9b}, journal = {Theoretical Computer Science}, keywords = {2010 Article DiaPlan GraGra myown}, number = {34-36}, pages = {3090 - 3109}, timestamp = {2011-08-06T16:56:07.000+0200}, title = {Adaptive Star Grammars and Their Languages}, url = {http://www2.cs.unibw.de/publ/minas/DHJM10.pdf}, volume = 411, year = 2010 }