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
26 Mar 2011
TL;DR: This work demonstrates and proves the correctness of an algorithm for parsing reflective grammars, which can modify their own syntax during parsing, and proves that it performs asymptotically no worse than Earley's algorithm on ordinary context-free Grammars.
Abstract: Existing technology can parse arbitrary context-free grammars, but only a single, static grammar per input. In order to support more powerful syntax-extension systems, we propose reflective grammars, which can modify their own syntax during parsing. We demonstrate and prove the correctness of an algorithm for parsing reflective grammars. The algorithm is based on Earley's algorithm, and we prove that it performs asymptotically no worse than Earley's algorithm on ordinary context-free grammars.
7 citations
TL;DR: In the context independent L systems with varlsus generalizations of context free grammars, the class of ETOL systems (see [S ] ) fGgnls is perhaps the central cl;dss among various classes of context indepenGent L systems.
7 citations
TL;DR: The main aim of this paper is to provide an approach to the parallel composition of graph grammars, formalizing the intuitive idea of ‘divide and conquer’ described above.
Abstract: The specification of complex systems is usually done by the ‘divide and conquer’ idea: the system is divided into smaller, less complex components that are developed separately and then merged in some way to form the specification of the whole system. The main aim of this paper is to provide an approach to the parallel composition of graph grammars, formalizing the intuitive idea of ‘divide and conquer’ described above. This parallel composition of graph grammars provides a suitable formalism for the specification of concurrent systems based on the specifications of their components. ‘Dividing’ is formalized by special graph grammar morphisms, called specialization morphisms. These morphisms also describe structural and behavioural compatibilities between graph grammars. As a main result, we characterize the parallel composition as the pullback in the category of graph grammars.
7 citations
05 Jun 2009
TL;DR: This work defines a grammar formalism with these characteristics and shows how it can be implemented in logic programming in a surprisingly straightforward way, compared with the expressive power of traditional approaches.
Abstract: We consider, as an alternative to traditional approaches for describing non-context-free languages, the use of grammars in which application of grammar rules themselves control the creation or modification of grammar rules. This principle is shown to capture, in a concise way, standard example languages that are considered as prototype representatives of non-context-free phenomena in natural languages. We define a grammar formalism with these characteristics and show how it can be implemented in logic programming in a surprisingly straightforward way, compared with the expressive power. It is also shown how such adaptable grammars can be applied for describing meta-level architectures that include their own explicit meta-languages for defining new syntax.
7 citations