Recognizing Substrings of LR(k) Languages in Linear Time

@article{Bates1992RecognizingSO,
  title={Recognizing Substrings of LR(k) Languages in Linear Time},
  author={Joseph Bates and Alon Lavie},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1992},
  volume={16},
  pages={1051-1077}
}
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 problem easily reduces to the former. In this article we present a linear-time algorithm for recognizing substrings of LR(k) languages, thus… CONTINUE READING