@inproceedings{rekers-koorn-1991-substring,
    title = "Substring Parsing for Arbitrary Context-Free Grammars",
    author = "Rekers, Jan  and
      Koorn, Wilco",
    editor = "Tomita, Masaru  and
      Kay, Martin  and
      Berwick, Robert  and
      Hajicova, Eva  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Nagao, Makoto  and
      Wilks, Yorick",
    booktitle = "Proceedings of the Second International Workshop on Parsing Technologies",
    month = feb # " 13-25",
    year = "1991",
    address = "Cancun, Mexico",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/ingest-emnlp/1991.iwpt-1.25/",
    pages = "218--224",
    abstract = "A substring recognizer for a language $L$ determines whether a string $s$ is a substring of a sentence in $L$, i.e., \textit{substring-recognize(s)} succeeds if and only if $\exists v,w: vsw \in L$. The algorithm for substring recognition presented here accepts general context-free grammars and uses the same parse tables as the parsing algorithm from which it was derived. Substring recognition is useful for \textit{non-correcting} syntax error recovery and for incremental parsing. By extending the substring \textit{recognizer} with the ability to generate trees for the possible contextual completions of the substring, we obtain a substring \textit{parser}, which can be used in a syntax-directed editor to complete fragments of sentences."
}