A pumping lemma for deterministic context-free languages
References (7)
- et al.
Normal forms of deterministic grammars
Discrete Math.
(1976) Two iteration theorems for the LL(k) languages
Theoret. Comput. Sci.
(1980)Introduction to Formal Language Theory
(1978)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1989 Published by Elsevier B.V.