GATE 2017 CS Q37: Analyzing Context-Free Grammars over {a, b, c} 📝

GATE 2017 CS Question Paper Complete Solution

Q 37. Consider the context-free grammars over the alphabet {a,b,c} given below. S and T are non terminals
G1 : S → aSb|T, T → cT|∈

G2 : S → bSa|T, T → cT|∈
The language L(G1) ∩ L(G2) is

(a) Finite.
(b) Not finite but regular.
(c) Context-free but not regular.
(d) Recursive but not context-free.

Gate Helpline helps you in gate notifications, PSU, previous year papers, gate admit card, gate cutoff marks, gate results, scorecard, gate helpline number etc Gate Helpline provides a unique feature of Question Answer Discussion.

Gate Helpline Youtube Channel: http://www.youtube.com/c/Gatehelpline

Gate Helpline: http://gatehelpline.com/

Gate Helpline Fb: https://www.facebook.com/gatehelplinedotcom
Gate Helpline Twitter: https://twitter.com/gatehelpline
Gate Helpline Google+: https://plus.google.com/+Gatehelpline
Gate Helpline Study Group: https://www.facebook.com/groups/GateHelplineStudyGroup/