A survey of syntactic error recovery and repair
Computer Languages
Noncorrecting syntax error recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Practical syntactic error recovery
Communications of the ACM
An efficient context-free parsing algorithm
Communications of the ACM
Bounded context syntactic analysis
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
Generation and recognition of formal languages by modifiable grammars
ACM SIGPLAN Notices
Substring parsing for arbitrary context-free grammars
ACM SIGPLAN Notices
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
Recognizing substrings of LR(k) languages in linear time
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Recognizing substrings of LR(k) languages in linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear-time suffix parsing for deterministic languages
Journal of the ACM (JACM)
On parsing and condensing substrings of LR languages in linear time
Theoretical Computer Science
Smarter cut-and-paste for programming text editors
AUIC '01 Proceedings of the 2nd Australasian conference on User interface
On Parsing and Condensing Substrings of LR Languages in Linear Time
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Error handling in a parallel LR substring parser
Computer Languages
| Hi-index | 0.00 |
For a context-free grammar G, a construction is given to produce an LR parser that recognizes any substring of the language generated by G. The construction yields a conflict-free (deterministic) parser for the bounded context class of grammars (Floyd, 1964). The same construction yields either a left-to-right or right-to-left substring parser, as required to implement Non-correcting Syntax Error Recovery as proposed by Richter (1985). Experience in constructing a substring parser for Pascal is described.