[antlr-interest] dfa-based lexers versus top-down antlr lexers

Matthew Ford Matthew.Ford at forward.com.au
Tue Apr 29 12:51:55 PDT 2003


I look forward to your considered revisions, Ter.
The draft spec was ment to describe the whole operation of building trees,
not just changes needed :-)
matthew
----- Original Message -----    part there of....
From: "Terence Parr" <parrt at jguru.com>
To: <antlr-interest at yahoogroups.com>
Sent: Wednesday, April 30, 2003 2:42 AM
Subject: Re: [antlr-interest] dfa-based lexers versus top-down antlr lexers


>
> On Friday, April 25, 2003, at 04:53  PM, Matthew Ford wrote:
> > I am including (again) a revised spec for handling tree generation for
> > your
> > consideration.
> >
> > So I suggest this be relaxed a little to say that
> > No tree generation code is output except that labels in the rule are
> > initialized with the
> > appropiate minimal tree.
> > For example
> >> drop_table_statement!
> >> : "drop" "table" t3:table_name t4:drop_behavior
> > ;
> > results in #t3 containing tree resulting from the rule table_name
> > and
> > statement!
> > : INT PLUS i:INT
> > ;
> > would set up a tree for label i consisting of a single root node
> > containing
> > the INT
> > token
>
> I believe it works this way now.  At least, I'm using this feature for
> my course at the moment. :)
>
>



 

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




More information about the antlr-interest mailing list