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: This paper extends previous work on the recognition of imperfect strings generated by fuzzy context-free grammars to the recognition that some strings may not be recognizable when only one change is made to the grammar.
16 citations
03 Jul 2002
TL;DR: A polynomial algorithm is shown to decide whether a context-free grammars is self-embedding or not and its advantages with respect to more classical representations by finite automata are pointed out.
Abstract: We consider non-self-embedding (NSE) context-free grammars as a representation of regular sets.We point out its advantages with respect to more classical representations by finite automata, in particular when considering the efficient realization of the rational operations. We give a characterization in terms of composition of regular grammars and state relationships between NSE grammars and push-down automata. Finally we show a polynomial algorithm to decide whether a context-free grammars is self-embedding or not.
16 citations
07 Jun 2004
TL;DR: The first achievement in the field of grammatical inferencing of GDPLL(k) grammars is presented: an algorithm of automatic construction of a GDPLL (k) grammar from a so-called polynomial specification of the language.
Abstract: The recent results of the research into construction of syntactic pattern recognition-based expert systems are presented. The model of syntactic pattern recognition has been defined with the use of GDPLL(k) grammars and parsers, and the model has been successfully applied as an efficient tool for inference support in several expert systems. Nevertheless, one of the main problems of practical application of GDPLL(k) grammars consists in difficulties in defining the grammar from the sample of a pattern language. In the paper we present the first achievement in the field of grammatical inferencing of GDPLL(k) grammars: an algorithm of automatic construction of a GDPLL(k) grammar from a so-called polynomial specification of the language.
16 citations
TL;DR: Even though these grammars are not context-free, one can show that they inherit several of the nice properties of hyperedge replacement Grammars, and their membership problem is in NP.
Abstract: Contextual hyperedge-replacement grammars (contextual grammars, for short) are an extension of hyperedge replacement grammars. They have recently been proposed as a grammatical method for capturing the structure of object-oriented programs, thus serving as an alternative to the use of meta-models like uml class diagrams in model-driven software design. In this paper, we study the properties of contextual grammars. Even though these grammars are not context-free, one can show that they inherit several of the nice properties of hyperedge replacement grammars. In particular, they possess useful normal forms and their membership problem is in NP.
16 citations
16 Nov 1998
TL;DR: In this article, a concurrent semantics for DPO graph grammars has been provided by showing that each graph grammar can be unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar.
Abstract: In a recent paper, mimicking Winskel’s construction for Petri nets, a concurrent semantics for (double-pushout) DPO graph grammars has been provided by showing that each graph grammar can be unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar.
16 citations