Consider the following context-free grammar $G$, where $S$, $A$, and $B$ are the variables (non-terminals), $a$ and $b$ are the terminal symbols, $S$ is the start variable, and the rules of $G$ are described as: $$S \rightarrow aaB \mid Abb$$ $$A \rightarrow a \mid aA$$ $$B \rightarrow b \mid bB$$ Which ONE of the languages $L(G)$ is accepted by $G$?

Consider the following context-free grammar G, where S, A, and B are the variables (non-terminals), a and b are the terminal symbols, S is the start variable, and the rules of G are described as: S aaB Abb A a aA B b bB Which ONE of the languages L(G) is accepted by G?

Topic-wise GATE CS PYQs with verified steps