GATE Computer Science (CS) 2017 Shift 1 Solved Paper

Question : 47 of 65

Marks: +1, -0

Consider the context-free grammars over the alphabet {a, b, c} given below. S and T are non-terminals.
G₁: S → aSb | T, T → cT | ∈
G₂: S → bSa | T, T → cT | ∈
The language L(G₁) ∩ L(G₂) is