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.

Dynamics, dependency grammar and incremental interpretation

Abstract: The paper describes two equivalent grammatical formalisms. The first is a lexicalised version of dependeney grammar, and this can be used to provide tree-structured analyses of sentences (though some-what flatter than those usually provided by phrase structure grammars). The second is a new formalism, 'Dynamic Dependency Grammar', which uses axioms and deduction rules to provide analyses of sentences in terms of transitions between states.A reformulation of dependency grammar using state transitions is of interest on several grounds. Firstly, it can be used to show that incremental interpretation is possible without requiring notions of overlapping, or flexible constituency (as in some versions of categorial grammar), and without destroying a transparent link between syntax and semantics. Secondly, the reformulation provides a level of description which can act as an intermediate stage between the original grammar and a parsing algorithm. Thirdly, it is possible to extend the reformulated grammars with further axioms and deduction rules to provide coverage of syntactic constructions such as coordination which are difficult to encode lexically.

Comparison of context-free grammars based on parsing generated test data

Abstract: There exist a number of software engineering scenarios that essentially involve equivalence or correspondence assertions for some of the context-free grammars in the scenarios. For instance, when applying grammar transformations during parser development--be it for the sake of disambiguation or grammar-class compliance--one would like to preserve the generated language. Even though equivalence is generally undecidable for context-free grammars, we have developed an automated approach that is practically useful in revealing evidence of nonequivalence of grammars and discovering correspondence mappings for grammar nonterminals. Our approach is based on systematic test data generation and parsing. We discuss two studies that show how the approach is used in comparing grammars of open source Java parsers as well as grammars from the course work for a compiler construction class.

A few remarks on the index of context-free grammars and languages

Abstract: A hierarchy of context-free grammars and languages with respect to the index of context-free grammars is established and the undecidability of the basic problems is proven.

Property grammars and table machines

Abstract: A method is given for generalizing context free grammars to include infinite terminal sets. The new grammar has many of the properties of context free grammars (e.g. membership is decidable and recognition by a suitably generalized nondeterministic pushdown device is always possible). Yet, treating each identifier as a separate terminal symbol, the grammar has enough power to describe all of the syntactic and semantic constraints of the declaration structure for variables and labels in ALGOL-60.

A language model combining trigrams and stochastic context-free grammars.

Abstract: A process for low-temperature separation of air, wherein liquefied nitrogen and liquefied air enriched with oxygen obtained from preliminary rectification are subjected to secondary rectification to produce gaseous nitrogen containing less than 0.3 vol.% of oxygen and argon impurities, gaseous oxygen-argon mixture and liquefied oxygen-argon mixture containing up to 4.5 vol.% of argon. Subsequently, the gaseous oxygen-argon mixture is subjected to further rectification to produce argon-oxygen mixture containing argon with impurities of 3-0.1 vol.% of oxygen and less than 0.1 vol.% of nitrogen, as well as oxygen with a concentration of from 99.7 to 99.99 vol.%.