Lar(m, c, l) grammars

References

• Anderson , T. , Eve , J. and Horning , J. J. 1973 . Efficient LR(1) parsers . Acta Informatica , 2 ( 1 ) : 12 – 39 .
   Google Scholar
• Backhouse , R. C. 1979 . Syntax of Programming Languages, Theory and Practice , Prentice-Hall .
   Google Scholar
• Baker , Theodore P. 1982 . Extending lookahead for LR parsers . Journal of Computer and System Science , 22 ( 2 )
   Web of Science ®Google Scholar
• Manuel E. Bermudez, Regular look-ahead and look-back for LR parsers, Computer and Information Sciences Board of Studies Ph. D Thesis University of California Santa Cruz June 1984
   Google Scholar
• Bermudez , Manuel E. and Schimpf , K. 1986 . Proceedings of the ACM SIGPLAN '86 Symposium on Compiler Construction . A practical arbitrary look-ahead LR parsing technique . June 23 1986 .
   Google Scholar
• Bermudez , Manuel E. and Schimpf , K. 1988 . A general model for fixed look-ahead LR parsers . International Journal of Computer Mathematics , 24 ( 4 ) June
   Web of Science ®Google Scholar
• Culik , C. and Cohen , R. 1973 . LR-Regular grammars—an extension of LR(k) grammars . Journal of Computer and System Sciences , 7 ( 4 ) June : 66 – 96 .
   Google Scholar
• DeRemer Franklin L. Practical translators for LR(k) languages Ph. D Thesis, Department of Electrical Engineering MIT Cambridge, MA 1969
   Google Scholar
• De Remer , Franklin L. 1971 . Simple LR(k) grammars . CACM , 14 ( 7 ) July : 453 – 460 .
   Web of Science ®Google Scholar
• De Remer , F. L. and Pennello , T. J. 1982 . Efficient computation of LALR(l) lookahead sets . ACM TOPLAS , 4 ( 4 ) October
   Google Scholar
• Harrison , M. 1978 . An Introduction to Formal Language Theory , Reading, Massachusetts : Addison-Wesley .
   Google Scholar
• Knuth , D. E. 1965 . On the translation of languages from left to right . Information and Control , 8 : 607 – 639 .
   Google Scholar
• Korenjak , A. J. 1969 . A practical method for constructing LR(k) processors . CACM , 12 ( 11 ) : 613 – 623 .
   Web of Science ®Google Scholar
• Kristensen , B. B. and Madsen , O. L. 1981 . Methods for computing LALR(k) lookahead . ACM Transactions on Programming Languages and Systems , 3 ( 1 ) January : 60 – 82 .
   Google Scholar
• La Londe , W. R. , Lee , E. S. and Horning , J. J. 1971 . An LALR(k) parser generator . Proc. IFIP Congress 71 . 1971 , North Holland, Amsterdam.
   Google Scholar
• Pager , D. 1977 . A practical general method for constructing LR(k) parsers . Acta Informatica , 7 : 249 – 268 .
   Web of Science ®Google Scholar
• Park , J. C. H. , Choe , K. M. and Chang , C. H. A new analysis of LALR formalisms . ACM TOPLAS , 7 ( 1 ) 159 – 175 .
   Google Scholar
• Sippu , S. , Soisalon-Soininen , E. and Ukkonen , E. The complexity of LALR(k) testing . Journal of the ACM , 30 ( 2 ) 259 – 270 .
   Web of Science ®Google Scholar