|
CSE 401, Au10:
Final Exam Topics
|
|
This is meant as a quick reminder of topics covered since the midterm. Any
topic related to compiling is reasonable on the final (i.e, what would you
need to do to implement some feature, from the front to the back end of the
compiler). But we won't have detailed questions on regular expressions, LR
parser tables, and other front-end issues that were covered in depth on the
midterm. You may bring one sheet of paper with any hand-written notes you
wish, plus you may bring your notes page from the midterm.
- Distribution of tasks in phases of a typical compiler (parsing, semantics,
optimization, code gen, etc.)
- Intermediate Representation
- Abstract syntax trees
- Visitor pattern
- Symbol Tables
- Typical information recorded for names
- Scopes; where is the declaration of a name valid
- General organization of symbol tables for MiniJava (global, per-class,
per-method)
- Static semantics
- Role of types in programming languages
- Examples of checks for typical language constructs
- x86 Architecture - basic instruction set
as used in the project
- You should be able to read/write simple functions in assembly language
- Runtime Storage Layout
- Representation
of scalars, arrays, objects
- Memory areas: static, stack, heap
- Calling
Conventions
- Caller vs. Callee
- What things must be taken care of on call
and return
- Layout of
stack frame
- Object
Representation
- Data Layout
- Inheritance
- Method invocation
with inheritance (vtables)
- Code Generation for other Language Constructs
- if-then-else
- Loops
- Arrays - new,
length, assignment, access
- Major backend issues - not in detail, but know the major ideas
- Instruction selection; tree pattern matching
- Instruction scheduling
- Register Allocation
- Optimization
- Scopes of Optimization: peephole, local, global, interprocedural
- Examples
of
each
|
 |
Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA 98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to
perkins]
|
CSE Home