I was reading about the following grammar on page 287 of the PDF document grammar t; s : X r A B | Y r B ;
r : A | ; I don't see where the problem is since the alternatives in s begin with two different tokens X and Y. I think that since these two tokens are different I can easily construct a DFA that would unambiguously parse a stream of tokens. I sense that this example was supposed to bring out a finer point about how ANTLR generates parsers but I'm afraid that it is being lost on me. Regards, Alan 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 il-antlr-inter...@googlegroups.com. To unsubscribe from this group, send email to il-antlr-interest+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/il-antlr-interest?hl=en.
