admin管理员组文章数量:1277901
I am implementing an LLVM pass for anticipated expressions using dataflow analysis and code hoisting. The reference I am following is the Purple Dragon Book (Compilers: Principles, Techniques, and Tools by Aho, Lam, Sethi, and Ullman)[Section 9.5, pg.645]. The dataflow equations are as follows:
Anticipated Expressions Dataflow Equations
Category | Definition |
---|---|
Domain | Sets of expressions |
Direction | Backwards |
Transfer Function | f_B(x) = e_use_B ∪ (x - e_kill_B) |
Boundary Condition | IN[EXIT] = ∅ |
Meet (∧) | Intersection ( ∩ ) |
Equations | IN[B] = f_B(OUT[B]) OUT[B] = ∩ { IN[S] | S ∈ succ(B) } |
Initialization | IN[B] = U |
本文标签:
版权声明:本文标题:compiler construction - `IN[BB] = ∅` for all BB instead of `IN[BB] = U , for all other BB != BB_EXIT` in Init of Anticipated Exp 内容由网友自发贡献,该文观点仅代表作者本人, 转载请联系作者并注明出处:http://www.betaflare.com/web/1741223932a2361503.html, 本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容,一经查实,本站将立刻删除。
发表评论