3 votes 3 votes Which of the given strings is/are NOT generated by the below context-free grammar? $S$ is the start symbol and the set of non-terminal symbols is $\{a,b\}.$ The production rules are: $S \rightarrow bS \mid aAaS \mid \varepsilon$ $A \rightarrow bA \mid \varepsilon$ $abababbbb$ $aaaaaaaaa$ $bbbbabbbb$ $aaaabaaaa$ Theory of Computation go2025-mockgate-1 context-free-grammar multiple-selects theory-of-computation + – gatecse asked Jan 3, 2021 • edited Jan 4, 2021 by Lakshman Bhaiya gatecse 219 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Given grammar generates all strings over $\{a,b\}$ having an even number of $a's.$ So, only string in option D is generated by the given grammar. Correct option: A;B;C. gatecse answered Jan 3, 2021 gatecse comment Share Follow See all 0 reply Please log in or register to add a comment.
