[antlr-interest] question about tree parsing (2.x)
Lloyd Dupont
lloyd at nova-mind.com
Thu Jun 2 21:40:11 PDT 2005
if I have a tree which is matched by
topNode
:
ID1
( bottomNode ID2 ) *
LAST_ID
;
bottomNode
: #(
ID3
(
ID4
| ID5
| ID6
) +
)
;
is it ok to match it against?
topNode
:
ID1
( bottomNode ID2 ) *
LAST_ID
;
bottomNode
: #(
ID3
(
ID4
| . // catch all for ID5 | ID6
) // '+' volontary removed, exit should get 1 level up, no?
)
;
I do something like that but I have the feeling (caused by error message) that ANTLR get sometime lost in the tree
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.antlr.org/pipermail/antlr-interest/attachments/20050603/c58813bd/attachment.html
More information about the antlr-interest
mailing list