http://github.com/meric/leftry http://github.com/meric/leftry It generates recursive descent parsers, it even allows left-recursive grammars - it will rewrite

http://github.com/meric/leftry http://github.com/meric/leftry It generates recursive descent parsers, it even allows left-recursive grammars - it will rewrite the grammar on its own and wrangle it back into left-recursive form for your convenience, no need to shuffle a right-recursive AST back into left-recursive form by yourself. It's a side project so it could use a lot of improvement, especially in the debugging messages side. But it does prove left-recursive descent grammars can be generated automatically without getting into infinite loop and without hassle of manually reversing right-recursive AST's.