Practical arbitrary lookahead LR parsing
- 1 October 1990
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 41 (2) , 230-250
- https://doi.org/10.1016/0022-0000(90)90037-l
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A practical arbitrary look-ahead LR parsing techniqueACM SIGPLAN Notices, 1986
- Efficient Computation of LALR(1) Look-Ahead SetsACM Transactions on Programming Languages and Systems, 1982
- Ada syntax chartACM SIGPLAN Notices, 1981
- Extending lookahead for LR parsersJournal of Computer and System Sciences, 1981
- Methods for Computing LALR( k ) LookaheadACM Transactions on Programming Languages and Systems, 1981
- LR-regular grammars—an extension of LR(k) grammarsJournal of Computer and System Sciences, 1973
- EfficientLR (1) parsersActa Informatica, 1973
- Simple LR(k) grammarsCommunications of the ACM, 1971
- A practical method for constructing LR ( k ) processorsCommunications of the ACM, 1969
- On the translation of languages from left to rightInformation and Control, 1965