Interprocedural data flow analysis in a programming environment

摘要: This thesis examines three problems arising in the construction of an ambitious optimizing compiler based a programming environment. The specific discussed are analysis aliasing patterns, computation summary data flow information, and assignment linkage styles to call sites. A two phase algorithm for alias is developed. Alias introduction analysis, performed during syntax detects aliases determines which sites can propagate aliases. propagation uses version classical iterative compute potential at each site. retains information allow efficient updating response editing changes. Two approaches computing may presented. first developed analysis. second approach divides problem into call-by-reference formal parameters global variables. parameter solved using Tarjan's fast path expression algorithm, while variable depth interative algorithm. An assigning choices site program. compares relative benefits generating open, semi-open, semi-closed, node split linkages By estimates simplifications, it efficiently produces leads improved run-time behavior under reasonable assumptions.