Consider the context-free grammars over the alphabet given below. and are non-terminals.
The language is
- AFinite
- BNot finite but regular
- CContext-Free but not regular
- DRecursive but not context-free
Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMCQ2 marks · −2/3 if wrongMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.