Affiliation:
1. Universidad de Sevilla, Sevilla, Spain
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.
Publisher
Association for Computing Machinery (ACM)
Reference26 articles.
1. LR Parsing
2. Aho A. and Ullman J. 1972. The Theory of Parsing Translation and Compiling. Prentice Hall Englewood Cliffs New Jersey. Aho A. and Ullman J. 1972. The Theory of Parsing Translation and Compiling. Prentice Hall Englewood Cliffs New Jersey.
3. Locally Least-Cost Error Recovery in Earley's Algorithm
4. An assessment of locally least-cost error recovery;Anderson S.;Comput. J.,1983
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. OrdinalFix: Fixing Compilation Errors via Shortest-Path CFL Reachability;2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE);2023-09-11
2. Symbolic encoding of LL(1) parsing and its applications;Formal Methods in System Design;2023-06-22
3. Seq2Parse: neurosymbolic parse error repair;Proceedings of the ACM on Programming Languages;2022-10-31
4. Neurosymbolic repair for low-code formula languages;Proceedings of the ACM on Programming Languages;2022-10-31
5. CoEdit: A novel error correction mechanism in compilers using spelling correction algorithms;Journal of King Saud University - Computer and Information Sciences;2021-03