Noncorrecting syntax error recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
An LR substring parser for noncorrecting syntax error recovery
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Recognizing substrings of LR(k) languages in linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
An LR substring parser applied in a parallel environment
Journal of Parallel and Distributed Computing
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
String analysis as an abstract interpretation
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Parallel parsing of operator precedence grammars
Information Processing Letters
| Hi-index | 5.23 |
LR parsers have longbeen known as being an efficient algorithm for recognizing deterministic context-free grammars. In this article, we present a linear-time method for parsing substrings of LR languages. The algorithm depends on the LR automaton which is used for the usual parsing of complete sentences. We prove the correctness and linear complexity of our algorithm and present an interesting extension of our substring parser that allows to condense the input string, which increases the speed when reparsing that string for a second time. Copyright 2001 Elsevier Science B.V.