Re: Compiler generators that construct abstract syntax tree

tony@cs.colorado.edu (Tony Sloane)
Sat, 15 May 1993 02:54:25 GMT

          From comp.compilers
Related articles
Compiler generators that construct abstract syntax tree wogl@sun11a.zfe.siemens.de (1993-05-12)
Re: Compiler generators that construct abstract syntax tree max@maple.ucsc.edu (1993-05-15)
Re: Compiler generators that construct abstract syntax tree tony@cs.colorado.edu (1993-05-15)
Re: Compiler generators that construct abstract syntax tree markh@csd4.csd.uwm.edu (1993-05-15)
Re: Compiler generators that construct abstract syntax tree belinfan@cs.utwente.nl (1993-05-17)
| List of all articles for this month |
Newsgroups: comp.compilers
From: tony@cs.colorado.edu (Tony Sloane)
Keywords: parse, AST
Organization: University of Colorado at Boulder
References: 93-05-055
Date: Sat, 15 May 1993 02:54:25 GMT

wogl@sun11a.zfe.siemens.de (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 compiler@cs.colorado.edu 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.


Cheers,
Tony
--
Tony Sloane tony@cs.colorado.edu
Department of Computer Science, University of Colorado at Boulder
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.