Research supported in part by NSF Grant MCS 73-03497A01.
Chapter PDF
Keywords
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
Aho, A. V., and Johnson, S. C. LR parsing. ACM Computing Surveys 6,2 (June 1974), 99–123.
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.
Anderson, J., Eve, J., and Horning, J. J. Efficient LR(1) parsers. Acta Informatica 2,1 (1973), 12–39.
Benson, D. B. An abstract machine theory for formal language parsers. Acta Informatica 3,2 (1974), 187–202.
Benson, D. B. The basic algebraic structures in categories of derivations. Information and Control 28,1 (May 1975), 1–29.
Benson, D. B. Some preservation properties of normal form grammars. SIAM J. Computing 6,2 (1977), to appear.
Benson, D. B., and Jeffords, R. D. A vector encoding technique applicable to tabular parsing methods, submitted to Comm. ACM.
DeRemer, F. L. Practical translators for LR(k) languages, Tech. Report MAC TR-65, Project MAC, M.I.T., Cambridge, Mass., Oct. 1969.
Eilenberg, S. Automata, Languages, and Machines, Vol. B. Academic Press, New York, 1976.
Fischer, C. On parsing context free languages in parallel environments. Cornell U. TR75-237 (1975).
Hartmanis, J. and Stearns, R. E. Algebraic Structure Theory of Sequential Machines. Prentice-Hall, Englewood Cliffs, N.J., 1966.
Jeffords, R. D. Algebraic decomposition of parsers. Ph.D.Diss., Washington State Univ., Pullman, Wash., Feb. 1977.
Korenjak, A. J. A practical method for constructing LR(k) processors. Comm. ACM 12,11 (Nov. 1969), 613–623.
Schnorr, C. P., and Walter, H. Pullbackkonstruktionen bei Semi-Thuesystemen. E.I.K. 5,1 (1969), 27–36.
Walter, H. Verallgemeinerte Pullbackkonstruktionen bei Semi-Thuesystemen und Grammatiken. E.I.K. 6,4 (1970), 239–254.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benson, D.B., Jeffords, R.D. (1977). Parallel decomposition of LR(k) parsers. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive