|Request: references on BURS email@example.com (1993-07-28)|
|Re: Request: references on BURS firstname.lastname@example.org (1993-07-28)|
|Re: Request: references on BURS email@example.com (1993-07-28)|
|Re: Request: references on BURS firstname.lastname@example.org (1993-07-29)|
|From:||email@example.com (Preston Briggs)|
|Organization:||Rice University, Houston|
|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.
Return to the
Search the comp.compilers archives again.