11
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

A general model for fixed look-ahead lr parsers

&
Pages 237-271 | Received 01 Jul 1987, Published online: 19 Mar 2007

References

  • Backhouse , R.C. 1979 . Syntax of Programming Languages, Theory and Practice , Prentice-Hall .
  • Baker , Theodore P. 1982 . Extending lookahead for LR parsers . Journal of Computer and System Science , 22 ( 2 )
  • Bermudez , Manuel E. December 1982 . “ Local extension of a-LALR(1) parser to LALR(k),Master's Thesis ” . In Computer and Information Sciences Board of Studies , December , Santa Cruz : University of California .
  • Bermudez , Manuel E. June 1984 . “ Regular look-ahead and look-back for LR parsers ” . In Ph.D.Thesis, Computer and Information Sciences Board of Studies , June , Santa Cruz : University of California .
  • Bermudez , Manuel E. and Schimpf , K. . A practical arbitrary look-ahead LR parsing technique . Proceedings of the ACM SIGPLAN '86 Symposium on Compiler Construction .
  • Culik , C. and Cohen , R. 1973 . LR-Regular Grammars—an extension of LR(k) grammars . Journal of Computer and System Sciences , 7 : 66 – 96 .
  • DeRemer , Franklin L. 1969 . “ Practical Translators for LR(k) Languages ” . In Ph.D. Thesis , Cambridge, MA : M.I.T . Department of Electrical Engineering
  • DeRemer , Franklin L. 1971 . Simple LR(k) grammars . CACM , 14 ( 7 ) July : 453 – 460 .
  • DeRemer , F.L. and Pennello , T.J. 1982 . Efficient computation of LALR(1) look-ahead sets . ACM TOPLAS , 4 ( 4 ) October
  • Knuth , D.E. 1965 . On the translation of languages from left to right . Information and Control , 8 ( 4 ) October : 607 – 639 .
  • Kristensen , B.B. and Madsen , O.L. 1981 . Methods for computing LALR(k) look-ahead . ACM Transactions on Programming Languages and Systems , 3 ( 1 ) January : 60 – 82 .
  • LaLonde , W.R. , Lee , E.S. and Horning , J.J. . An LALR(k) parser generator . Proc. IF IP Congress 71 . Amsterdam : North-Holland .
  • Pager , D. 1977 . A practical general method for constructing LR(k) parsers . Acta Informatica , 7 : 249 – 268 .
  • Park , J.C.H. , Choe , K.M. and Chang , C.H. 1977 . A new analysis of LALR formalisms . ACM TOPLAS , 7 ( 1 ) : 159 – 175 .
  • Sippu , S. , Soisalon-Soininen , E. and Ukkonen , E. 1977 . The complexity of LALR(k) testing . Journal of the ACM , 30 ( 2 ) : 259 – 270 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.