The definition of “grammar form” introduced in [CG] makes it possible to state and prove results about various types of grammars in a uniform way. Among questions naturally formalizable in this framework are many about the complexity or efficiency of grammars of different kinds. Grammar forms provide a reasonable way of considering the totality of other forms we might use, and so answering the question with both upper and lower bound results.
The general question considered in this paper is the following: which grammar forms are more efficient than other grammar forms for the expression of classes of languages, and how much gain in efficiency is possible? Our results deal solely with context-free grammars, and use both derivation complexity and size of grammars as complexity measures.
[1]
Noam Chomsky,et al.
On Certain Formal Properties of Grammars
,
1959,
Inf. Control..
[2]
Armin B. Cremers,et al.
Context-Free Grammar Forms
,
1974,
ICALP.
[3]
Nancy A. Lynch,et al.
Size complexity in context-free grammars forms
,
1976,
JACM.
[4]
Nancy A. Lynch,et al.
Derivation Complexity in Context-Free Grammar Forms
,
1977,
SIAM J. Comput..
[5]
Ronald V. Book.
Time-Bounded Grammars and Their Languages
,
1971,
J. Comput. Syst. Sci..
[6]
Jozef Gruska.
On the size of context-free grammars
,
1972,
Kybernetika.
[7]
A. R. Meyer,et al.
Economy of Description by Automata, Grammars, and Formal Systems
,
1971,
SWAT.