Skip to main content
SpringerLink
Log in

An abstract machine theory for formal language parsers

  • Submitted Abstract
  • Conference paper
  • First Online:
Book cover Category Theory Applied to Computation and Control

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 25))

  • 2029 Accesses

The paper is to appear in Acta Informicata. Research supported in part by the National Science Foundation Grant GJ-1171.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., and Ullman, J.D.: The Theory of Parsing, Translation and Compiling, Prentice-Hall, 1972.

    Google Scholar 

  2. Arbib, M.A., and Manes, E.G.: Machines in a Category, an Expository Introduction, SIAM Review, to appear.

    Google Scholar 

  3. Arbib, M.A., and Manes, E.S.: Adjoint Machines, State-Behavior Machines and Duality, Journal of Pure and Applied Algebra, to appear.

    Google Scholar 

  4. Benson, D. B.: The Algebra of Derivations and a Semithue Parser, Proc. 24th Nat. ACM Conf., 1969, 1–9.

    Google Scholar 

  5. Benson, D.B.: Syntactic Clues, IEEE Conf. Record 11th Annual Symp. on Switching and Automata Theory, 1970, 133–138.

    Google Scholar 

  6. Benson, D.B.: The Basic Algebraic Structures in Categories of Derivations, Comp. Sci. CS-73-004, Washington State University. To appear in Information and Control.

    Google Scholar 

  7. DeRemer, F.L.: Simple LR(k) Grammars, CACM 14, 1971, 453–460.

    MathSciNet  MATH  Google Scholar 

  8. Earley, J.: An Efficient Context-Free Parsing Algorithm, CACM 13, 1970, 94–102.

    MATH  Google Scholar 

  9. Give'on, Y.: A Categorical Review of Algebra Automata and Systems Theories, Symposia Mathematica, Vol. 4, Institute Nazionale di Alta Matematica, Academic Press, 1970.

    Google Scholar 

  10. Goguen, J.A.: Minimal Realization of Machines in Closed Categories, Bull. Am. Math. Soc. 78, 1972, 777–783.

    Article  MathSciNet  MATH  Google Scholar 

  11. Hotz, G.: Eindeutigkeit und Mehrdeutigkeit Formaler Sprachen, EIK 2, 1966, 235–247.

    MathSciNet  MATH  Google Scholar 

  12. Knuth, D.E.: On the Translation of Languages from Left to Right, Information and Control 8, 1965, 607–639.

    Article  MathSciNet  Google Scholar 

  13. McKeeman, W.M., et.al.: A Compiler Generator, Prentice-Hall, 1970.

    Google Scholar 

  14. MacLane, S.: Categories for the Working Mathematician, Springer, 1972.

    Google Scholar 

  15. Pareigis, B.: Categories and Functors, Academic Press, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Washington State University, 99163, Pullman, WA, USA

    David B. Benson

Authors
  1. David B. Benson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ernest Gene Manes

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benson, D.B. (1975). An abstract machine theory for formal language parsers. In: Manes, E.G. (eds) Category Theory Applied to Computation and Control. Lecture Notes in Computer Science, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07142-3_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-07142-3_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07142-6

  • Online ISBN: 978-3-540-37426-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation