How do you deal with left recursion of for instance expressions such as
a-b-c
this shows how to eliminate left recursion
http://courses.essex.ac.uk/lg/LG511/.../index_11.html
by making it right recursive. but then a-(b-c) would be a misinterpretation. same would (a^b)^c be of a^b^c
I can't even write a simple math expression parser :(
T->T
T->T + F
T->T - F
F->P
F->F * P
F->F / P
P->I
P->I ^ P
I->( T )
I->i
