Error repair with validation in LR-based parsing
暂无分享,去创建一个
[1] Bernard Andre Dion. Locally least-cost error correctors for context-free and context sensitive parsers , 1982 .
[2] C. H. Chang,et al. Efficient Computation of the Locally Least-Cost Insertion String for the LR Error Repair , 1986, Inf. Process. Lett..
[3] Eljas Soisalon-Soininen,et al. LR(k) and LL(k) parsing , 1990 .
[4] G. David Ripley,et al. A Statistical Analysis of Syntax Errors , 1978, Comput. Lang..
[5] E. Bertsch. An observation on suffix redundancy in LL(1) error repair , 1996, Acta Informatica.
[6] Charles N. Fischer,et al. A forward move algorithm for LL and LR parsers , 1982, SIGPLAN '82.
[7] Eljas Soisalon-Soininen,et al. Parsing Theory: Volume II Lr(k) and Ll(k) Parsing , 1990 .
[8] Bruce J. McKenzie,et al. Error repair in shift-reduce parsers , 1995, TOPL.
[9] C. H. Chang,et al. A new analysis of LALR formalisms , 1985, TOPL.
[10] Frank DeRemer,et al. Efficient computation of LALR(1) look-ahead sets , 2004, SIGP.
[11] Taisook Han,et al. An Efficient Computation of Right Context for LR-Based Error Repair , 1994, Inf. Process. Lett..
[12] Eljas Soisalon-Soininen,et al. A Syntax-Error-Handling Technique and Its Experimental Analysis , 1983, TOPL.
[13] Charles N. Fischer,et al. Efficient LL(1) error correction and recovery using only insertions , 1980, Acta Informatica.
[14] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..