Consider the following context-free grammar , where and are the variables (non-terminals), and are the terminal symbols, is the start variable, and the rules of are described as:
Which ONE of the languages is accepted by ?
- A
- B
- C
- D
Theory of Computation (TOC)Context-Free Grammars & Push-Down AutomataMCQ1 mark · −1/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.