作者: Victor J. Marin , Carlos R. Rivero
关键词:
摘要: Originally conceived for compiler optimization, the program dependence graph has become a widely used internal representation tools in many software engineering tasks. The currently available frameworks building graphs rely on compiled source code, which requires resolving dependencies. As result, these cannot be applied analyzing legacy codebases whose dependencies automatically resolved, or large can infeasible. In this paper, we present framework generating from code based transition rules, and describe lessons learned when implementing two different versions of grammar interpreter an abstract syntax tree iterator, respectively.