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: A shape grammar formalism which accounts for most aspects of 2-D shape, a parsing mechanism which uses constraints between pieces of the shape, and an automatic method to compute constraint relations between the vocabulary symbols of theshape grammar are proposed.
11 citations
19 May 1965
TL;DR: It is shown that the assumption that language is non-finite involves the use of a constructive logic which leads to some restrictions on language theory and to the fact that the only possible definition of language is that proposed by generative grammars.
Abstract: It is shown that the assumption that language is non-finite involves the use of a constructive logic which leads to some restrictions on language theory and to the fact that the only possible definition of language is that proposed by generative grammars Generative grammars can be formulated an normal/Markov/algorithms and thus their study can be reduced to the study of such algorithms of a special type A new type of generative grammar is defined, called matrix grammar It is shown that a language generated by a context-restricted grammar can be also generated by a matrix grammar Some properties of matrix grammars are shown to be decidable The problem of the explicative power of generative grammars is discussed
11 citations
TL;DR: This paper explores the behavior of range concatenation grammars in counting, a domain in which bad reputation of other classical syntactic formalisms is well known and leads to some surprising results.
11 citations
03 Nov 2013
TL;DR: A theory of algebraic operations over linear grammars that makes it possible to combine simple "atomic" grammARS operating on single sequences into complex, multi-dimensional Grammars is developed and embedding in Haskell as a domain-specific language makes the theory directly accessible to writing and using grammar products without the detour of an external compiler.
Abstract: We develop a theory of algebraic operations over linear grammars that makes it possible to combine simple "atomic" grammars operating on single sequences into complex, multi-dimensional grammars. We demonstrate the utility of this framework by constructing the search spaces of complex alignment problems on multiple input sequences explicitly as algebraic expressions of very simple 1-dimensional grammars. The compiler accompanying our theory makes it easy to experiment with the combination of multiple grammars and different operations. Composite grammars can be written out in ${\hbox{\LaTeX}}$ for documentation and as a guide to implementation of dynamic programming algorithms. An embedding in Haskell as a domain-specific language makes the theory directly accessible to writing and using grammar products without the detour of an external compiler. http://www.bioinf.uni-leipzig.de/Software/gramprod/
11 citations
Journal Article•
TL;DR: The generative power and closure properties of the families of languages generated by such Petri net controlled grammars are investigated and it is shown that these families form an infinite hierarchy with respect to the numbers of additional places.
Abstract: A context-free grammar and its derivations can be described by a Petri net, called a context-free Petri net, whose places and transitions correspond to the nonterminals and the production rules of the grammar, respectively, and tokens are separate instances of the nonterminals in a sentential form. Therefore, the control of the derivations in a context-free grammar can be implemented by adding some features to the associated of petri net. The addition of new places and new arcs from/to these new places to/from transitions of the net leads grammars controlled by k-Petri, nets, i.e., Petri nets with additional k places. In the paper we investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars, in particular, we show that these families form an infinite hierarchy with respect to the numbers of additional places.
11 citations