Skip to main content
SpringerLink
Log in

Towards an Automatic Generation of Interpreters

  • Chapter
GI Gesellschaft für Informatik e. V.

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

Abstract

In a precedent paper (Aguzzi 1973) we defined a formal system (APS) designed, essentially, in order to formally define, in an interpretative way, syntax and semantics of programming languages.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • G. Aguzzi, R. Pinzani, R. Sprugnoli - An Algorithmic Approach to the Semantics of Pro gramming Languages, in “Automata, Languages and Programming” (M. Nivat ed.), North-Holland Pub. Co., Amsterdam (1973)

    Google Scholar 

  • G. Aguzzi, F. Cesarini, R. Pinzani, G. Soda, R. Sprugnoli - An APL Implementation of an Interpreter Writing System, in “APL 73”, North-Holland Pub. Co., Amsterdam (1973)

    Google Scholar 

  • A. Colmerauer - Total Precedence Relations, J.A.C.M., vol.17 n.l (1970)

    Google Scholar 

  • S. Ginsburg -. Ginsburg - “The Mathematical Theory of Context-free Languages”, McGraw-Hill Book Co. New York (1966)

    Google Scholar 

  • D. Gries -. Gries - “Compiler Construction for Digital Computers”, J.Wiley and Sons, New York (1971)

    Google Scholar 

  • J. McAfee, L. Presser - An Algorithm for the Design of Simple Precedence Grammars, J.A.C.M., vol. 19 n. 3 (1972)

    Google Scholar 

  • G. Sansone, R. Conti - “Lezioni di Analisi Matematica”, CEDAM, Padova (1958)

    Google Scholar 

  • S. Warshall - A Theorem on Boolean Matrices, J.A.C.M., vol.9 n.l (1962)

    Google Scholar 

Download references

Authors
  1. G. Aguzzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Cesarini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Pinzani
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. G. Soda
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. R. Sprugnoli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Hamburg, Hamburg, Deutschland

    Wilfried Brauer (Vorsitzender des Programmausschusses und Herausgeber) (Vorsitzender des Programmausschusses und Herausgeber)

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Aguzzi, G., Cesarini, F., Pinzani, R., Soda, G., Sprugnoli, R. (1973). Towards an Automatic Generation of Interpreters. In: Brauer, W. (eds) GI Gesellschaft für Informatik e. V.. Lecture Notes in Computer Science, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-41148-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-41148-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-40668-7

  • Online ISBN: 978-3-662-41148-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation