Regularly Controlled Bidirectional Linear Basic Grammars

We investigate the bidirectional application of grammar productions -- i.e., using the productions in the reversed direction too -- to linear basic grammars. As in the case of regularly controlled bidirectional context-free grammars (or RCB grammars), we provide bidirectional linear basic grammars with a regular control language over the rules (i.e., productions and their corresponding reductions). Our main result shows that under the so-called RS/B/f-mode of derivation, bidirectionality gives rise to a dramatic increase in generating power compared with (regularly controlled unidirectional) linear basic grammars.\ud \u

Capacity Bounded Grammars and Petri Nets

A capacity bounded grammar is a grammar whose derivations are restricted by assigning a bound to the number of every nonterminal symbol in the sentential forms. In the paper the generative power and closure properties of capacity bounded grammars and their Petri net controlled counterparts are investigated

Controlled Rewriting Using Productions and Reductions

We investigate context-free grammars the rules of which can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. We distinguish several modes of derivation for this kind of grammar. The resulting language families (properly) extend the family of context-free languages. We establish some closure properties of these language families and some grammatical transformations which yield a few normal forms for this type of grammar. Finally, we consider some special cases (viz. the context-free grammar is linear or left-linear), and generalizations, in particular, the use of arbitrary rather than regular control languages

Principles and Implementation of Deductive Parsing

We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generalizes easily to parsers for augmented phrase structure formalisms, such as definite-clause grammars and other logic grammar formalisms, and has been used for rapid prototyping of parsing algorithms for a variety of formalisms including variants of tree-adjoining grammars, categorial grammars, and lexicalized context-free grammars.Comment: 69 pages, includes full Prolog cod