Re: Intermediate Representation

In article <1990Aug11.203048.848@mintaka.lcs.mit.edu> jouvelot@brokaw.lcs.mit.edu (Pierre Jouvelot) writes:


>With the AST approach, the cleanest way to deal with this overabundance of
>control structures is to define a single "generic" loop construct; all the
>control structures can then be trivially desugared (e.g., by the parser)
>into your own version of loop.


I don't see the trivial desuguring by the parser, particularly with an IF -
GOTO form of the loop.


I can see discovering the entire CFG and then doing interval analysis to
discover a nice tree-like grouping of nested control structures a la Sharir
(or others), but you're still punting on irreducible flow graphs.


However, thanks for the interesting post on your design. It's fun to see
how other people approach problems.


--
Preston Briggs looking for the great leap forward
preston@titan.rice.edu
--

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