Computer Sciences > Gate 2016 Set-2 > Grammer
Which one of the following grammars is free from left recursion?
A
S → AB
A → Aa | b
B → c
B
S → Ab | Bb | c
A → Bd | ε
B → e
C
S → Aa | B
A → Bb | Sc | ε
B → d
D
S → Aa | Bb | c
A → Bd | ε
B → Ae | ε

Correct : Grammar

PROCESSED

Similar Questions

Which of the following languages is generated by the given grammar? S → aS|bS| ε
#134 MCQ
Identity the language generated by following grammar where S is the start variable. S --> XY X --> aX | a Y --> aYb | ∈
#164 MCQ
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...
#179 MCQ

Related Topics

computer science gate 2016 grammar without left recursion GATE CS 2016 left recursive grammars computer science gate questions free from left recursion grammar construction problems GATE set 2 question 5

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: