Though facing the fear that someone might not like my question but does somebody know a useful tool to either
- resolve left recursion or to
a context-free grammar automatically ?
I need to resolve a rather long chain of left-recursion in my grammar.
So far I've tried this algorithm and this tool. But both are only applicable for smaller grammars and provide practically unusable results (1000's of rules).