Well, I know that you can rewrite the grammar to exclude left recursion. But this is a very boring process, and sometimes it is very nontrivial to maintain proper associativity. Is there any parser capable of correctly processing grammars with left recursion?
source
share