Rapid Retrieval:      
引用本文:
【打印本页】   【下载PDF全文】   View/Add Comment  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 1259次   下载 976 本文二维码信息
码上扫一扫!
分享到: 微信 更多
简化GNU编译器套件抽象语法树的算法研究
高峰, 吴海涛
上海师范大学 信息与机电工程学院, 上海 200234
摘要:
提出了一种消除抽象语法树文本中冗余的方法,借助Knuth-Morris-Pratt (KMP)算法,设计核心算法,对抽象语法树进行简化,并选出几个经典的代码片段进行实验,对算法的性能做了相应验证.实验结果表明,算法在消除冗余方面的简化率达到90%以上.
关键词:  抽象语法树  GNU编译器套件(GCC)  Knuth-Morris-Pratt (KMP)算法  重复代码
DOI:10.3969/J.ISSN.1000-5137.2018.04.014
分类号:TP311
基金项目:
Research on the method of simplifying GNU compiler collection abstract syntax tree
Gao Feng, Wu Haitao
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%.
Key words:  abstract syntax tree  GNU compiler collection (GCC)  Knuth-Morris-Pratt (KMP) algorithm  duplicated code