Is there an easy way to enforce in the grammar that a lexical token must be
present a certain number of times?
For example, with TOKEN{x,y} as you might see in an extended regular
expression, it would require that TOKEN be present at minimum x times and at
most y times.
I know I can easily check during semantic analysis, but in this case I'd prefer
to do so at the grammar level.
Thanks.
--
Kaleb Pederson
Blog - http://kalebpederson.com
Twitter - http://twitter.com/kalebpederson
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
-~----------~----~----~----~------~----~------~--~---
