Intermediate Representation Using Graph Visualization Software  

作　　者：E. O. Aliyu[1] A. O. Adetunmbi[1] B. A. Ojokoh[1] 

出　　处：《Journal of Software Engineering and Applications》2020年第5期77-90,共14页软件工程与应用（英文）

摘　　要：In this paper, a method to initiate, develop and visualize an abstract syntax tree (AST) in C++ source code is presented. The approach is in chronological order starting with collection of program codes as a string and split into individual characters using regular expression. This will be followed by separating the token grammar using best first search (BFS) algorithm to determine node having lowest value, lastly followed by graph presentation of intermediate representation achieved with the help of graph visualization software (GraphViz) while former is implemented using python programming language version 3. The efficacy of our approach is used in analyzing C++ code and yielded a satisfactory result.In this paper, a method to initiate, develop and visualize an abstract syntax tree (AST) in C++ source code is presented. The approach is in chronological order starting with collection of program codes as a string and split into individual characters using regular expression. This will be followed by separating the token grammar using best first search (BFS) algorithm to determine node having lowest value, lastly followed by graph presentation of intermediate representation achieved with the help of graph visualization software (GraphViz) while former is implemented using python programming language version 3. The efficacy of our approach is used in analyzing C++ code and yielded a satisfactory result.

关 键 词：Recursive DESCENT PARSER Best First Search INTERMEDIATE REPRESENTATION Abstract SYNTAX Tree Graph Visualization SOFTWARE 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]