Compiler generators that construct abstract syntax tree

wogl@sun11a.zfe.siemens.de (Wolfgang Glunz)
Wed, 12 May 1993 08:03:21 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: wogl@sun11a.zfe.siemens.de (Wolfgang Glunz)
Keywords: parse, AST, question, comment
Organization: Compilers Central
Date: Wed, 12 May 1993 08:03:21 GMT

I'm currently using lex & yacc for the construction of a compiler.
I want the parser to generate an abstract syntax tree (AST) in the first
pass. The way I do this is to explicitly add C-code to the productions
of the grammer that construct the AST.


Questions:


Are there any other compiler generators--possibly compatible with yacc-- that
have built in support for the construction of an AST ?


If not, are there any public packages for creating an AST ?


Thank you


Wolfgang


--
Wolfgang Glunz email : wogl@sun11a.zfe.siemens.de
Siemens AG, ZFE BT SE 61
8000 Muenchen 83 / Germany Phone: +49 89 63649492
Otto Hahn Ring 6 Fax: +49 89 63644950
[Doesn't the Cocktail toolkit do that? -John]
--


Post a followup to this message

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