Besonderhede van voorbeeld: 7622754646309012339

English

The control flow graph can then be topologically sorted; running in the order of this sort, the entry states can be computed at the start of each block, since all predecessors of that block have already been processed, so their exit states are available.

Chinese

此时可以对控制流图的基本块进行拓扑排序;按照排序后的结果依次计算,则每个块的入口状态都可以在块起始处计算,因为此时块的所有前驱节点都已经计算过了,所以它们的出口状态是可以获得的。