Conditional grammars

Conditional Adaptive Star Grammars

The precise specification of software models is a major concern in the model-driven design of object-oriented software. Models are commonly given as graph-like diagrams so that graph grammars are a natural candidate for specifying them. However, context-free graph grammars are not powerful enough to specify all static properties of a model. Even the recently proposed adaptive star grammars cann...

Conditional Probabilistic Context-Free Grammars

Simple Semi-conditional Et0l Grammars

The present contribution introduces and studies simple semi-conditional ET0L grammars (SSC-ET0L grammars for short). It is demonstrated that SSC-ET0L grammars with permitting and forbidding conditions of length no more than one and two, respectively, generate all the family of recursively enumerable languages; if erasing productions are not allowed, these grammars generate precisely the family ...

Descriptional complexity of semi-conditional grammars

The descriptional complexity of semi-conditional grammars is studied. It is proved that every recursively enumerable language is generated by a semi-conditional grammar of degree (2, 1) with no more than seven conditional productions and eight nonterminals.

On the Generative Capacity of Conditional Grammars