Context-free like restrictions on selective rewriting

https://doi.org/10.1016/0304-3975(81)90097-9Get rights and content
Under an Elsevier user license
open archive

Abstract

Selective substitution grammars based on ‘context-free’ productions form a possible framework for the study of ‘grammatically oriented’ formal language theory. Such grammars (with no control governing the composition of derivation steps) are studied in this paper. In particular we study the effect of various conditions on selectors (which define the way that rewriting is performed); those conditions are aimed to formalize the notion of ‘using information about the context’ during the rewriting process. Each of them captures a particular feature of a rewriting according to a context-free grammar or an EOS system (essentially a context-free grammar that can also rewrite terminal symbols). Some of those conditions yield characterizations of the class of context-free languages for other conditions the lower and upper bound on the language generating power are given. Also a natural notion of a class of ‘simple’ rewriting systems is introduced (pattern grammars) and it is demonstrated that they possess surprisingly high language generating power.

Cited by (0)

The second author gratefully acknowledges the financial support of NSF grant number MCS 79-03838. Both authors are indebted to A. Ehrenfeucht for useful discussions concerning the topic of this paper and to R. Verraedt for useful comments on the first draft of this paper.