i am new to compiler design, currently studying Ullmans book on this.He says:Problem with predictive parsing (both recursive and non recursive) is that Left recursive productions can go infinite loop.Thus, to make grammar suitable for predictive parsing we need to eliminate the left recursion by immediately or indirectly. E -> E+T|tMy problem is, same can happen with right recursion also.What is the solution for it? T -> E+T|tPlease correct me if i am wrong! thanks.
Need solution for infinite right recursive grammar in Predictive parsing?
formal grammars;parsing;left recursion