Adaptive Star Grammars and Their Languages

by Frank Drewes , Berthold Hoffmann , Dirk Janssens , Mark Minas

Citations:

1 - 1 self

Datum	Value	Source
TITLE	Adaptive Star Grammars and Their Languages	SVM HeaderParse 0.2
AUTHOR NAME	Frank Drewes	SVM HeaderParse 0.2
AUTHOR AFFIL	1	SVM HeaderParse 0.2
AUTHOR ADDR	Ume˚a universitet, Sweden	SVM HeaderParse 0.2
AUTHOR NAME	Berthold Hoffmann	SVM HeaderParse 0.2
AUTHOR AFFIL	1	SVM HeaderParse 0.2
AUTHOR ADDR	Ume˚a universitet, Sweden	SVM HeaderParse 0.2
AUTHOR NAME	Dirk Janssens	SVM HeaderParse 0.2
AUTHOR AFFIL	1	SVM HeaderParse 0.2
AUTHOR ADDR	Ume˚a universitet, Sweden	SVM HeaderParse 0.2
AUTHOR NAME	Mark Minas	SVM HeaderParse 0.2
AUTHOR AFFIL	1	SVM HeaderParse 0.2
AUTHOR ADDR	Ume˚a universitet, Sweden	SVM HeaderParse 0.2
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. 1	SVM HeaderParse 0.2
CITATIONS	6 found	ParsCit 1.0