Any PEG parser capable to handle left recursion? [closed]

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers. 开发者_StackOverflow中文版

---

We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.

Closed 5 years ago.

Improve this question

Well, I know it's possible to rewrite the grammar to eliminate left recursion. But this is a very boring process, and sometimes it's very nontrivial to keep correct associativity. Is there any parser capable to handle properly grammars with left recursion?