摘要
本文通过对程序流图结点序的分析,研究了流图的结构性质,证明了Earnest等人提出的一个猜想,从而解决了有关程序流图的结构问题.
Abstract The structural propeties of a program flow graph are studied through analysising its node ordering. The conjecture put forward by Earnest and other people is proved, and herefore some problem about the structure of flow graphs are solved.
出处
《黑龙江大学自然科学学报》
CAS
1990年第2期58-61,共4页
Journal of Natural Science of Heilongjiang University
关键词
程序流图结构
MICA算法
结点序
Key words MLCA-Algorithm, the structure of flow graphs, node ordcring,infin te method.
