| Reduction of Unneccessary Dotted Rules in the Earley—Algorithm |
| |
| 引用本文： | HaraldE.Otto. Reduction of Unneccessary Dotted Rules in the Earley—Algorithm[J]. 计算机科学技术学报, 1989, 4(4): 344-352. DOI: 10.1007/BF02943116 |
| |
| 作者姓名： | HaraldE.Otto |
| |
| 作者单位： | TechnicalUniversityofDarmstadt,FRG |
| |
| 摘 要： | With the high developed hardware from the PC‘s today,there arise possibilities to implement programming environments on such kind of computers.To rduces the amount of calculaiton time and required memory space from implemented algorithms.new optimization approaches in the algorithm design are demanded.The purpose of this work is to explore and analyse possibilities to reduce the required memory space through elimination of superfluonus grammar rules created during the process of recognition.
|
| 关 键 词： | 程序设计环境 算法设计 语法表示 |
Reduction of unnecessary dotted rules in the earley-algorithm |
| |
| Harald E. Otto. Reduction of unnecessary dotted rules in the earley-algorithm[J]. Journal of Computer Science and Technology, 1989, 4(4): 344-352. DOI: 10.1007/BF02943116 |
| |
| Authors: | Harald E. Otto |
| |
| Affiliation: | TechnicalUniversityofDarmstadt; FRG |
| |
| Abstract: | With the high developed hardware from the PC's today,there arise possibilities to implement programming environments on such kind of computers.To rduces the amount of calculaiton time and required memory space from implemented algorithms.new optimization approaches in the algorithm design are demanded.The purpose of this work is to explore and analyse possibilities to reduce the required memory space through elimination of superfluonus grammar rules created during the process of recognition. |
| |
| Keywords: | |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
