Planning to take coaching on Unacademy
http://bit.ly/gate_unacademy
or
https://unacademy.com/
here is a code for 10% off PLUS1BPK1
Telegram Notification Group link:-
https://t.me/joinchat/X5egW_cvdt9kMGY1
Telegram discussion Group link:-
https://t.me/joinchat/VCyGUmVq8RNkMzhl
Downloads resources from here
https://education4fun.com/gate-cse/
MCQ (Single Correct Answer)
GATE CSE 2003
Let G = ({S}, {a, b} R, S) be a context free grammar where the rule set R isS → a S b | SS | εWhich of the following statements is true?(A) G is not ambiguous(B) There exist x, y, ∈ L (G) such that xy ∉ L(G)(C) There is a deterministic pushdown automaton that accepts L(G)(D) We can find a deterministic finite state automaton that accepts L(G)
