CS 153: Concepts of Compiler Design October 5 Class Meeting

Slides:



Advertisements
Similar presentations
1 Compiler Construction Intermediate Code Generation.
Advertisements

1 Chapter 7: Runtime Environments. int * larger (int a, int b) { if (a > b) return &a; //wrong else return &b; //wrong } int * larger (int *a, int *b)
Runtime Environments Source language issues Storage organization
CS 152: Programming Language Paradigms April 9 Class Meeting Department of Computer Science San Jose State University Spring 2014 Instructor: Ron Mak
CS 153: Concepts of Compiler Design September 2 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
Compiler Construction
CS 153: Concepts of Compiler Design September 9 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
CS 153: Concepts of Compiler Design October 5 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
CS 152: Programming Language Paradigms April 2 Class Meeting Department of Computer Science San Jose State University Spring 2014 Instructor: Ron Mak
CS 153: Concepts of Compiler Design September 16 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
BİL 744 Derleyici Gerçekleştirimi (Compiler Design)1 Run-Time Environments How do we allocate the space for the generated target code and the data object.
Run-Time Storage Organization Compiler Design Lecture (03/23/98) Computer Science Rensselaer Polytechnic.
CS 153: Concepts of Compiler Design September 21 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
CS 153: Concepts of Compiler Design October 7 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
CS 153: Concepts of Compiler Design October 10 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
CS 153: Concepts of Compiler Design November 23 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
CS 153: Concepts of Compiler Design September 30 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
7. Runtime Environments Zhang Zhizheng
CS 152: Programming Language Paradigms April 7 Class Meeting Department of Computer Science San Jose State University Spring 2014 Instructor: Ron Mak
CS 153: Concepts of Compiler Design October 12 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
CS 153: Concepts of Compiler Design September 23 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
CS 152: Programming Language Paradigms May 12 Class Meeting Department of Computer Science San Jose State University Spring 2014 Instructor: Ron Mak
CS 153: Concepts of Compiler Design September 28 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
Run-Time Environments Presented By: Seema Gupta 09MCA102.
CS 432: Compiler Construction Lecture 9
Chapter 10 : Implementing Subprograms
CS 153: Concepts of Compiler Design September 14 Class Meeting
Run-Time Environments Chapter 7
Implementing Subprograms
CS 153: Concepts of Compiler Design October 17 Class Meeting
CS 153: Concepts of Compiler Design October 3 Class Meeting
CS 153: Concepts of Compiler Design November 28 Class Meeting
CS 153: Concepts of Compiler Design November 30 Class Meeting
CMPE 152: Compiler Design December 5 Class Meeting
CMPE 152: Compiler Design February 6 Class Meeting
CMPE 152: Compiler Design September 25 Class Meeting
Implementing Subprograms
CMPE 152: Compiler Design September 4 Class Meeting
CMPE 152: Compiler Design August 30 Class Meeting
CMPE 152: Compiler Design September 18 Class Meeting
CMPE 152: Compiler Design September 13 Class Meeting
CMPE 152: Compiler Design October 2 Class Meeting
CMPE 152: Compiler Design October 4 Class Meeting
CMPE 152: Compiler Design September 11/13 Lab
CMPE 152: Compiler Design October 4 Class Meeting
CMPE 152: Compiler Design August 21/23 Lab
CMPE 152: Compiler Design September 20 Class Meeting
CMPE 152: Compiler Design September 27 Class Meeting
CS 153: Concepts of Compiler Design November 6 Class Meeting
Activation records Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Section
UNIT V Run Time Environments.
CS 432: Compiler Construction Lecture 11
CMPE 152: Compiler Design February 28 Class Meeting
CMPE 152: Compiler Design March 7 Class Meeting
CMPE 152: Compiler Design February 7 Class Meeting
CMPE 152: Compiler Design February 28 / March 5 Lab
Runtime Environments What is in the memory?.
CMPE 152: Compiler Design February 21 Class Meeting
CMPE 152: Compiler Design February 26 Class Meeting
CMPE 152: Compiler Design March 7 Class Meeting
CMPE 152: Compiler Design April 16 Class Meeting
Implementing Subprograms
CMPE 152: Compiler Design March 19 Class Meeting
CMPE 152: Compiler Design March 7/12 Lab
Activation records Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Section
CMPE 152: Compiler Design May 2 Class Meeting
CMPE 152: Compiler Design September 17 Class Meeting
CMPE 152: Compiler Design February 7 Class Meeting
CMPE 152: Compiler Design September 26 Class Meeting
CMPE 152: Compiler Design September 19 Class Meeting
Presentation transcript:

CS 153: Concepts of Compiler Design October 5 Class Meeting Department of Computer Science San Jose State University Fall 2017 Instructor: Ron Mak www.cs.sjsu.edu/~mak

Reminders A VARIABLE node in the parse tree contains a pointer to the variable name’s symbol table entry. Set in the front end by method VariableParser.parse() The method that takes two parameters. A symbol table entry contains a pointer to its parent symbol table. The symbol table that contains the entry.

Reminders, cont’d Each symbol table has a nesting level field. Therefore, at run time, for a given VARIABLE node, the executor can determine the nesting level of the variable.

Runtime Access to Nonlocal Variables PROGRAM main1; VAR i, j : integer; PROCEDURE proc2a; VAR m : integer; PROCEDURE proc3; VAR j : integer BEGIN j := i + m; END; BEGIN {proc2a} i := 11; m := j; proc3; PROCEDURE proc2b; VAR j, m : integer; j := 14; m := 5; proc2a; BEGIN {main1} i := 33; j := 55; proc2b; END. AR: proc3 j AR: proc2a m 3 2 AR: proc2b j m 1 RUNTIME DISPLAY AR: main1 i j The runtime display allows faster access to nonlocal values. RUNTIME STACK main1  proc2b  proc2a  proc3

Recursive Calls PROGRAM main1 FUNCTION func2 FUNCTION func3 PROCEDURE proc2 PROCEDURE proc3 AR: proc2 AR: func3 AR: proc3 AR: func2 AR: proc3 3 2 AR: proc2 1 AR: main1 RUNTIME DISPLAY RUNTIME STACK main1  proc2  proc3  func2  proc3  func3  proc2

Allocating an Activation Record The activation record for a routine (procedure, function, or the main program) needs one or more “data cells” to store the value of each of the routine’s local variables and formal parameters. TYPE arr = ARRAY[1..3] OF integer; ... PROCEDURE proc(i, j : integer; VAR x, y : real; VAR a : arr; b : arr); VAR k : integer; z : real; AR: proc i x k j y z a b

Allocating an Activation Record TYPE arr = ARRAY[1..3] OF integer; ... PROCEDURE proc(i, j : integer; VAR x, y : real; VAR a : arr; b : arr); VAR k : integer; z : real; AR: proc i x k j y z a b Obtain the names and types of the local variables and formal parameters from the routine’s symbol table.

Allocating an Activation Record TYPE arr = ARRAY[1..3] OF integer; ... PROCEDURE proc(i, j : integer; VAR x, y : real; VAR a : arr; b : arr); VAR k : integer; z : real; AR: proc i x k j y z a b Whenever we call a procedure or function: Create an activation record. Push the activation record onto the runtime stack. Allocate the memory map of data cells based on the symbol table. No more storing runtime values in the symbol table!

Passing Parameters During a Call PROGRAM main; TYPE arr = ARRAY[1..3] OF integer; VAR index, count : integer; epsilon, delta : real; triplet : arr; PROCEDURE proc(i, j : integer; VAR x, y : real; VAR a : arr; b : arr); ... BEGIN {main} proc(index + 2, count, epsilon, delta, triplet, triplet); END. AR: proc i x 12 j y 84 a b 10 20 30 index count epsilon delta AR: main triplet 10 84 -3.1 0.07 20 30 RUNTIME STACK Value parameters: A copy of the value is passed. VAR parameters: A reference to the actual parameter is passed.

Memory Management Interfaces Implementations: Runtime stack: ArrayList<ActivationRecord> Runtime display: ArrayList<ActivationRecord> Memory map: HashMap<String, Cell> Class MemoryFactory creates: runtime stack runtime display memory map cell

Class RuntimeStackImpl In package backend.interpreter.memoryImpl Extends ArrayList<ActivationRecord> Methods push(ActivationRecord ar) Push an activation record onto the runtime stack. ActivationRecord pop() Pop off the top activation record. ActivationRecord getTopmost (int nestingLevel) Return the topmost activation record at a given nesting level. (Uses the runtime display!)

Class RuntimeDisplayImpl In package backend.interpreter.memoryImpl Extends ArrayList<ActivationRecord> Methods ActivationRecord getActivationRecord (int nestingLevel) Get the activation record at a given nesting level. callUpdate(int nestingLevel, ActivationRecord ar) Update the display for a call to a routine at a given nesting level. returnUpdate(int nestingLevel) Update the display for a return from a routine at a given nesting level.

Class MemoryMapImpl In package backend.interpreter.memoryimpl Extends HashMap<String, Cell> Methods MemoryMapImpl(SymTab symTab) Allocate the memory cells based on the names and types of the local variables and formal parameters in the symbol table. Cell getCell(String name) Return the memory cell with the given name. ArrayList<String> getAllNames() Return the list of all the names in this memory map.

Class ActivationRecordImpl In package backend.interpreter.memoryimpl Fields int nestingLevel MemoryMap memoryMap Values of the local variables and formal parameters ActivationRecord link Link to the previous topmost activation record with the same nesting level in the runtime stack Method Cell getCell(String name) Return a reference to a memory cell in the memory map that is keyed by the name of a local variable or formal parameter.

Executing Procedure and Function Calls

Class CallDeclaredExecutor Method execute() Create a new activation record based on the called routine’s symbol table. Execute the actual parameter expressions. Initialize the memory map of the new activation record. The symbol table entry of the name of the called routine points to the routine’s symbol table. Copy values of actual parameters passed by value. Set pointers to actual parameters passed by reference.

Class CallDeclaredExecutor cont’d Method execute() cont’d Push the new activation record onto the runtime stack. Access the root of the called routine’s parse tree. The symbol table entry of the name of the called routine points to the routine’s parse tree. Execute the routine. Pop the activation record off the runtime stack.

Class CallDeclaredExecutor Method executeActualParms() Obtain the formal parameter cell in the new activation record: Cell formalCell = newAr.getCell(formalId.getName());

Class CallDeclaredExecutor Method executeActualParms() cont’d Value parameter: Object value = expressionExecutor.execute(actualNode); assignmentExecutor.assignValue (actualNode, formalId, formalCell, formalType, value, valueType); Set a copy of the value of the actual parameter into the memory cell for the formal parameter.

Class CallDeclaredExecutor Method executeActualParms() cont’d VAR (reference) parameter: Method ExpressionExecutor.executeVariable() executes the parse tree for an actual parameter and returns the reference to the value. Cell actualCell= (Cell) ExpressionExecutor.executeVariable (actualNode); formalCell.setValue(actualCell); Set a reference to the actual parameter into the memory cell for the formal parameter.

Class Cell Since a memory cell can contain a value of any type or a reference, we implement it simply as a Java object. package wci.backend.interpreter.memoryimpl; public class CellImpl implements Cell { private Object value = null; ... public void setValue(Object newValue) value = newValue; } public Object getValue() return value;

Runtime Error Checking Range error Assign a value to a variable with a subrange type. Verify the value is within range Not less than the minimum value and not greater than the maximum value. Method StatementExecutor.checkRange() Division by zero error Before executing a division operation, check that the divisor’s value is not zero.

Pascal Interpreter Now we can execute entire Pascal programs! Demo

Assignment #4: Complex Type Add a built-in complex data type to Pascal. Add the type to the global symbol table. Implement as a record type with real fields re and im. Declare complex numbers: Assign values to them: VAR x, y, z : complex; BEGIN z.re := 3.14; z.im := -8.2; ...

Assignment #4, cont’d Do complex arithmetic: The backend executor does all the work of evaluating complex expressions. Use the following rules: z := x + y; 𝑎+𝑏𝑖 + 𝑐+𝑑𝑖 = 𝑎+𝑐 + 𝑏+𝑑 𝑖 𝑎+𝑏𝑖 − 𝑐+𝑑𝑖 = 𝑎−𝑐 + 𝑏−𝑑 𝑖 𝑎+𝑏𝑖 𝑐+𝑑𝑖 = 𝑎𝑐−𝑏𝑑 + 𝑎𝑑+𝑏𝑐 𝑖 𝑎+𝑏𝑖 𝑐+𝑑𝑖 = 𝑎𝑐+𝑏𝑑 + 𝑏𝑐−𝑎𝑑 𝑖 𝑐 2 + 𝑑 2

Assignment #4, cont’d Start with the Java code from Chapter 12. Examine wci.intermediate.symtabimpl.Predefined to see how the built-in types like integer and real are defined. Examine wci.frontend.pascal.parsers.RecordTypeParser to see what information is entered into the symbol table for a record type.