CS 412/413 Assignments

CS 412/413
Introduction to Compilers
Spring 2002

The first table gives a short description of the benchmarks submitted by each group for the final project presentation. You can find the source code for these benchmarks at \\goose\courses\cs412-sp02\tests\groups.

Benchmarks Submitted by Groups
Benchmark	Lines of Code	Description	Problem size
all	1102	Concatenation of all test programs used in all assignments	no input
bf prime	264 1380	A compiler for a an 8-instruction Turing-complete language called BF. The compiler translates a BF specification into an IC program. Both the compiler (bfc.ic, bfo.ic) and one of the generated files (prime.ic) were tested.	cat.b prime.b jbquine.b
blackjack	412	Gambling with the compiler	a file with input commands
determinant	125	Computes the determinant of a matrix n x n. Checks it for a matrix filled with numbers from Pascal's triangle. Hence determinant must be 1.	n = 10
queen	272	Computes the number of solutions for the n-queen problem on an n x n board and prints one solution.	n = 10
testname	100	Test program designed to check name conflicts across different modules.	no inputs
testopt	70	Simple test program designed to check optimizations.	no inputs
tree	259	Implements a tree structure using three arrays of integers: one for data, one for the right pointers, and one for the left pointers. The program inserts and removes elements in the tree.	no inputs

The tables below show the complete running times (in seconds) for the above benchmarks. To preserve anonimity, the groups were shuffled and renamed.
The tests were performed on a Pentium 4 at 1.7GHz, under the Cygwin environment.
For each benchmark, the compilers were run without optimizations (base) and with all optimizations turned on (optimized). Compilers and tested programs were forced to terminate after a timeout period of 3 minutes. In case of error, the corresponding entry shows the reason why the program failed: