Hi there!!. How you doing guys? Hope good!.
A have another question about tokens and lexical rules, i really don't
get the idea...
For example, assume we have this:
1)
tokens
{
PLUS= '+';
}
2) PLUS : '+';
and then a rule
expr: INT (PLUS INT)*;
so... if a use one of another is exactly the same. The parse tree is the
same, and the generated AST is also the same.
Can you help me, and try to explain it to me. I read the book, but i
don't understand.
Thanks for advance.
Greetins!.
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.
