Suffix languages in Lr parsing

References

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