Compiler Wars
During our exam timeslot (Monday, December 10, 2PM-5PM), we will be participating in compiler wars. Four of your compiler components will go head-to-head against those of your classmates. Testcases are provided by the author. In addition, you may introduce one of your own testcases to the mix in the hopes of breaking your peers' (but hopefully not your own) compilers.
The Competition.
In each phase of the competition, you will complete a full round robin sequence. You must compete with your challenger by determining whose compiler passes more of the testcases (which consist of the 51 given testcases combined with one testcase each provided by you and your competitor). In the event of a tie, the judges will then evaluate the cleanliness of the source code to determine a winner.
Other Awards.
You may nomiate your own compiler for the following awards. (You have the burden of proof!) The instructor, grad helpers, and your peers will vote to determine a winner. Depending on the number of competitors, you may not be able to vote for yourself.
- Best Overall Compiler : Nick
- Most Improved Compiler : Ravi
- Best Test Case : Nick
Useful Game Day Tools.
- Random 1-51 sequence generator for pruning the number of testcases to run (may be useful in the latter competitions). Note: 50=merge, 51=queens
|
