On Parsing and Condensing Substrings of LR Languages in Linear Time

Authors:
Heiko Goeman
Affiliations:
-
Venue:
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Year:
1998

Citing 5
Cited 0

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

LR parsers have long been 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 that 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.