Abstract
This chapter introduces the distinction between interpreters and compilers, and demonstrates some concepts of compilation, using the simple expression language as an example. Some concepts of interpretation are illustrated also, using a stack machine as an example.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adobe Systems: Postscript Language Reference, 3rd edn. Addison-Wesley, Reading (1999). At http://www.adobe.com/products/postscript/pdfs/PLRM.pdf
Kamin, S.: Programming Languages: An Interpreter-Based Approach. Addison-Wesley, Reading (1990)
Samelson, K., Bauer, F.L.: Sequential formula translation. Commun. ACM 3(2), 76–83 (1960)
Sestoft, P.: Java Precisely, 2nd edn. MIT Press, Cambridge (2005)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London
About this chapter
Cite this chapter
Sestoft, P. (2012). Interpreters and Compilers. In: Programming Language Concepts. Undergraduate Topics in Computer Science, vol 50. Springer, London. https://doi.org/10.1007/978-1-4471-4156-3_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4156-3_2
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4155-6
Online ISBN: 978-1-4471-4156-3
eBook Packages: Computer ScienceComputer Science (R0)