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
••
20 Jun 1999TL;DR: The precise relationship between Probabilistic context-free grammars and shift-reduce probabilistic pushdown automata is investigated, showing that, while they define the same classes of probabilism languages, they appear to impose different inductive biases.
Abstract: Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic pushdown automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the precise relationship between these two formalisms, showing that, while they define the same classes of probabilistic languages, they appear to impose different inductive biases.
92 citations
••
TL;DR: In an attempt to provide a unified theory of grammars, a model is introduced which has two components, a ''grammar form,'' which provides the general structure of the productions in the grammar form, and an ''interpretation'', which yields a specific grammar.
91 citations
••
TL;DR: A proof for the equivalence of context-sensitive and one-sided contextsensitive languages is given, which yields as a corollary the normal form A → BC, AB → AC, A → a for context- sensitive grammars.
Abstract: A proof for the equivalence of context-sensitive and one-sided contextsensitive languages is given. This yields as a corollary the normal form A → BC, AB → AC, A → a for context-sensitive grammars.
90 citations
••
21 Jun 1989TL;DR: This work presents metalanguage enhancements for context-free grammars that allow the syntax of programming languages to be completely described in a single grammar.
Abstract: The disadvantages of traditional two-phase parsing (a scanner phase preprocessing input for a parser phase) are discussed. We present metalanguage enhancements for context-free grammars that allow the syntax of programming languages to be completely described in a single grammar. The enhancements consist of two new grammar rules, the exclusion rule, and the adjacency-restriction rule. We also present parser construction techniques for building parsers from these enhanced grammars, that eliminate the need for a scanner phase.
89 citations
••
TL;DR: It is proved that, in general, this extension of web grammar does not increase the generative power of the grammar, but it is useful, for otherwise it is not possible to incorporate negative contextual conditions into the rules, since the context of a given vertex can be unbounded.
Abstract: This paper is concerned with the class of “web grammars,≓ introduced by Pfaltz and Rosenfeld, whose languages are sets of labelled graphs. A slightly modified definition of web grammar is given, in which the rewriting rules can have an applicability condition, and it is proved that, in general, this extension does not increase the generative power of the grammar. This extension is useful, however, for otherwise it is not possible to incorporate negative contextual conditions into the rules, since the context of a given vertex can be unbounded. A number of web grammars are presented which define interesting classes of graphs, including unseparable graphs, unseparable planar graphs and planar graphs. All the grammars in this paper use “normal embeddings≓ in which the connections between the web that is written and the host web are conserved, so that any rewriting rule affects the web only locally.
87 citations