Computer Sciences > Gate 2016 Set-2 > Grammer
Which one of the following grammars is free from left recursion?
Correct : Grammar
Similar Questions
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 | ∈
Consider the following grammar 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...
Total Unique Visitors
Loading......