Removing left recursion
Posted
by equilibrium
on Stack Overflow
See other posts from Stack Overflow
or by equilibrium
Published on 2010-04-16T10:06:26Z
Indexed on
2010/04/16
10:23 UTC
Read the original article
Hit count: 367
The following grammar has left recursion
E= E+T|T
T= T*F|F
F= a|b|c
How to remove it? Is there any general procedure for it?
© Stack Overflow or respective owner