Content deleted Content added
→Flow dependency (True dependency): Author had a typo in describing a true dependency as a name dependency. In the case of flow, or true dependency, renaming the variable (name dependency) can't fix it. |
Citation bot (talk | contribs) Add: s2cid, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 3418/3850 |
||
Line 100:
=== Construction of control dependences ===
Control dependences are essentially the [[Dominator (graph theory)|dominance frontier]] in the reverse graph of the [[control-flow graph]] (CFG).<ref>{{Cite journal|title = An Efficient Method of Computing Static Single Assignment Form|publisher = ACM|journal = Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages|date = 1989-01-01|___location = New York, NY, USA|isbn = 0897912942|pages = 25–35|series = POPL '89|doi = 10.1145/75277.75280|
The following is a pseudo-code for constructing the post-dominance frontier:
| |||