期刊名称：Journal of Software Engineering and Applications
印刷版ISSN：1945-3116
电子版ISSN：1945-3124
出版年度：2020
卷号：13
期号：5
页码：77-90
DOI：10.4236/jsea.2020.135006
出版社：Scientific Research Publishing
摘要：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
