Case Study: IMP Expressions

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 si...

Full description

Saved in:
Bibliographic Details
Published inConcrete Semantics pp. 27 - 36
Main Authors Klein, Gerwin, Nipkow, Tobias
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2014
Springer International Publishing
Subjects
Abstract Syntax
Boolean Expression
Computer programming / software development
Concrete Syntax
Disjunctive Normal Form
Mathematical theory of computation
Programming & scripting languages: general
Return Type
Online AccessGet full text
ISBN3319105418
9783319105413
DOI10.1007/978-3-319-10542-0_3

Cover

More Information
Summary: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!
ISBN:3319105418
9783319105413
DOI:10.1007/978-3-319-10542-0_3