|Homegrown java parser ?!? firstname.lastname@example.org (bf.) (2002-02-06)|
|Re: Homegrown java parser ?!? email@example.com (Peter H. Froehlich) (2002-02-16)|
|Re: Homegrown java parser ?!? firstname.lastname@example.org (2002-02-16)|
|From:||"Peter H. Froehlich" <email@example.com>|
|Date:||16 Feb 2002 01:09:23 -0500|
|Posted-Date:||16 Feb 2002 01:09:23 EST|
On Wednesday, February 6, 2002, at 08:40 , bf. wrote:
> Our problem is how to proceed. How do we convert a series of tokens
> into a tree of language nodes ?
Short of guessing right all the time, you'll *have* to parse the
token stream to identify it's structure. :-) However, if you are
only concerned with Java, you might want to check out the Barat
It provides a complete Java frontend that ends up with a tree
structure similar to the one you describe.
Several people in our research group have used Barat successfully,
although I hear that there can be a somewhat steep learning curve
to understand all it's fancy internals. :-)
Peter H. Froehlich ->[!]<- http://nil.ics.uci.edu/~phf/
OpenPGP: D465 CBDD D9D2 0D77 C5AF 353E C86C 2AD9 A6E2 309E
Return to the
Search the comp.compilers archives again.