| 摘要 |
A method for translating an initial program flow representation of a computer program into a modified program flow representation examines paths in the initial program flow representation, selects for replication nodes which have multiple predecessor nodes and a single successor node which have never been path search exit nodes and which are neither loop members of successors of loop members. Some of those selected nodes are then replicated and replace the nodes that were replicated. The program flow representation can then be reduced by combining nodes which have a predetermined relationship. This resulting flow representation is well suited for translation into a desired computer language. <IMAGE> |
