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.
CITATION STYLE
Goeman, H. (1999). On parsing and condensing substrings of LR languages in linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1660, pp. 22–42). Springer Verlag. https://doi.org/10.1007/3-540-48057-9_3
Mendeley helps you to discover research relevant for your work.