Error repair with validation in LR-based parsing

ACM Transactions on Programming Languages and Systems

Volumn 23, Issue 4, 2001, Pages 451-471

  Kim, Ik Soon ^a   Choe, Kwang Moo ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Algorithms; Complexity; D.3.4 programming languages ; Error recovery; Languages; Least cost; LR; Parsing; Processors Compilers; Theory; Translator writing systems, and compiler generators

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; GRAPH THEORY; SET THEORY; SYNTACTICS;

ERROR RECOVERY; PARSE STACK CONFIGURATION;

PROGRAM COMPILERS;

EID: 0038843679     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/504083.504084     Document Type: Article

References (17)

1. DION, B. A. 1980. Locally Least-Cost Error Correctors for Context-Free and Context-Sensitive Parsers. UMI Research Press.
2. DION, B. A. AND FISCHER, C. N. 1978. A least-cost error corrector for LR(1)-based parsers. Tech. Rep. 333, Univ. of Wisconsin, Madison, Sept.
3. CHOE, K. M. AND CHANG, C.-H. 1986. Efficient computation of the locally least-cost insertion string for the LR error recovery. Inf. Process. Lett. 311-316.
4. DEREMER, F. AND PENNELLO, T. 1982. Efficient computation of LALR(1) look-ahead sets. ACM Trans. Program. Lang. Syst. 4, 4 (Oct.), 615-649.
5. DREYFUS, S. E. 1969. An appraisal of some shortest path algorithms. Oper. Res. 17, 395-412.
6. BERTSCH, E. 1996. An observation on suffix redundancy in LL(1) error repair. Acta Inf. 33.
7. FISCHER, C. N., DION, B. A., AND MAUNEY, J. 1979. A Locally least-cost LR-error corrector. Tech. Rep. 363, Computer Science Dept., Univ. of Wisconsin. Aug.
8. FISCHER, C. N. AND MAUNEY, J. 1992. A simple fast, and effective LL(1) error repair algorithm Acta Inf. 29, 109-120.
9. FISCHER, C. N., MILTON, D. R., AND QUIRING, S. B. 1980. Efficient LL(1) error correction and recovery using only insertions. Acta Inf. 13, 3, 141-154.
10. DAVID RIPLEY, F. C. D. 1978. A statistical analysis of syntax errors. Comput. Lang. 3, 227-240.
11. JUNG, M.-S., CHOE, K. M., AND HAN, T. 1994. An efficient computation of right context for LR-based error repair. Inf. Process. Lett. 49, 2, 63-71.
12. MAUNEY, J. AND FISCHER, C. N. 1982. A forward move algorithm for LL and LR parsers. SIGPLAN Not. 17, 6, 77-89.
13. MCKENZIE, B. J., YEATMAN, C., AND VERE, L. D. 1995. Error repair in shift-reduce parsers. ACM Trans. Program. Lang. Syst. 17, 4, 672-689.
14. PARK, J. C. H., CHOE, K. M., AND CHANG, C. H. 1985. A new analysis of LALR formalisms ACM Trans. 7, 1, 159-175.
15. SIPPU, S. AND SOISALON-SOININEN, E. 1983. A syntax-error-handling technique and its experimental analysis. ACM Trans. Program. Lang. Syst. 5, 4 (Oct.), 656-679.
16. SIPPU, S. AND SOISALON-SOININEN, E. 1990a. Parsing Theory: Languages and Parsing. Vol. 1. Springer Verlag.
17. SIPPU, S. AND SOISALON-SOININEN, E. 1990b. Parsing Theory: LR(k) and LL(k) Parsing. Vol. 2. Springer Verlag.