Substring Parsing for Arbitrary Context-Free Grammars

@article{Rekers1990SubstringPF,
  title={Substring Parsing for Arbitrary Context-Free Grammars},
  author={J. Rekers and Wilco Koorn},
  journal={SIGPLAN Notices},
  year={1990},
  volume={26},
  pages={59-66}
}
A substring recognizer for a language L determines whether a string s is a substring of a sentence in L, i.e., substring-recognize(s) succeeds if and only if ∃v, w: vsw ∈ L. The algorithm for substring recognition presented here accepts general context-free grammars and uses the same parse tables as the general context-free parsing algorithm from which it was derived. Substring recognition can be useful for noncorrecting syntax error recovery and for incremental parsing. By extending… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS