GATE Computer Science (CS) 2016 Shift 2 Solved Paper

© examsiri.com

Question : 55 of 65

Marks: +1, -0

Which one of the following grammars is free from left recursion?

S → AB
A → Aa | b
B → c
S → Ab | Bb | c
A → Bd | ϵ
B → e
S → Aa | B
A → Bb | Sc | ϵ
B → d
S → Aa | Bb | c
A → Bd | ϵ
B → Ae | ϵ

Go to Question:

Prev Question

Next Question