Sara Sprenkle's CISC 672 Page

Course web pages: CISC 672 | Blog
Office Hours: Smith 102, Monday 3-5 p.m. and by appointment

Announcements

PA4 has been graded. The test cases I used are below so that you can see why I deducted points.
PA3 has been graded. The test cases I used are below so that you can see why I deducted points.
Programs written by you for PA1 are posted below.
PA2 has been graded. The test cases I used are below, so you can see why points were deducted.
Sign up for your demos for PA1 on the Course Project Manager
Meet me in Smith 447 for demos.
For the demo, we will run the code that you submitted to me on my account on stimpy.
Use an RSS reader/aggregator to keep posted on updates to the blog.

Assignments

PA1: Due September 5
PA2: Due September 13
PA3: Due September 28, October 5
Parsing Homework: Due October 16
PA4: Due Nov 6
PA5: Due Dec 5

Tests for PA5

You can view the test cases for PA4 in the directory or download them in a tar.gz file.

Tests for PA4

You can view the test cases for PA4 in the directory or download them in a tar.gz file.

Tests for PA3

I have collected the tests that I used to grade PA3. You can view them in this directory or download the test files as a tar.gz file.

Tests for PA2

I have collected the tests that I used to grade PA2. You can view them in this directory or download the test files as a tar.gz file.

Tests Collected from PA1

For the tests below, I wrote a little about the unique feature(s) that each program tests; otherwise, the programs test a lot of different Cool features. I will also note if the program does not compile. You can always compare the results from your compiler to the results of the given coolc compiler.

binarysearchtree.cl - recursion
bst.cl - another binary search tree implementation, with recursion
bsd.cl - yet another binary search tree implementation, with recursion
bubblesort.cl
calc.cl, a simple calculator, with multiple function calls, in line, e.g., x().y().z();
calc_with_stack.cl, requires atoi.cl
case.cl, testing the case structure
circular_inher.cl, testing circular inheritance (should fail)
date.cl
derivative.cl
dispatch.cl: everything works if prints "Passed!"
doubledefinition.cl-- needs main.cl, should fail
guesstheanimal.cl - recursion
features.cl - Test parameter passing (by reference or by value), cloning vs. pointer for assignment
inher1.cl - recursion, function calls as parameters, case, static dispatch, scoping (with let statement)
inher2.cl - if uncomment big inheritance hierarchy, spim segfaults when running on given coolc compiler-generated code; uncomment other parts to test recursive inheritance or inheriting from a basic type
inheritbool.cl -- needs main.cl, should fail
inheritint.cl -- needs main.cl, should fail
inheritself.cl -- needs main.cl, should fail
inheritselftype.cl -- needs main.cl, should fail
inheritstring.cl -- needs main.cl, should fail
inheritundefined.cl -- needs main.cl, should fail
linkedlist.cl
overridemismatch.cl -- tests that the overridden function does not match the superclass's function -- needs main.cl, should fail
precedence.cl - tests precedence, should all print True.
scoping.cl - tests scoping rules

A tar/gzipped file of all tests from PA1