Abstract
The methods of the previous chapter suffice to define the arithmetic and Boolean expressions of the programming language IMP that is the subject of this book. In this chapter we define their syntax and semantics, write little optimizers for them and show how to compile arithmetic expressions to a simple stack machine. Of course we also prove the correctness of the optimizers and compiler!
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Nipkow, T., Klein, G. (2014). Case Study: IMP Expressions. In: Concrete Semantics. Springer, Cham. https://doi.org/10.1007/978-3-319-10542-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-10542-0_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10541-3
Online ISBN: 978-3-319-10542-0
eBook Packages: Computer ScienceComputer Science (R0)