Re: Rich versus Simple ASTs

"Grzegorz Jakacki" <>
29 Jul 2006 14:09:04 -0400

          From comp.compilers

Related articles
Rich versus Simple ASTs (Johan Tibell) (2006-07-28)
Re: Rich versus Simple ASTs (2006-07-29)
Re: Rich versus Simple ASTs (Grzegorz Jakacki) (2006-07-29)
Re: Rich versus Simple ASTs (Holger Siegel) (2006-07-29)
| List of all articles for this month |

From: "Grzegorz Jakacki" <>
Newsgroups: comp.compilers
Date: 29 Jul 2006 14:09:04 -0400
References: 06-07-091
Keywords: parse, AST
Posted-Date: 29 Jul 2006 14:09:04 EDT

Johan Tibell wrote:
> Considered a grammar for lambda calculus
> Should the richness of the
> language you are compiling be represented in the AST or should the AST
> be simplified as much as possible?

Depends what you want to do with your AST. I don't think there is "the
best" form of AST, for every application you have to design AST that
suits best. What is your application?

> P.S. The second representation could also be useful for pretty printing

and refactoring.


Post a followup to this message

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