Substring parsing for arbitrary context-free grammars
- 1 May 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 26 (5) , 59-66
- https://doi.org/10.1145/122501.122505
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Incremental generation of parsersACM SIGPLAN Notices, 1989
- An LR substring parser for noncorrecting syntax error recoveryACM SIGPLAN Notices, 1989
- Parsing incomplete sentencesPublished by Association for Computational Linguistics (ACL) ,1988
- Noncorrecting syntax error recoveryACM Transactions on Programming Languages and Systems, 1985
- An efficient incremental LR parser for grammars with epsilon productionsActa Informatica, 1983
- Augmenting Parsers to Support IncrementalityJournal of the ACM, 1980
- Incremental ParsingACM Transactions on Programming Languages and Systems, 1979
- Incremental LR parsersActa Informatica, 1978
- An efficient context-free parsing algorithmCommunications of the ACM, 1970
- Bounded context syntactic analysisCommunications of the ACM, 1964