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
10 Aug 1998
TL;DR: This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform, and is exact for left-linear and right-linear CFGs, and for trees up to a user-specified depth of center-embedding.
Abstract: This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform. The approximation is presented as a series of grammar transforms, and is exact for left-linear and right-linear CFGs, and for trees up to a user-specified depth of center-embedding.
63 citations
TL;DR: This paper gives a progression of automata and shows that it corresponds exactly to the language hierarchy defined with control grammars, the first member of which is context-free languages.
63 citations
TL;DR: Using regular tree grammars weighted over a semiring, Kleene's theorem is established in the context of formal tree power series.
63 citations
TL;DR: This paper surveys the results on conjunctive and Boolean Grammars obtained over the last decade, comparing them to the corresponding results for ordinary context-free grammars and their main subfamilies.
63 citations
TL;DR: In this paper, the authors consider XML documents described by a document type definition (DTD) and show that every XML language has a unique XML-grammar, and give two characterizations of languages generated by XMLgrammars, one is set-theoretic, the other is by a kind of saturation property.
Abstract: We consider XML documents described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properties of this family of grammars. We show that every XML-language basically has a unique XML-grammar. We give two characterizations of languages generated by XML-grammars, one is set-theoretic, the other is by a kind of saturation property. We investigate decidability problems and prove that some properties that are undecidable for general context-free languages become decidable for XML-languages. We also characterize those XML-grammars that generate regular XML-languages.
63 citations