I am studying the basics of predictive parsing and I think I have missed a concept that I would like to understand instead of just accepting and memorizing. I am watching this video and I am confused as to why
E' -> TE' | ε is valid
E -> E + T is not valid since we have "left recursion" (a variable that calls itself).
in other words, why doesn't
E' -> TE' | ε or
T' -> *FT' have left recursion? To me it looks a lot like
T' are calling themselves.