Priorities on context conditions in rewriting systems

doi:10.1016/0020-0255(78)90025-7

Information Sciences

Volume 14, Issue 1, 1978, Pages 15-50

https://doi.org/10.1016/0020-0255(78)90025-7 Get rights and content

Abstract

This paper is concerned with letter-rewriting systems in which context-free rewriting productions are equipped with context conditions. Such a production, π = A → α can be used to rewrite an occurrence of A in a string x only if x satisfies the context conditions attached to π. In particular, we are concerned with situations where the context conditions of several productions are satisfied by a given occurrence of A. Deciding which of these productions can be applied to rewrite this occurrence is done by (once a priori) fixed priorities among all context conditions.

References (9)

S. Greibach et al.
Scattered context grammars
J. Comput. Syst. Sci.
(1969)
O. Mayer
Some restrictive devices for context-free grammars
Inf. Control
(1972)
M. Penttonen
One-sided and two-sided context in formal grammars
Inf. Control
(1974)
J. Fris
Grammars with partial ordering of the rules
Inf. Control
(1968)

There are more references available in the full text version of this article.

Cited by (14)

Dynamically controlled cooperating/distributed grammar systems
1993, Information Sciences
Motivated by systems of artificial intelligence with distributed knowledge bases, we introduce the concept of a cooperating/distributing grammar system. In this paper, we study the effect of different conditions for starting and stopping of the components of the grammar system. If the start condition is of random context type, we obtain at most all matrix languages; if conditional or semiconditional start conditions are used, we get the family of context-sensitive languages. Time limitations have no further effect in these cases.
Adding global forbidding context to context-free grammars
1985, Theoretical Computer Science
A 1S grammar generalizes a context-free grammar in the following way: a production A → α can be applied to a string uAv (to rewrite the designed occurence of A) provided that all letters from u belong to a fixed alphabet X and all letters from v belong to a fixed alphabet Z (the alphabets X and Z are independent of the production). It is proved that a language is generated by a 1S grammar if and only if it is context-free: this solves an open problem from the theory of selective substitution grammars (Kleijn and Rozenberg, 1981/82).
Context-free like restrictions on selective rewriting
1981, Theoretical Computer Science
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.
Handbook of mathematical models for languages and computation
2020, Handbook of Mathematical Models for Languages and Computation
Lindenmayer systems with control by ideals and codes
2020, Journal of Automata, Languages and Combinatorics
Modern language models and computation: Theory with applications
2017, Modern Language Models and Computation: Theory with Applications

View all citing articles on Scopus

View full text

Priorities on context conditions in rewriting systems

Abstract

J. Comput. Syst. Sci.

Inf. Control

Inf. Control

Grammars with partial ordering of the rules

Inf. Control