exam02 will be 2022-May-03 (Tue) 10:15, in-class, on-paper, closed-notes.
See instructions.html.
A practice-exam and solution is available on D2L » Content » exam02.
(The practice-exam's solution is released a bit later than the practice-exam,
to help encourage a practice-take
before looking at the solution).
Our exam might include...
Given a grammar, be able to design structs to represent parse trees for it
(you'll have a choice of racket or Java).
write a recursive-descent parser for that grammar (returning the parse tree).
Be able to write functions which process that parse-tree,
including functions that selectively stop processing sub-trees based on some criterion.
Questions based on bits of code from the A0–A4 implementations, possibly modifying that code.
Understanding static scope (let,let*), shadowing,
and function-closures.
prolog questions, including list-based processing.
questions very-similar to #1,#2 from this exam02-practice.
Questions the same-or-similar-to any question on exam01 are certainly fair game.
exam01 will be 2022-Mar-22 (Tue) in-class, on-paper, closed-notes.
It may include: