面向对象程序切片中的数据流研究-计算机软件与理论专业毕业论文.docxVIP

摘要本文致力于完成面向对象程序(c++)切片工具中数据依赖图的构造，因为数据 摘要 本文致力于完成面向对象程序(c++)切片工具中数据依赖图的构造，因为数据 依赖图的构造可以归结到程序中到达一定值信息的求解，所以本文主要阐述了到达 一定值的求解算法及相关的数据流分析问题，并讨论了算法的程序实现，以及在程 序切片中的应用。 文中工作使用的到达．定值求解算法是对编译器代码优化领域中经典的到达一 定值迭代求解算法的修改，使其适用于程序切片领域。在实现程序切片工具时， 本文利用GCC编译器的前端完成对C++程序的分析，在GCC生成的抽象语法树 基础上实现程序切片。在实现到达．定值求解算法时，因为算法基于控制流图，本 文提出了一种抽象语法树到控制流图的转换算法，并将其程序实现。在生成的控 制流图的基础上，根据到达．定值的求解算法，最终完成算法的程序实现。本文中 工作基本上可以处理各种复杂数据类型存在时，程序中到达一定值信息的求解， 但在数组和指针存在时，分析的精度有待提高。 关键字：数据流分析程序切片数据依赖控制流图抽象语法树 ABSTRACTThis ABSTRACT This paper is dedicated to the construction of data dependence graph of an object-oriented program slicing t001．For the construction of data dependence graph comes down to the obtaining of reaching definitions information，an algorithm for reaching definitions and related issues about data flow analysis are discussed．And the implementation of the algorithm and its application in program slicing are also discussed， The aJgodthrn for reaching defmifions in the paper is the modification of the classical iterative algorithm in the field of compiler code optimization，SO that it Can be applied to program slicing．In the implementation of the program slicing tool，the front end of GCC is utilized to parse the C++program and program slicing is constructed based on the AST(abstract syntax tree)produced by GCC．When implementing the algorithm for reaching definitions．an algorithm to txartsfoma the AST of the analyzed program to its according CFG(control flow日aph)is represented and implemented for the reason of CFO as the base of the algodthm for reaching defirtitions．After the construction of CFQ the algofithm for reaching definitions is implemented with the information obtained from the AST of the program．This paper call generate reaching defmiffons information for program with various dal口type while the precision needs to be improved in me presence ofarray and pointer． Keyword：data flow analysis program slicing data dependence control flow graph abstract syntax tree X砖s3j3；1创新性声明 X砖s3j3；1 创新性声明 本人声明