摘要
提出一种基于GCC(GNU Compiler Collection)抽象语法树文本建立控制依赖子图的方法,消除抽象语法树文本中与分析控制流无关的信息,将消除冗余后的抽象语法树文本转化为以邻接表为存储结构的抽象语法树的算法,从而高效地完成了抽象语法树的解析。基于以邻接表为存储结构的抽象语法树建立了控制依赖子图。通过实验证明了该方法的正确性和适用性。
A method of building control dependence sub-graph is put forward based on Abstract Syntax Tree（AST） text produced by GNU Compiler Collection（GCC）. The information which has nothing to do with control flow analysis is eliminated. An algorithm of transforming canonical AST text to AST is put forward. As a result, the AST analysis is more efficiently completed. Control dependence sub-graph is built based on canonical AST. The correctness and practicality of this method is proved by experiments.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第15期50-52,共3页
Computer Engineering
