Complexity of normal form grammars☆

https://doi.org/10.1016/0304-3975(83)90026-9Get rights and content
Under an Elsevier user license
open archive

Abstract

Various types of grammars can be used to describe context-free languages. Such are context-free grammars and their normal form restrictions. Rewriting of a context-free grammar to an equivalent grammar in required (normal) form can cause a change of parameters of the grammar such as the number of rules, the number of nonterminals, etc. Greibach normal form grammars and position restricted grammars will be investigated from the point of view of descriptional complexity of context-free languages.

Cited by (0)

☆

Part of the results of this paper were previously reported in [11].

Copyright © 1984 Published by Elsevier B.V.