Consider the following context-free grammar $G$. $$S \to abaABAbba$$ $$A \to aaBBAb \mid bBabaa$$ $$B \to aBb \mid ab$$ In the above grammar, $S$ is the start symbol, $a$ and $b$ are terminal symbols, and $A$ and $B$ are non-terminal symbols. Let $L(G)$ be the language generated by the grammar $G$. For a string $s \in L(G)$, let $n_1(s)$ be the number of $a$'s in $s$ and $n_2(s)$ be the number of $b$'s in $s$. Which of the following statements is/are true?

Consider the following context-free grammar G. S abaABAbba A aaBBAb bBabaa B aBb ab In the above grammar, S is the start symbol, a and b are terminal symbols, and A and B are non-terminal symbols. Let L(G) be the language generated by the grammar G. For a string s L(G), let n1(s) be the number of a's in s and n2(s) be the number of b's in s. Which of the following statements is/are true?

Topic-wise GATE CS PYQs with verified steps