scispace - formally typeset
Search or ask a question
Topic

Context-sensitive grammar

About: Context-sensitive grammar is a research topic. Over the lifetime, 1938 publications have been published within this topic receiving 45911 citations. The topic is also known as: CSG.


Papers
More filters
Journal ArticleDOI
TL;DR: Two new classes of generative grammars are defined and the generative power of compound and serial Grammars consisting of finite-state grammARS is investigated.
Abstract: Two new classes of generative grammars are defined. The first class, the compound grammars, consists of grammars in which the initial symbol is replaced by the language generated by another grammar. The other class, the serial grammars, consists of sequences of compound grammars. The generative power of compound and serial grammars consisting of finite-state grammars is investigated.

7 citations

30 Sep 2012
TL;DR: This paper revisits and explores an exemplar shape grammar from literature to illustrate the use of different grammar formalisms and considers the implementation of rule application within a sortal grammar interpreter.
Abstract: Grammar formalisms for design come in a large variety, requiring different representations of the entities being generated, and different interpretative mechanisms for this generation. Most examples of shape grammars rely on labeled shapes, a combination of line segments and labeled points. Color grammars extend the shape grammar formalism to allow for a variety of qualitative aspects of design, such as color, to be integrated in the rules of a shape grammar. Sortal grammars consider a compositional approach to the representational structures underlying (augmented) shape grammars, allowing for a variety of grammar formalism to be defined and explored. In this paper, we revisit and explore an exemplar shape grammar from literature to illustrate the use of different grammar formalisms and consider the implementation of rule application within a sortal grammar interpreter

7 citations

Journal ArticleDOI
TL;DR: 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.

7 citations

Journal ArticleDOI
TL;DR: This paper considers generating and accepting programmed grammars with bounded degree of non-regulation with maximum number of elements in success or in failure fields of the underlying grammar to shed new light on some longstanding open problem in the theory of computational complexity.
Abstract: We consider generating and accepting programmed grammars with bounded degree of non-regulation, that is, the maximum number of elements in success or in failure fields of the underlying grammar. In particular, it is shown that this measure can be restricted to two without loss of descriptional capacity, regardless of whether arbitrary derivations or left-most derivations are considered. Moreover, in some cases, precise characterizations of the linear bounded automaton problem in terms of programmed grammars are obtained. Thus, the results presented in this paper shed new light on some longstanding open problem in the theory of computational complexity.

7 citations

Proceedings Article
14 Jul 1980
TL;DR: In this article, the formal power of attribute-grammars (AGs) is studied and a partial characterization of the power of arbitrary AGs is given. And the results on deciding whether an AG is (left-to-right) multi-pass are given.
Abstract: The purpose of this paper is to study the formal power of certain classes of attribute-grammars (AG). We first consider the class of 1S-AG and extend a result of [DPSS]. Then we compare the formal power of "one-visit" AG with that of related types of AG. Finally, using a partial characterization of the formal power of arbitrary AG we prove some results on deciding whether an AG is (left-to-right) multi-pass.

7 citations


Network Information
Related Topics (5)
Graph (abstract data type)
69.9K papers, 1.2M citations
80% related
Time complexity
36K papers, 879.5K citations
79% related
Concurrency
13K papers, 347.1K citations
78% related
Model checking
16.9K papers, 451.6K citations
77% related
Directed graph
12.2K papers, 302.4K citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202311
202212
20211
20204
20191
20181