提出了一种消除抽象语法树文本中冗余的方法, 借助Knuth-Morris-Pratt (KMP) 算法, 设计核心算法, 对抽象语法树进行简化, 并选出几个经典的代码片段进行实验, 对算法的性能做了相应验证.实验结果表明, 算法在消除冗余方面的简化率达到90％以上.%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％.
展开▼
