Intermediate Representation Using Graph Visualization Software
| Autor: | Adebayo Olusola Adetunmbi, E. O. Aliyu, Bolanle Adefowoke Ojokoh |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Source code
Computer science business.industry Programming language media_common.quotation_subject 05 social sciences 050301 education Best-first search 02 engineering and technology Recursive descent parser computer.software_genre Software Graph drawing 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) 020201 artificial intelligence & image processing Regular expression business Abstract syntax tree 0503 education computer media_common |
| Zdroj: | Journal of Software Engineering and Applications. 13:77-90 |
| ISSN: | 1945-3124 1945-3116 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|