Eliminate Left Recursion in a Context Free Grammar

208 Views Asked by At

I understood Left Recursive Grammar (LRG) and how to remove it. But i dont know how to remove recursive grammar which combine both left and right recursive:
A -> aAb | c
The full question is construct parsing table of LL(1) grammar of this:
S -> aABb A -> aAb | e (epsilon) B -> bB | c

0

There are 0 best solutions below