16
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Suffix languages in Lr parsing

&
Pages 135-153 | Received 04 Jul 1994, Published online: 20 Mar 2007

References

  • Baker , T. 1981 . Extending lookahead for LR parsers . Journal of Computer and System Sciences , 22 ( 2 ) Apr : 243 – 259 .
  • Bermudez , M. and Schimpf , K. M. 1986 . Proceedings of the SIGPLAN'86 Symposium on Compiler Construction . A practical arbitrary look-ahead LR parsing technique . Jun 1986 , Boston, MA. pp. 136 – 144 . ACM Press .
  • Bermudez , M. and Schimpf , K. M. 1990 . Practical arbitrary lookahead LR parsing . Journal of Computer and System Sciences ,
  • Culik , K. and Cohen , R. 1973 . LR-Regular grammars-an extension of LR(k) grammars . Journal of Computer and Systems Sciences , 7 ( 1 ) : 66 – 96 .
  • De Remer , F. 1971 . Simple LR(k) grammars . Communications of the ACM , 14 ( 7 ) Jul : 453 – 460 .
  • De Remer , F. and Pennello , T. 1982 . Efficient computation of LALR(l) look-ahead sets . ACM TOPLAS , 4 ( 4 ) Oct : 615 – 649 .
  • De Remer , F. , Pennello , T. and Mc Keeman , W. 1981 . Ada syntax chart . SIGPLAN Notices , 16 ( 9 ) Sep : 48 – 59 .
  • Hopcroft , J. and Ullman , J. 1979 . J. Introduction to Automata Theory, Languages, and Computation , Reading, MA : Addison-Wesely .
  • H. H. III and Szymanski , T. 1976 . Complexity metatheorem for context-free grammar problems . Journal of Computer and System Sciences , 13 ( 3 ) : 318 – 334 .
  • Knuth , D. 1965 . On the translation of languages from left to right . Information and Control , 8 ( 6 ) : 607 – 639 .
  • Korenjak , A. 1969 . A practical method for constructing LR(k) processors . Communications of the ACM , 12 ( 11 ) : 613 – 623 .
  • Kristensen , B. and Madsen , O. 1981 . Methods for computing LALR(k) lookahead . ACM TOPLAS , 3 ( 1 ) Jan : 60 – 82 .
  • Pager , D. 1977 . The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency . Information Sciences , 12 ( 1 ) : 19 – 42 .
  • Pager , D. 1977 . A practical general method for constructing LR(k) parsers . Acta Informatica , 7 ( 3 ) : 249 – 268 .
  • Seyfarth B. R. On the use of Continuation Languages in Lookahead LR Parsing PhD thesis University of Florida 1989
  • Spector , D. 1988 . Efficient full LR(1) parser generation . SPGPLAN Notices , 23 ( 12 ) Dec : 143 – 175 .
  • Tarjan , R. 1981 . Fast algorithms for solving path problems . Journal of the ACM , 28 ( 3 ) Jul : 594 – 614 .

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.