LARA Lecture 09: Compiling Expressions to Stack Machine Compiling Expressions VM for Expressions Prefix Infix Postfix Notation Printing Prefix Infix Postfix Languages using Prefix or Postfix Only Evaluating Postfix Translating Expressions to Stack Machine Translation Correctness for Expressions Emitting Code for Assignments Accessing and Storing Variables Compiling Statement Sequence Efficiently Emitting Code Compiling Control-Flow Statements Booleans and Data Representation Compiling If Then Else Linearizing Trees with Control-Flow Branching JVM Instructions Computing Labels Continued in Lecture 10 References JVM Instruction Summary from JVM Spec Compiler Construction by Niklaus Wirth - Chapters 10,11 CompCert - A C Compiler whose Correctness has been Formally Verified Pascal Implementation
