Recognizing Substrings of LR(k) Languages in Linear Time

Abstract

LR parsing techniques have long been studied as being efficient and powerful methods for processing context-free languages. A linear-time algorithm for recognizing languages representable by LR(k) grammars has long been known. Recognizing substrings of a context-free language is at least as hard as recognizing full strings of the language, since the latter… (More)
DOI: 10.1145/177492.177768

Topics

4 Figures and Tables

Slides referencing similar topics