|
From: | Matt Wette |
Subject: | Re: flow-analysis and Offner's notes |
Date: | Sat, 9 Jun 2018 08:20:57 -0700 |
User-agent: | Mozilla/5.0 (X11; Linux x86_64; rv:52.0) Gecko/20100101 Thunderbird/52.8.0 |
On 06/09/2018 06:34 AM, Matt Wette wrote:
On 06/08/2018 05:17 PM, Matt Wette wrote:Andy Windo's blog on flow-analysis in Guile references Offner's "Notes on Graph Algorithms Used in Optimizing Compilers"? Anyone read this manuscript? Lemma 2.2 says, in a flow-graph, if x>>z and y>>z, then either x>>y or y>>x. The proof uses the argument that the path from s, the start, to z has to include both x and y. I'm not seeing that. Consider a graph s->x, s->y, x->z and y->z. What am I missing?
I was missing the definition of "dominates." Sorry for the interruption. Now need to think about this.
[Prev in Thread] | Current Thread | [Next in Thread] |