Practical syntactic error recovery
Communications of the ACM
A forward move algorithm for LR error recovery
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
A project-based course in compiler construction
SIGCSE '86 Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
A practical method for LR and LL syntactic error diagnosis and recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental re-execution of programs
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
A portable syntactic error recovery scheme for LR(1) parsers
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Error handling in a parallel LR substring parser
Computer Languages
Hi-index | 0.00 |
Our goal is to develop a practical syntactic error recovery method applicable within the general framework of viable prefix parsing. Our method represents an attempt to accurately diagnose and report all syntax errors without reporting errors that are not actually present. Successful recovery depends upon accurate diagnosis of errors together with sensible “correction” or alteration of the text to put the parse back on track. The issuing of accurate and helpful diagnostics is achieved by indicating the nature of the recovery made for each error encountered. The error recovery is prior to and independent of any semantic analysis of the program. However, the method does not exclude the invocation of semantic actions while parsing or preclude the use of semantic information for error recovery. The method assumes a framework in which an LR or LL parser, driven by the tables produced by a parser generator, maintains an input symbol buffer, state or prediction stack, and parse stack. The input symbol buffer contains part or all of the sequence of remaining input tokens, including the current token. The LR state stack is analogous to the LL prediction stack; except when restricting our attention to the LL case, prediction stack shall serve as a generic term indicating the LR state or LL prediction stack. The parse stack contains the symbols of the right hand sides that have not yet been reduced.