|Compiler generators that construct abstract syntax tree firstname.lastname@example.org (1993-05-12)|
|Re: Compiler generators that construct abstract syntax tree email@example.com (1993-05-15)|
|Re: Compiler generators that construct abstract syntax tree firstname.lastname@example.org (1993-05-15)|
|Re: Compiler generators that construct abstract syntax tree email@example.com (1993-05-15)|
|Re: Compiler generators that construct abstract syntax tree firstname.lastname@example.org (1993-05-17)|
|From:||email@example.com (Tony Sloane)|
|Organization:||University of Colorado at Boulder|
|Date:||Sat, 15 May 1993 02:54:25 GMT|
firstname.lastname@example.org (Wolfgang Glunz) writes:
> Are there any other compiler generators--possibly compatible with yacc--
> that have built in support for the construction of an AST ?
The Eli system will do this automatically for you (among many other things
:-). You give a concrete grammar and some pieces of the abstract grammar
(the ones that need attribution). The system will automatically generate
the missing pieces of the abstract grammar and add actions to the concrete
grammar to build the AST. Once it's built attribution starts.
Send mail to email@example.com for more information about Eli.
It's freely available. Eli uses GLA to generate lexers that are much
faster than those built by Lex, and PGS to build LALR(1) parsers.
Tony Sloane firstname.lastname@example.org
Department of Computer Science, University of Colorado at Boulder
Return to the
Search the comp.compilers archives again.