摘要
Gated Single Assignment (GSA) form isused to transform an imperative program into a form suitable for dataflow interpretation. We describe a GSA-formed Control Flou, Graph (CFG) that contains gating functions and the informationa of switches. We also present an algorithm to transform an imperative progran into a GSA-formed CFG. Transfomation of an imperative program into a GSA-formaed CFG provides the basis for generating dataflow graphs(DFG). By using GSA-.formaed CFG.we can transform an imperative program i9nto a DFG more simply comparing with previous methods and show an expection of use with demand and control-driven model As we create an intermediate form which has essential information for translation it will be used to do transfermations for various kinds of dataflow models
Gated Single Assignment (GSA) form isused to transform an imperative program into a form suitable for dataflow interpretation. We describe a GSA-formed Control Flou, Graph (CFG) that contains gating functions and the informationa of switches. We also present an algorithm to transform an imperative progran into a GSA-formed CFG. Transfomation of an imperative program into a GSA-formaed CFG provides the basis for generating dataflow graphs(DFG). By using GSA-.formaed CFG.we can transform an imperative program i9nto a DFG more simply comparing with previous methods and show an expection of use with demand and control-driven model As we create an intermediate form which has essential information for translation it will be used to do transfermations for various kinds of dataflow models
