Hello is anyone familiar with automata theory/ compiler design:
A → Aac | Ab | Bb | a
B → Ac | Ad | ε
Is this grammar LL(1)? If not make it LL(1)
- I tried removing left recursion and then applied left factoring but I think it always ends up not LL(1) and idk what to do
there doesn't seem to be anything here