cognitive psychology. PhD 
Compiler theory question: if I've computed a dominator table for a graph, can I easily compute the dominator table for the dual graph?
Show this thread
-
Oh, I think I’m using improper terminology here... not dual as in “reverse the arrows”, but dual as in “edges become nodes”
Oh I assumed you wanted the post dominator tree. Never thought about duals for a directed graph...
-
-
How do you even do that? Is a dual defined for all CFGs?
-
I’m not even all that sure. I’m probably attacking this problem wrong.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.