How to remove the ambiguous and infinite left recursion?

Hi Peter,

For ambiguities, you can do look-aheads with our grammar framework via the use of CanMatch callbacks.  Our LL(*) Parser Framework documentation has coverage of that, and even shows an example or two of removing left recursion.

You also might find a lot of articles on the web about removing left recursion in EBNF since that's a common question.  I believe this Wikipedia article includes some info but any good book on parsing techniques should also have more extensive info.