Noncorrecting syntax error recovery
ACM Transactions on Programming Languages and Systems (TOPLAS)
An LR substring parser for noncorrecting syntax error recovery
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
On Kilbury's modification of Earley's algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parsing theory volume 2: LR(K) and LL(K) parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
Substring parsing for arbitrary context-free grammars
ACM SIGPLAN Notices
Parsing techniques: a practical guide
Parsing techniques: a practical guide
Recursive ascent parsing: from Earley to Marcus
Theoretical Computer Science
Recognizing substrings of LR(k) languages in linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Bi-directional LR parsing from an anchor word for speech recognition
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Fast parallel recognition of LR language suffixes
Information Processing Letters
Fast parallel recognition of LR language suffixes
Information Processing Letters
String analysis as an abstract interpretation
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
| Hi-index | 0.01 |
We present a linear-time algorithm to decide for any fixed deterministic context-free language L and input string w whether wis a suffix of some string in L. In contrast to a previously published technique, the decision procedure may be extended to produce syntactic structures (parses) without an increase in time complexity. We also show how this algorithm may be applied to pocess incorrect input in linear time.