Removing left recursion from CFG

Question

The following grammar left recursion:

T -> Tx | TYx | YX | x X -> xx Y -> Yy | Yx | y 

How are you going to remove left recursion. I read the Wikipedia explanation, but I'm pretty new to CFG, so it doesn't make much sense. Any help is appreciated? A simple English explanation will be even more appreciated.

Answer 1

In this example, you can follow the algorithm