# Grammar Schemata

@article{Gabrielian1974GrammarS, title={Grammar Schemata}, author={A. Gabrielian and S. Ginsburg}, journal={J. ACM}, year={1974}, volume={21}, pages={213-226} }

A solution is presented for the following problem: Determine a procedure that produces, for each full trio L of context-free languages (more generally, each trio of r.e. languages), a family of context-free (phrase structure) grammars which (a) defines L, (b) is simple enough for practical and theoretical purposes, and (c) in most cases is a subfamily of a well-known family of context-free (phrase structure) grammars for L if such a well-known family exists. (A full trio (trio) is defined to be…

## Topics from this paper

## 9 Citations

Context-Free Grammar Forms

- Physics, Computer ScienceICALP
- 1974

In [3] an attempt was made to formalize a notion of “family of grammars” which would yield, as special instances, many of the well-known families of phrase structure grammars. The model presented…

Context-Free Grammar Forms

- Computer ScienceJ. Comput. Syst. Sci.
- 1975

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.

Families Generated by Grammars and L Systems

- Computer ScienceHandbook of Formal Languages
- 1997

This chapter considers the family\( \mathcal{L} \)(G) of languages L(G’) generated by the interpretations G’ of G, referred to as the grammatical family associated to G.

Abstract Families of Context-Free Grammars

- Mathematics
- 1981

An abstract family of grammars (AFG) may be defined as a class of grammars for which the corresponding class of languages forms an abstract family of languages (AFL) as defined by Ginsburg and…

METHODS FOR SPECIFYING FAMILIES OF FORMAL LANGUAGES — PAST-PRESENT-FUTURE

- Computer Science
- 1980

The chapter discusses the different ways to describe the families of languages that are of interest to computer scientists, and the Intersection theorem is an indication towards determining appropriate families of language to study.

Two-level representations for natural language

- Computer Science
- 1986

Two‐level grammars have a generative capacity that is equivalent to that of a transformational grammar and the need for improved models of language from the standpoint both of performance as well as computational adequacy is emphasized.

Control Sets of Context-Free Grammar Forms

- Computer Science, MathematicsJ. Comput. Syst. Sci.
- 1977

For a context-free grammar form G , the result of the G -control operator acting on a family of languages ℒ is defined as the family of languages formed by using members of ℒ to control left-to-right…

Abstract Grammars Based on Transductions

- Computer Science, MathematicsTheor. Comput. Sci.
- 1991

An abstract grammatical model in which the effect (or application) of a production plays the main part rather than the notion of production itself, and elementary, decidability, and complexity properties of the corresponding family of languages generated by languages controlled by $\cal T$-grammars are established.

## References

SHOWING 1-10 OF 12 REFERENCES

The Algebraic Theory of Context-Free Languages*

- Computer Science
- 1963

Publisher Summary This chapter discusses the several classes of sentence-generating devices that are closely related, in various ways, to the grammars of both natural languages and artificial…

Finite-Turn Pushdown Automata

- Mathematics
- 1966

Abstract : A finite-turn pda is a pda in which the length of the pushdown tape alternatively increases and decreases at most a fixed bounded number of times during any sweep of the automation. This…

Abstract Families of Languages

- Computer ScienceSWAT
- 1967

The notion of an abstract family of languages (AFL) as a family of sets of words satisfying certain properties common to many types of formal languages is introduced. Operations preserving AFL are…

An iteration theorem for one-counter languages.

- Computer ScienceSTOC
- 1971

It is shown that the smallest full AFL containing this family is principal with full generator D'@@@@ @@@@, the semi-Dyck language on two letters, and an iteration theorem for one-counter languages that yields several corollaries is given.

RECEIVED NOVEMBER

- RECEIVED NOVEMBER
- 1972

J. Comput. and Syst. Sci. ~

- J. Comput. and Syst. Sci. ~
- 1970

Transductions des Languages de Chomsky

- Transductions des Languages de Chomsky
- 1967

Finite-turn pushdown

- Finite-turn pushdown
- 1966