| 一个有效的LR(K)分析机的分级构造算法及其文法的分划 |
| |
| 引用本文： | 胡士滨.一个有效的LR(K)分析机的分级构造算法及其文法的分划[J].南京理工大学学报(自然科学版),1985(Z1). |
| |
| 作者姓名： | 胡士滨 |
| |
| 摘 要： | 本文提出了一个上下文无关文法的LR(k)分析机的分级构造算法及其文法的分划方法。并对K=1的情况进行了详细的讨论。该方法不仅适用于任何实际LR(K)文法并且较之5]中方法更加有效。文中对算法的正确性进行了证明,同时指出由本文建立的强相容性标准是所有合并同心状态的相容性标准中最宽的一个。根据获得的结果。用本文中算法构造的LR(K)分析机中的状态个数与LALR(K)分析机中的状态个数相同或略多。
|
| 关 键 词： | 上下文无关语法 |
An Efficient Hierarchical Method for Constructing LR(K) Parsers and the Partitioning of Grammars |
| |
| Hu Shibin.An Efficient Hierarchical Method for Constructing LR(K) Parsers and the Partitioning of Grammars[J].Journal of Nanjing University of Science and Technology(Nature Science),1985(Z1). |
| |
| Authors: | Hu Shibin |
| |
| Abstract: | An efficient hierarchical method for constructing LR (K)parsers for context-free grammars and partitioning of grammars is presented. It isdiscussed in detail for the case K=1. The method can be used for any practical LR (K) grammar and is more efficrent than that of pagers. The proof for the correctness of algori-thm is included. Meanwhile, it is also shown that the conditionsof strong com-patibility given in this paper is the weakest one among the all formerging two s-tates nith the same core while constructing. The result parsers obtained are similar in size to the LALR (K)parsers. |
| |
| Keywords: | Context free grammars |
| 本文献已被 CNKI 等数据库收录！ |
