[antlr-interest] Storing ambiguity in the tree

[Alexey Demakov]

From: "Maassen, H.A.M." <H.A.M.Maassen at student.tue.nl>
> > From: Alexey Demakov [mailto:demakov at ispras.ru] 
> >
> > How many possible variants can exist? May be better to store list of tokens (instead of one or more subtrees)
> > and parse them when additional info is available?
> 
> How would I go about doing this?

My idea is to build some "flat" tree for ambiguous portions of input, 
i.e. all input tokens should be children of one root node.
So at the second pass we can run parser on list of children and build subtree.
It's only idea, I can't get you more details on implementation now.

Regards,
Alexey

-----
Alexey Demakov
TreeDL: Tree Description Language: http://treedl.sourceforge.net
RedVerst Group: http://www.unitesk.com




 
Yahoo! Groups Links

<*> To visit your group on the web, go to:
    http://groups.yahoo.com/group/antlr-interest/

<*> To unsubscribe from this group, send an email to:
    antlr-interest-unsubscribe at yahoogroups.com

<*> Your use of Yahoo! Groups is subject to:
    http://docs.yahoo.com/info/terms/