Computer Sciences > Gate 2017 Set-1 > Grammer
Consider the following grammar over the alphabet {a,b,c} given below, S and T are non-terminals.
The language L1(G1) ∩ L2(G2).
G1: S-->aSb|T
T--> cT|∈
G2: S-->bSa|T
T--> cT|∈
T--> cT|∈
G2: S-->bSa|T
T--> cT|∈
The language L1(G1) ∩ L2(G2).
Correct : b
Similar Questions
Which one of the following grammars is free from left recursion?
Which of the following languages is generated by the given grammar?
S → aS|bS| ε
Identity the language generated by following grammar where S is the start variable.
S --> XY
X --> aX | a
Y --> aYb | ∈
Total Unique Visitors
Loading......