Re: Request: references on BURS

preston@dawn.cs.rice.edu (Preston Briggs)
Thu, 29 Jul 1993 15:07:27 GMT

          From comp.compilers
Related articles
Request: references on BURS jimy@cae.wisc.edu (1993-07-28)
Re: Request: references on BURS donawa@acaps.cs.mcgill.ca (1993-07-28)
Re: Request: references on BURS preston@dawn.cs.rice.edu (1993-07-28)
Re: Request: references on BURS preston@dawn.cs.rice.edu (1993-07-29)
| List of all articles for this month |
Newsgroups: comp.compilers
From: preston@dawn.cs.rice.edu (Preston Briggs)
Keywords: optimize, tools
Organization: Rice University, Houston
References: 93-07-076 93-07-078
Date: Thu, 29 Jul 1993 15:07:27 GMT

>Burg and Iburg claim to be able to generate
>an optimal cover for given patterns. A pattern would correspond to
>an AST whose root node is a modify statement e.g.
>
>a := a +b -c *d;


Burg generates optimal cover for trees, but not for dags. Lots of
things make optimal code for trees; the advantage of BURS (and hence
burg) is speed.


Preston Briggs
--

Post a followup to this message

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