Third Hour Exam For those of you who missed class,pick upa copy of the final
exam from Annepha Pemberton in DH 3080 during business hours.
A practice exam is available,
with the usual warnings the questions on the finalexam will not
be identical to the practice exam.
Parsing, V
recursive descent, LL(1), start of bottom-up parsing
Material Covered on the First Hour ExamYou are responsible for material above this line on the first exam Material below this line is covered on the second exam
Parsing, VI
handles in a bottom-up, LR style parser
Lexical Scoping and Addressability
symbol tables, access links, and displays
You are responsible for material above this line on the second exam Material below this line is covered on the third exam
Vasanth Bala, Evelyn Duesterwald, Sanjeev Banerjia,
"Dynamo:
A Transparent Dynamic Optimization System,"
Proceedings of the ACM SIGPLAN 2000 Symposium on Programming
Language Design and Implementation, May 2000.
P. Briggs, K.D. Cooper, L. Torczon, "Improvements to Graph Coloring
Register Allocation,", ACM Transactions on Programming Languages
and Systems (TOPLAS), 16(3), May 1994, pages 428-455.
(DOI)
G.J. Chaitin, M.A. Auslander, A.K. Chandra, J. Cocke, M.E. Hopkins,
and P.W. Markstein, "Register Allocation Via Coloring,", Computer
Languages, 6(1), January 1981, pages 47--57.
(DOI)
G.J. Chaitin, "Register Allocation and Spilling Via Graph Coloring,"
Proceedings of the ACM SIGPLAN Symposium on Compiler Construction,
SIGNPLAN NOTICES 17(6), June 1982, pages 98--105.
(DOI)
S.S. Lavrov, "Store Economy in Closed Operator Scheme", Journal
of Computational Mathematics and Mathematical Physics I, 4, 1961,
pages 687-701. (Published in English translation in USSR
Computational Mathematics and Mathematical Physics 1(3), 1962.
pages 810--828.) (DOI)
A.P. Ershov, "Reduction of the Problem of Memory Allocation in
Programming to the Problem of Coloring the Vertices of Graphs",
Doklady Akademii Naux SSSR 142(4), pages 785-787.
(Published in English translation in Soviet Mathematics 3(1),
January 1962, pages 163-165.)
K.D. Cooper, T.J. Harvey, and L. Torczon, "How to Build an Interference
Graph", Software--Practice and Experience. 28(4), April 1998.
(DOI)