Lab for Automated Reasoning and Analysis LARA

Lecture 11: Compiling to Register Machines

About Register Machines

Register machines are an alternative to compilation to stack-based machines; they are closer to modern processors.

ARM Architecture

Picture of JVM State with:

  • Procedure Stacks
  • Slots
  • Operand Stack
  • Global Heap

Register Machine Model in Scala

xyz Example using GCC and digression on computer arithmetic

Organizing the global memory:

Memory Layout for Compiled Program

We next examine how to map various data in the program to the appropriate parts of the memory.

Mapping Variables to Registers

 
cc10/lecture_11.txt · Last modified: 2010/12/05 14:00 by vkuncak
 
© EPFL 2018 - Legal notice