CST 8152 Compilers - Assignment #3 …continued from page one...
The deliverables for this assignment are as follows:
1. The four DFA diagrams -- three individual DFA and one merged DFA.
2. The merged Transition Table.
3. The fully documented source listing of your new C program (including your own .h files). Programming must follow the Algonquin standard guidelines.
4. A description of your testing strategy, possibly including sample input test file(s) showing the test cases you selected, and possibly including generated output for some of the input test files. Your task is to convince the reader that your program handles all forms of input correctly and without faulting.
1. The DFA and Transition Table are due at the start of your Lab time this week.
2. The remaining deliverables are due in the Ian Allen assignment box before 08:45am, Monday, February 10. Be prepared to demonstrate your working program.
Please fasten together firmly all parts of your assignment deliverables so that no parts will be lost. (An excellent strategy is to put all your deliverables, including the description of your testing methodology, into a labelled full-size brown envelope.)
Identify your assignments:
Make obvious on the outside of your assignment these four things (type or print clearly):
2. your student ID number,
3. your weekly Lab time and section number (011, 012, 013 or 014), and
4. the course number: CST8152.
Assignments are marked for clarity and simplicity as well as correctness. A clear program that doesn’t quite work but can be understood and fixed is more useful than a working program that can’t be modified because it is unreadable, incomprehensible, and consequently unmaintainable.
Late assignments are handled according to the policy given in the course outline.