can i get the complete code to find first and follow which will work for all type of grammar after removing left recursion only.
e.g.
E->E+T|T
T->T*F|F
F->(E)|x
i want to find first and follow of this production after removal of left recursion.
lyk after left recursion
E->TE'
E'->+TE'|e
so i need the first and follow of E' even
can u please help me with this....