Re: Intermediate Representation

preston@titan.rice.edu (Preston Briggs)
Mon, 13 Aug 90 01:57:41 GMT

          From comp.compilers

Related articles
[9 earlier articles]
Re: Intermediate Representation larus@primost.cs.wisc.edu (1990-08-12)
Re: Intermediate Representation grover@brahmand.Eng.Sun.COM (1990-08-12)
Re: Intermediate Representation hankd@dynamo.ecn.purdue.edu (1990-08-12)
Re: Intermediate Representation jouvelot@brokaw.lcs.mit.edu (1990-08-12)
Re: Intermediate Representation convex!csmith@uunet.UU.NET (1990-08-12)
Re: Intermediate Representation preston@titan.rice.edu (1990-08-13)
Re: Intermediate Representation preston@titan.rice.edu (1990-08-13)
Re: Intermediate Representation jouvelot@brokaw.lcs.mit.edu (1990-08-13)
Re: Intermediate Representation marti@antares.inf.ethz.ch (1990-08-13)
Re: Intermediate Representation muller@procope.pa.dec.com (Eric Muller) (1990-08-14)
Re: Intermediate Representation pd@complex.Eng.Sun.COM (1990-08-15)
Re: Intermediate Representation staff@cadlab.sublink.org (1990-08-18)
Re: Intermediate Representation ok@goanna.cs.rmit.OZ.AU (1990-08-20)
[6 later articles]
| List of all articles for this month |

Newsgroups: comp.compilers
From: preston@titan.rice.edu (Preston Briggs)
Keywords: code, optimize, design
Organization: Rice University, Houston
References: <1990Aug09.180627.18848@esegue.segue.boston.ma.us> <1990Aug9.225859.10175@rice.edu> <1990Aug11.203048.848@mintaka.lcs.mit.edu>
Date: Mon, 13 Aug 90 01:57:41 GMT

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
--


Post a followup to this message

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