| 简化GNU编译器套件抽象语法树的算法研究 |
| |
| 引用本文： | 高峰,吴海涛.简化GNU编译器套件抽象语法树的算法研究[J].上海师范大学学报(自然科学版),2018,47(4):479-482. |
| |
| 作者姓名： | 高峰 吴海涛 |
| |
| 作者单位： | 上海师范大学信息与机电工程学院 |
| |
| 摘 要： | 提出了一种消除抽象语法树文本中冗余的方法,借助Knuth-Morris-Pratt(KMP)算法,设计核心算法,对抽象语法树进行简化,并选出几个经典的代码片段进行实验,对算法的性能做了相应验证.实验结果表明,算法在消除冗余方面的简化率达到90%以上.
|
| 关 键 词： | 抽象语法树 GNU编译器套件(GCC) Knuth-Morris-Pratt (KMP)算法 重复代码 |
| 收稿时间： | 2016/10/19 0:00:00 |
Research on the method of simplifying GNU compiler collection abstract syntax tree |
| |
| Gao Feng and Wu Haitao.Research on the method of simplifying GNU compiler collection abstract syntax tree[J].Journal of Shanghai Normal University(Natural Sciences),2018,47(4):479-482. |
| |
| Authors: | Gao Feng and Wu Haitao |
| |
| Institution: | The College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China and The College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China |
| |
| Abstract: | We propose a method to eliminate the redundancy in the text of abstract syntax tree.By using the Knuth-Morris-Pratt (KMP) algorithm,we design the core algorithm,simplify the abstract syntax tree,and select several classic code fragments to be tested.The experimental results show that the reduction rate of the algorithm is more than 90%. |
| |
| Keywords: | abstract syntax tree GNU compiler collection (GCC) Knuth-Morris-Pratt (KMP) algorithm duplicated code |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《上海师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《上海师范大学学报(自然科学版)》下载免费的PDF全文 |
