| 对LBLR(K)优化的推广算法性质的一些分析 |
| |
| 引用本文： | 胡士滨.对LBLR(K)优化的推广算法性质的一些分析[J].南京理工大学学报(自然科学版),1987(1). |
| |
| 作者姓名： | 胡士滨 |
| |
| 作者单位： | 华东工学院602教研室 |
| |
| 摘 要： | 本文讨论了5]中提出的将LBLR(K)优化方法推广到信息树无限的情况时算法的性质以及应用该算法后所得结果对分析过程的影响。指出算法的复杂性是指数阶的,因此,使用该算法来实现LBLR(K)优化是不可行的。
|
| 关 键 词： | 上下文无关语法 编译程序 |
Analysis of the Property of Algorithm of Generalizing LBLR(K) Optimizing Method, |
| |
| Hu Shibin.Analysis of the Property of Algorithm of Generalizing LBLR(K) Optimizing Method,[J].Journal of Nanjing University of Science and Technology(Nature Science),1987(1). |
| |
| Authors: | Hu Shibin |
| |
| Abstract: | In this Paper,the Property of algorithm of generalizing LBLR(K)optimizing method,presented in 5],to the case when information tree is infinite,and the affection of results obtained by executing the algorithm to the passing processare discussed. It is indicated that the complexity of algorithm is of exponentialorder.Therefore, it is impractical to apply that algorithm to LBLR(k) optimization. |
| |
| Keywords: | Context free grammars Compilers |
| 本文献已被 CNKI 等数据库收录！ |
|
