编译原理教学课件：lec 11 Code Generation .pdf

Code Generation Lecture 12 Prof. Aiken CS 143 Lecture 12 1 Lecture Outline • Topic 1: Basic Code Generation – The MIPS assembly language – A simple source language – Stack-machine implementation of the simple language • Topic 2: Code Generation for Objects Prof. Aiken CS 143 Lecture 12 2 From Stack Machines to MIPS • The compiler generates code for a stack machine with accumulator • We want to run the resulting code on the MIPS processor (or simulator) • We simulate stack machine instructions using MIPS instructions and registers Prof. Aiken CS 143 Lecture 12 3 Simulating a Stack Machine… • The accumulator is kept in MIPS register $a0 • The stack is kept in memory – The stack grows towards lower addresses – Standard convention on the MIPS architecture • The address of the next location on the stack is kept in MIPS register $sp – The top of the stack is at address $sp + 4 Prof. Aiken CS 143 Lecture 12 4 MIPS Assembly MIPS architecture – Prototypical Reduced Instruction Set Computer (RISC) architecture – Arithmetic operations use registers for operands and results – Must use load and store instructions to use operands and results in memory – 32 general purpose registers (32 bits each) • We will use $sp, $a0 and $t1 (a temporary register) • Read the SPIM documentation for details Prof. Aiken CS 143 Lecture 12 5 A Sample of MIPS Instructions – lw reg offset(reg ) 1 2 • Load 32-bit word from address reg2 + offset into reg1 – add reg1 reg2 reg3 • reg ← reg + reg 1 2 3 – sw