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 exemplifies with the specification and computation of the nullable, first, and follow sets used in parser construction, a problem which is highly recursive and normally programmed by hand using an iterative algorithm, and presents a general demand-driven evaluation algorithm for CRAGs.
60 citations
01 Sep 2004
TL;DR: The basic notions used in Property Grammars are described and an account of long-distance dependencies is proposed, illustrating the expressive power of the formalism.
Abstract: This paper presents the basis of Property Grammars, a fully constraint-based theory. In this approach, all kinds of linguistic information is represented by means of constraints. The constraint system constitutes then the core of the theory: it is the grammar, but it also constitutes, after evaluation for a given input, its description. Property Grammars is then a non-generative theory in the sense that no structure has to be build, only constraints are used both to represent linguistic information and to describe inputs. This paper describes the basic notions used in PG and proposes an account of long-distance dependencies, illustrating the expressive power of the formalism.
60 citations
TL;DR: An algorithm for the inference of context-free graph grammars from examples is presented, which builds on an earlier system for frequent substructure discovery, and is biased toward Grammar features that minimize description length.
Abstract: We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biased toward grammars that minimize description length. Grammar features include recursion, variables and relationships. We present an illustrative example, demonstrate the algorithm's ability to learn in the presence of noise, and show real-world examples.
59 citations
59 citations
05 May 1969
TL;DR: The operator precedence languages are shown to be a proper subset of the backwards-deterministic Wirth-Weber precedence languages which in turn are a proper subclass of the deterministic context-free languages.
Abstract: The classes of languages definable by operator precedence grammars1 and by Wirth-Weber precedence grammars2 are studied. A grammar is backwards-deterministic3 if no two productions have the same right part. Operator precedence grammars have no more generative power than backwards deterministic operator precedence grammars, but Wirth-Weber precedence grammars (i.e., grammars having unique Wirth-Weber precedence relations) are more powerful than backwards-deterministic Wirth-Weber precedence grammars; indeed they can generate any context-free language. An algorithm is developed for finding a Wirth-Weber precedence grammar equivalent to a given operator precedence grammar, a result of possible practical significance. The operator precedence languages are shown to be a proper subclass of the backwards-deterministic Wirth-Weber precedence languages which in turn are a proper subclass of the deterministic context-free languages.
58 citations