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 published on a yearly basis
Papers
More filters
TL;DR: The authors proves that every recursively enumerable language is generated by a scattered context grammar with no more than four nonterminals and three non-context-free productions, and gives an overview of the results and open problems concerning scattered context grammars and languages.
9 citations
TL;DR: An extensive number of examples are given which illustrate how a quite considerable number of grammars and automata considered in the literature may be ‘naturally’ interpreted as special instances (subclasses of the class) of cts systems.
9 citations
Proceedings Article•
13 Jul 1999TL;DR: The DCTG-GP system improves on other grammar-based GP systems by permitting nontrivial semantic aspects of the language to be defined with the grammar, and automatically analyzes grammar rules in order to determine their minimal depth and termination characteristics, when generating random program trees of varied shapes and sizes.
Abstract: DCTG-GP is a genetic programming system that uses definite clause translation grammars. A DCTG is a logical version of an attribute grammar that supports the definition of context-free languages, and it allows semantic information associated with a language to be easily accommodated by the grammar. This is useful in genetic programming for defining the interpreter of a target language, or incorporating both syntactic and semantic problem-specific constraints into the evolutionary search. The DCTG-GP system improves on other grammar-based GP systems by permitting nontrivial semantic aspects of the language to be defined with the grammar. It also automatically analyzes grammar rules in order to determine their minimal depth and termination characteristics, which are required when generating random program trees of varied shapes and sizes. An application using DCTG-GP is described.
9 citations
13 Oct 1975
TL;DR: It is shown that the languages generated by a constrained form of Chomsky's transformational grammars characterize the languages recognized by Turing machines in deterministic exponential (2cn) time.
Abstract: We show that the languages generated by a constrained form of Chomsky's transformational grammars characterize the languages recognized by Turing machines in deterministic exponential (2cn) time. The constraints on the transformational grammars are satisfied by many, though not all, known grammars in linguistic practice. We also give a simple algebraic characterization of the same class of languages and use it for the linguistic characterization.
9 citations
TL;DR: It is shown that each context-free matrix language is a homomorphic image of the intersection of a state language with unconditional transfer and a regular set.
Abstract: The context-free matrix grammar and the state grammar without any restriction in applying productions are considered. It turned out that these grammars are equivalent in the generative power. Another type of state grammar called the state grammar with unconditional transfer is introduced, and it is shown that each context-free matrix language is a homomorphic image of the intersection of a state language with unconditional transfer and a regular set.
9 citations