Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Consider a grammar G with the following production rules:
S → SS, S → λ, S → aSb, S → bSa
Which one of the following languages is generated using the above rules?
1
L = { anbn:n ≥ 1}
2
L = {w: number of a is > number of b}
3
L = { anbn:n ≥ 0}
4
L = {w: number of a and b are equal}
5
Question Not Attempted