Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
Syntax of Programming Languages: Theory and Practice
Syntax of Programming Languages: Theory and Practice
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
A forward move algorithm for LL and LR parsers
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Least-cost syntactic error repair using extended right context
Least-cost syntactic error repair using extended right context
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
Regional Least-Cost Error Repair
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
A formal frame for robust parsing
Theoretical Computer Science - Implementation and application of automata
Generalizing recognition of an individual dialect in program analysis and transformation
Proceedings of the 2007 ACM symposium on Applied computing
Robust parsing using dynamic programming
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Natural and flexible error recovery for generated parsers
SLE'09 Proceedings of the Second international conference on Software Language Engineering
LR techniques for handling syntax errors
Computer Languages
Natural and Flexible Error Recovery for Generated Modular Language Environments
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Many syntactic error repair strategies examine several additional symbols of input to guide the choice of a repair; a problem is determining how many symbols to examine. The goal of gathering all relevant information is discussed and shown to be impractical; instead we can gather all information relevant to choosing among a set of “minimal repairs.” We show that finding symbols with the property “Moderate Phrase-Level Uniqueness” is sufficient to establish that all information relevant to these minimal repairs has been seen. Empirical results on the occurrence of such symbols in Pascal are presented.