next up previous
Next: Preliminaries Up: Compiler Theory: Assignment 2 Previous: Compiler Theory: Assignment 2

Guidelines

Date of postage.
Tuesday, February 17, 2004.
Normal date for submission.
Tuesday, March 16, 2004 (no penalties).
Last date for submission.
Sunday, March 21, 2004 (late penalties apply from Monday 15).
Due format.
The assignment should be returned to the instructor by email. Your submission will have the form of a UNIX archive created with the UNIX command tar. This archive will have a structure similar to those of the example archives available on the course web site. More precisely, a src directory will contain your flex/lex and yacc source programs, a test directory will contain your test files, a Makefile will define the targets and a README will explain these targets. Moreover, your answers to the assignment questions (that are not computer programs) will be made in a file In addition, you could have a bin directory for binaries (as in the course example archives) and a ps directory for postscript versions of computer programs (this is convenient to print them!). The computer programs of this assignment are all input files for the flex/lex and yacc program, together with C program or header files. The preferred version of flex/lex is flex version 2.5.4.

Your Makefile must work under Linux (with a recent distribution) or under a UNIX system of the GAUL network. You can reuse the Makefile of the archive yacc.tar.gz from the course web site. Note that this Makefile was developed with bash under Red Hat 7.3 (Linux) and using GCC version 2.96.

Your README must specify which UNIX system you are using (Linux or SunOS) and which shell (command language interpreter) you are using (tcsh or bash). For the compilation options of flex/lex and yacc please refer to the Makefile of the archive yacc.tar.gz.

Late penalties.
See the course outlines.
Collaboration.
You are expected to do this assignment on your own without assistance from anyone else in the class.
Marking.
This assignment will be marked out of 40. The allocation of marks is shared equally between the four activities described below.


next up previous
Next: Preliminaries Up: Compiler Theory: Assignment 2 Previous: Compiler Theory: Assignment 2
Marc Moreno Maza
2004-12-01