Which one of the following grammars is free from left recursion?
PYQ GATE 2016
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 | ε
Attempted by 550 students.
Sign up free to check your answer
Sign up freeLoading lesson…

