Re: common sub-expression elimination

preston@tera.com (Preston Briggs)
Sun, 5 Feb 1995 19:19:51 GMT

          From comp.compilers
Related articles
common sub-expression elimination sastry@GODEL.MIEL.MOT.COM (1995-02-03)
Re: common sub-expression elimination danhicks@aol.com (1995-02-05)
Re: common sub-expression elimination preston@tera.com (1995-02-05)
| List of all articles for this month |
Newsgroups: comp.compilers
From: preston@tera.com (Preston Briggs)
Keywords: optimize, bibliography
Organization: Compilers Central
References: 95-02-048
Date: Sun, 5 Feb 1995 19:19:51 GMT

sastry@GODEL.MIEL.MOT.COM (Venkateshwara Sastry) writes:
>Consider the following code with common subexpression
>
> x=a+b+c
> y=b+c+a
>
> With triple or DAG as IR and algorithms discribed in dragon book it is not
>possible to identify the RHS of the above two expressions as a common
>subexpression.


For one approach to the problem, check our paper in last year's PLDI
proceedings


    title="Effective Partial Redundancy Elimination",
    pages="159--170",
    journal=sigplan,
    year=1994,
    month=jun,
    volume=29,
    number=6,
    note=pldi94


The bibliograhy will point you at earlier work.


Preston Briggs
--

Post a followup to this message

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