CS 421: Programming Languages and Compilers

Machine Problems for Spring 2009
Topic: Total Points Issued: Due at 11:59pm (Illinois time) on: Automatic extension
(with 20% penalty)
until 11:59pm on:
MP1 OCaml: Basic OCaml 17 Wednesday, Jan 21 Friday, Jan 23 Sunday, Jan 25
MP2 OCaml: Pattern Matching and Recursion 54 (extra 8) Wednesday, Jan 21 Tuesday, Jan 27 Thursday, Jan 29
MP3 OCaml: Abstract Syntax Trees 50 (extra 11) Tuesday, Jan 27 Tuesday, Feb 3 Thursday, Feb 5
MP4 ocamllex: MiniJava 50 (extra 5) Wednesday, Feb 4 Tuesday, Feb 10 Thursday, Feb 12
MP5 A Recursive Descent Parser for MiniJava 40 Tuesday, Feb 10 Tuesday, Feb 17 Thursday, Feb 19
MP6 A Bottom-up Parser for MiniJava 75 Tuesday, Feb 17 Tuesday, Feb 24 Thursday, Feb 26
MP7 Code Generation 50 (extra 10) Tuesday, Mar 3 Wednesday, Mar 11 Friday, Mar 13
MP8 APL 50 Tuesday, Mar 10 Tuesday, Mar 17 Thursday, Mar 19
MP9 Higher Order Functions 30 Thursday, Mar 19 Thursday, Apr 2 Saturday, Apr 4
MP10A More Fun with Higher Order Functions 15 Thursday, Apr 2 Tuesday, Apr 7 Wednesday, Apr 8, 5pm
MP10B Function Objects 15 Thursday, Apr 2 Tuesday, Apr 7 Thursday, Apr 9, 5pm
HW11 Proof Trees 50 Friday, Apr 10 Wednesday, Apr 15, in class Friday, Apr 17, in class
HW12 Type-checking and Operational Semantics 50 Thursday, Apr 16 Wednesday, Apr 22, in class Friday, Apr 24, in class
HW13 Hoare Logic 50 Friday, Apr 24 Wednesday, Apr 29, in class Friday, May 1, in class

Hand Written Assignments for Spring 2008
Topic: Issued: Due at 2:00pm CT on: Automatic extension
(with 20% penalty)
until 2:00pm CT on:

Note
The late penalty is 20% of the total number of points possible on the base part of the assignment, plus 20% of the total points possible on the extra credit, if you attempt the extra credit. It is not 20% of the number of points your earn.

Guide for Doing MPs
A guide for how to attack an MP:
  1. Download mpXgrader.tar.gz and untar it (tar xzf mpXgrader.tar.gz where X is the number of the MP). This will create an mpXgrader directory. Go into that directory.
  2. Copy the mpX-skeleton.ml file as mpX.ml. To make sure you have all the necessary pieces, start by executing make. This will create the grader executable. Run the executable (./grader). Examine the failing test cases for places where errors produced by your code. At this point, everything should compile, but the score will be 0.
  3. Read and understand the problem for the handout that you wish to begin working on. (Usually, working from top to bottom makes most sense.) There is a tests file in this directory. This is an important file containing the an incomplete set of test cases; you'll want to add more cases to test your code more thoroughly. Reread the problem from the handout, examining any sample output given. Open the tests file in the mpXgrader directory. Find the test cases given for that problem. Add your own test cases by following the same pattern as of the existing test cases. Try to get a good coverage of your function's behaviour. You should even try to have enough cases to guarantee that you will catch any errors. (This is not always possible, but a desirable goal.) And yes, test cases should be written even before starting the implementation of your function. This is a good software development practice.
  4. If necessary, reread the stament of the problem once more. Place your code for the solution in mpX.ml, replacing the stub found there for it. Implement your function. Try to do this in a step-wise fashion. When you think you have a solution (or enough of a part of one to compile and be worth testing), save you work and execute make and the ./grader again. Examine the passing and failing test cases again. Each failure is an instance where your code failed to give the right output for the given input, and you will need to examine your code to figure out why. When you are finished making a round of corrections, run make, followed by ./grader again. Continue until you find no more errors.
  5. When your code no longer generates any errors for the problem on which you were working, return to steps 3) and 4) to proceed with the next problem you wish to solve, until there are no more problems to be solved.
Interactive Debugging
In addition to running "make" and "grader", you probably want to test your code interactively at the top level:
  1. Enter the directory with your source file.
  2. Type ocaml at the command line.
  3. Type #load "mpXcommon.cmo";; at the OCaml prompt, where X is the number of the assignment (this loads in the common stuff that we give you by defualt).
  4. Type #use "mpX.ml";; at the OCaml prompt, where X is the number of the assignment. This loads in your code, and adds the functions you have defined to the identifiers recognized at top level.
  5. Type in commands followed by ';;' at the OCaml prompt to test your code interactively. Anything that you can do in a code file, you can do interactively. For example, you can define identifiers using 'let x = ...', etc...