freenode/#clasp - IRC Chatlog
Search
14:41:04
Bike
don't expect any huge performance improvements. but if you have ideas about what more transforms i can put in i can do that
20:37:29
pnp
Hi all. I have a doubt related to predecessors in a graph. If you consider the example here https://en.wikipedia.org/wiki/Dominator_(graph_theory) is node 5 a predecessor of node 2? I know is not related with the topic but i'm asking trying to understand the iterative construction of the dominator. If i consider only node 1 as predecessor
20:47:17
Bike
Starting at node 1, there is no way to reach node 5 without passing through node 2. So node 2 dominates node 5.
21:02:49
pnp
right... but i understand that since 5 doesn't dominates 2 is not a predecessor... If i have a region of a CFG with two nodes and a cycle between them you understand the problem applying that algorithm. The question arises from this situation
21:03:42
Bike
I don't understand. Is what I said ambiguous? From node 1 there is no way to reach node 5 without going through node 2. Do you think that's wrong?
21:04:40
Bike
That is what domination is. The fact that 5 is also a predecessor of 2 is irrelevant - if i'm not mistaken the dominator tree is the same with or without that edge.
21:06:47
pnp
what you say is not wrong but i would like to construct that tree applying the algorithm that you find there