Advertisement

Parallel decomposition of LR(k) parsers

Extended abstract
  • David B. Benson
  • Ralph D. Jeffords
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)

Keywords

Input Symbol Parallel Decomposition Null String Weak Precedence Parser State 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    Aho, A. V., and Johnson, S. C. LR parsing. ACM Computing Surveys 6,2 (June 1974), 99–123.Google Scholar
  2. [2]
    Aho, A. V., and Ullman, J. D. The Theory of Parsing, Translating, and Compiling, Vol. I and II. Prentice-Hall, Englewood Cliffs, N. J., 1972, 1973.Google Scholar
  3. [3]
    Anderson, J., Eve, J., and Horning, J. J. Efficient LR(1) parsers. Acta Informatica 2,1 (1973), 12–39.Google Scholar
  4. [4]
    Benson, D. B. An abstract machine theory for formal language parsers. Acta Informatica 3,2 (1974), 187–202.Google Scholar
  5. [5]
    Benson, D. B. The basic algebraic structures in categories of derivations. Information and Control 28,1 (May 1975), 1–29.Google Scholar
  6. [6]
    Benson, D. B. Some preservation properties of normal form grammars. SIAM J. Computing 6,2 (1977), to appear.Google Scholar
  7. [7]
    Benson, D. B., and Jeffords, R. D. A vector encoding technique applicable to tabular parsing methods, submitted to Comm. ACM.Google Scholar
  8. [8]
    DeRemer, F. L. Practical translators for LR(k) languages, Tech. Report MAC TR-65, Project MAC, M.I.T., Cambridge, Mass., Oct. 1969.Google Scholar
  9. [9]
    Eilenberg, S. Automata, Languages, and Machines, Vol. B. Academic Press, New York, 1976.Google Scholar
  10. [10]
    Fischer, C. On parsing context free languages in parallel environments. Cornell U. TR75-237 (1975).Google Scholar
  11. [11]
    Hartmanis, J. and Stearns, R. E. Algebraic Structure Theory of Sequential Machines. Prentice-Hall, Englewood Cliffs, N.J., 1966.Google Scholar
  12. [12]
    Jeffords, R. D. Algebraic decomposition of parsers. Ph.D.Diss., Washington State Univ., Pullman, Wash., Feb. 1977.Google Scholar
  13. [13]
    Korenjak, A. J. A practical method for constructing LR(k) processors. Comm. ACM 12,11 (Nov. 1969), 613–623.Google Scholar
  14. [14]
    Schnorr, C. P., and Walter, H. Pullbackkonstruktionen bei Semi-Thuesystemen. E.I.K. 5,1 (1969), 27–36.Google Scholar
  15. [15]
    Walter, H. Verallgemeinerte Pullbackkonstruktionen bei Semi-Thuesystemen und Grammatiken. E.I.K. 6,4 (1970), 239–254.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • David B. Benson
    • 1
  • Ralph D. Jeffords
    • 1
  1. 1.Computer Science DepartmentWashington State UniversityPullmanUSA

Personalised recommendations