@article{oai:soar-ir.repo.nii.ac.jp:00012533,
 author = {海尻,  賢二 and 打浪,  清一 and 手塚,  慶一},
 issue = {3},
 journal = {情報処理},
 month = {Mar},
 note = {We have proposed practical error correcting and recovering algorithms for the SLR(k) parsers. First we define the i-order valid pair for a LR(0)table T and a k-terminal string w. (T_0・・・T_j, βa_h・・・a_h+k-1) is the i-order valid pair for some β∈V_(T^i), we correct above configuration to β∈(T_0・・・T_j, a_h・・・a_m). If we extend β in the definition above β(V_T∪V_N)^i, then we can make error recovery in the same way. Most useful is the case i=0 or 1. In these cases the i-order valid pairs can be stored in the SLR(k) parsing table. The SLR(k) parser with thses algorithm can parse and correct an input with length n within O(n) times. We have shown by simulation that these algorithm correct 60〜80% of the program with error., Article, 情報処理. 18(3):230-236 (1977)},
 pages = {230--236},
 title = {ＳＬＲ（ｋ）パーザにおける誤り訂正，　回復について},
 volume = {18},
 year = {1977}
}