CFG-PL 変換について

概要

論文の詳細を見る
A method on the transformation from CFG to PL is presented here. In this method, a graphical approach is taken: that is, status graph, return point graph, check point graph, etc, are generated from a given grammar and used for the transformation. Knuth has given two algorithms for deciding whether or not a grammar is LR(k)for a given k. One of them also constructs the analyzer. But its parsing table is too large and unacceptable for practical use. Korenjak has, then, partially decreased the size of the parsig table by partitioning a given grammar into a number of LR(A) subgrammars. Using the method described here, we can get one of the most effcient PL type analyzers, for any LR(k)grammar, at the cost of the constructor complexity.
一般社団法人情報処理学会の論文
1971-03-15