At 20:39 25/02/2009, Thomas Woelfle wrote: >thanks for the tip. Using a syntactic predicate works. But to me
>this seems to be a bug in the algorithm that examines the minimal >amount of lookahread since it calculates a wrong minimal lookahead, >isn't it? Yes and no. Because there's a loop involved, the minimal lookahead is infinite, which is a little hard to express in static code :) ANTLR probably could be a little bit smarter and generate the synpred for you behind the scenes (which is something I was suggesting myself about a year ago), but the current architecture and its half-ANTLR-v2-ness apparently doesn't lend itself too well to that. Hopefully that'll get better before too long, especially with the upcoming CSharp3 port being self-hosted ;) List: http://www.antlr.org/mailman/listinfo/antlr-interest Unsubscribe: http://www.antlr.org/mailman/options/antlr-interest/your-email-address --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "il-antlr-interest" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/il-antlr-interest?hl=en -~----------~----~----~----~------~----~------~--~---
