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
01 Jan 1975
26 citations
Proceedings Article•
08 Jul 2002
26 citations
Proceedings Article•
13 Jul 2008TL;DR: A time- and space-efficient incremental arc-consistency algorithm for context-free grammars that shows how to filter a sequence of monotonically tightening problems in cubic time and quadratic space.
Abstract: With the introduction of constraints based on finite automata a new line of research has opened where constraints are based on formal languages. Recently, constraints based on grammars higher up in the Chomsky hierarchy were introduced. We devise a time- and space-efficient incremental arc-consistency algorithm for context-free grammars. Particularly, we show how to filter a sequence of monotonically tightening problems in cubic time and quadratic space. Experiments on a scheduling problem show orders of magnitude improvements in time and space consumption.
26 citations
TL;DR: There exists a language L sub 0 which is generated by a linear grammar and is not T(n)-recognizable by any on-line multi-tape Turing machine if lim T( n)/(n/logn) squared (as n approaches infinity) equals zero.
Abstract: : It is shown that (1) there exists a language L sub 0 which is generated by a linear grammar and is not T(n)-recognizable by any on-line multi-tape Turing machine if lim T(n)/(n/logn) squared (as n approaches infinity) equals zero and (2) any language generated by a linear grammar is n squared-recognizable by an on-line single-tape Turing machine in the sense of Hartmanis and Stearns (Computational complexity of recursive sequences, Proc. the Fifth Annual Symp. of Switching Circuit Theory and Logical Design, p. 82-90 (1964)). (Author)
26 citations
06 Jul 1987
TL;DR: It is shown that one benefit of FUG, the ability to state global constraints on choice separately from syntactic rules, is difficult in generation systems based on augmented context free grammars (e.g., Definite Clause Grammars).
Abstract: In this paper, we show that one benefit of FUG, the ability to state global constraints on choice separately from syntactic rules, is difficult in generation systems based on augmented context free grammars (e.g., Definite Clause Grammars). They require that such constraints be expressed locally as part of syntactic rules and therefore, duplicated in the grammar. Finally, we discuss a reimplementation of FUG that achieves the similar levels of efficiency as Rubinoff's adaptation of MUMBLE, a deterministic language generator.
25 citations