engineering recuitment ISRO Scientist Computer Science Mock Test Compiler Design Grammar Left Recursive
Which one of the following grammars is free from left recursion?
1
S → AB
A → Aa | b
B → c2
S → Ab | Bb | c
A → Bd | ϵ
B → e3
S → Aa | B
A → Bb | Sc | ϵ
B → d4
S → Aa | Bb | c
A → Bd | ϵ
B → Ae | ϵ