The size of LALR (1) parsers
- 1 September 1974
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 14 (3) , 326-337
- https://doi.org/10.1007/bf01933232
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A technique for speeding up LR(k) parsersPublished by Association for Computing Machinery (ACM) ,1972
- Simple LR(k) grammarsCommunications of the ACM, 1971
- A technique for generating almost optimal Floyd-Evans productions for precedence grammarsCommunications of the ACM, 1970
- A transitive closure algorithmBIT Numerical Mathematics, 1970
- EULER: A generalization of ALGOL and its formal definition: Part 1Communications of the ACM, 1966
- On the translation of languages from left to rightInformation and Control, 1965
- On the relative efficiencies of context-free grammarCommunications of the ACM, 1965
- Bounded context syntactic analysisCommunications of the ACM, 1964
- Syntactic Analysis and Operator PrecedenceJournal of the ACM, 1963
- Revised report on the algorithmic language ALGOL 60Communications of the ACM, 1963