engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Context Free Languages
Which of the following set of production is not in Chomsky normal form?
G1: S → AB A → AB| a B → BA | b
G2: S → A | B A → AB| a B → BC | b
G3: S → AB A → Ab | a B → BA | b
in the above productions S,A,B and C are non terminal variables where a, b are terminal variables.
1
G1 only
2
G1 & G2 only
3
G2 & G3 only
4
G1, G2, G3