|Rich versus Simple ASTs firstname.lastname@example.org (Johan Tibell) (2006-07-28)|
|Re: Rich versus Simple ASTs email@example.com (2006-07-29)|
|Re: Rich versus Simple ASTs firstname.lastname@example.org (Grzegorz Jakacki) (2006-07-29)|
|Re: Rich versus Simple ASTs email@example.com (Holger Siegel) (2006-07-29)|
|From:||"Grzegorz Jakacki" <firstname.lastname@example.org>|
|Date:||29 Jul 2006 14:09:04 -0400|
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
Return to the
Search the comp.compilers archives again.