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.

Alternating semantic evaluator

Abstract: In order to make the use of attribute grammars practical in (automatic) compiler generation, restricted attribute grammars are introduced. A membership test is given which determines whether a given attribute grammar satisfies the required restrictions. The major advantage of the restricted attribute grammars is that they are non-circular. The given membership test can be embedded in a compiler writing system which accepts an attribute grammar as input and outputs a compiler for the associated language provided the grammar meets the restrictions. The technique is also applicable to translation grammars of [15]. It is assumed that the reader is familiar with context free grammars but not necessarily with attribute grammars.

On equal matrix languages

Abstract: A generative grammar called equal matrix grammar which generates a class which meets both context-sensitive and context-free languages is defined and the formal power series generated by context-free grammars is extended to grammars of this system. The Parikh mapping of this family of languages is shown to be semilinear. The Boolean and closure properties of a certain subfamily are examined. For this subfamily, the generative power of equal matrix grammar is higher than that of context-free grammars. For certain inherently ambiguous context-free languages, including that of Parikh, unambiguous grammars of this class exist. The application of equal matrix grammar to the generation of Tamil kernel sentences is given in the appendix.

Context-free grammars on trees

Abstract: In this paper we discuss still another version of indexed grammars 1 and macro grammars3,gaining some geometric intuition about the structure of these systems. An ordinary context-free grammar is a rewriting system for strings; we find that a macro grammar is a rewriting system for trees. CF grammars on strings form a special case since strings can be thought of as trees without branching nodes. We consider the special case of finite-state grammars in this report. We define the tree analogue of a non deterministic generalized sequential machine and obtain results about the domain and range of such a mapping. We relate these results to the theory of generalized finite automata6.

Natural Language Understanding.

Abstract: : Contents: Natural Language Processing Overview; Mechanical Translation, Grammars--Formal Grammars; Transformational Grammars; Systemic Grammar; Case Grammar; Parsing--Overview of Parsing Techniques; Augmented Transition Nets; The General Syntactic Processor; Text Generation; Natural Language Processing Systems--Early Natural Language Systems; Wilk's Mechanical Translation System; LUNAR, SHRDLU, MARGIE, SAM and PAM, LIFER.