Repairing syntax errors in LR parsers
Open Access
- 1 November 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 24 (6) , 698-710
Abstract
This article reports on an error-repair algorithm for LR parsers. It locally inserts, deletes or shifts symbols at the positions where errors are detected, thus modifying the right context in order to resume parsing on a valid piece of input. This method improves on others in that it does not require the user to provide additional information about the repair process, it does not require precalculation of auxiliary tables, and it can be easily integrated into existing LR parser generators. A Yacc-based implementation is presented along with some experimental results and comparisons with other well-known methods.Keywords
This publication has 15 references indexed in Scilit:
- A practical minimum distance method for syntax error handlingComputer Languages, 1994
- A simple, fast, and effective LL(1) error repair algorithmActa Informatica, 1992
- A practical method for LR and LL syntactic error diagnosis and recoveryACM Transactions on Programming Languages and Systems, 1987
- An Assessment of Locally Least-Cost Error RecoveryThe Computer Journal, 1983
- Locally Least-Cost Error Recovery in Earley's AlgorithmACM Transactions on Programming Languages and Systems, 1981
- Automatic error recovery for LR parsersCommunications of the ACM, 1978
- A statistical analysis of syntax errorsComputer Languages, 1978
- Practical syntactic error recoveryCommunications of the ACM, 1975
- LR ParsingACM Computing Surveys, 1974
- The String-to-String Correction ProblemJournal of the ACM, 1974