Book Reviews

References

• De Remer , F. 1969 . “ Practical translators for LR(k) languages ” . In Project MAC Report MAC TR.65 Cambridge , Mass
   Google Scholar
• Earley , J. 1970 . An efficient context-free parsing algorithm . CACM 13 , 2 : 94 – 101 .
   Web of Science ®Google Scholar
• Foster , J.M. 1968 . A syntax improving program . CJ II , 1 : 31 – 34 .
   Google Scholar
• Graham , S.L. Extended precedence languages, bounded right context languages, and deterministic languages . 11th Annual IEEE Switching and Automata Theory Conference Record . pp. 175 – 180 .
   Google Scholar
• Gray , J.N. and Harrison , M.A. Single pass precedence analysis . 10th Annual IEEE Switching and Automata Theory Conference Record . pp. 106 – 117 .
   Google Scholar
• Knuth , D.E. 1965 . On the translation of languages from left to right . IC 8 , 6 : 607 – 639 .
   Google Scholar
• Knuth , D.E. 1971 . Top-down syntax analysis . Acta Informatica 1 , 2 : 79 – 110 .
   Google Scholar
• Korenjak , A.J. 1969 . A practical method for constructing LR(k) processors . CACM 12 , 11 : 613 – 623 .
   Web of Science ®Google Scholar
• Loeckx , J. 1970 . An algorithm for the construction of bounded-context parsers . CACM 13 , 5l : 297 – 307 .
   Web of Science ®Google Scholar
• Rosenkrantz , D.J. and Lewis , P.M. II . 11th Annual IEEE Switching and Automata Theory Conference Record . pp. 139 – 152 .
   Google Scholar
• Rosenkrantz , D.J. and Stearns , R.E. 1970 . Properties of deterministic top-down grammers . IC 17 , 3 : 226 – 256 .
   Google Scholar
• Wood , D. 1971 . A further note on top-down deterministic languages . CJ 14 , 3 : 396 – 403 .
   Google Scholar