Date: Tue, 17 Oct 1995 14:35:38 -0700 (PDT)
From: Matt Bell <mattb@leland.Stanford.EDU>
To: zelenski@cs.Stanford.EDU
Subject: OOPS: Assignment Grammar 

In my last E-mail, I accidentally sent the old copy of the assignment 
grammar in place of the finished one.  Sorry.  The new one is included 
with this E-mail. 

- Matt Bell

------------------------------------------------------------------------
The Assignment grammar.  By Matt Bell

{

<start>

CS 107 Assignment <assignumber> :  

    In this assignment, you will have to <create> a <type> <datastructure> that can store <data> and perform <function> functions on each element.  It utilizes the <type> <datastructure> ADT that you <created> back in assignment <assignumber2> .  You will have to <do> your own <check> checking.  A <quality> test program is included to help you <kill> any bugs you might have.  <as-you-know> , this assignment is very <hard> , so start early.  



Due <date> <time> .   

Submit the assignment <submission> to your section leader's <relative> .



Today's secret message: <secretmessage>



- Created by Matt Bell ;

}



{

<as-you-know>

As you know  ;

As you might have guessed  ;

Obviously ;

}



{

<kill>

exterminate ;

lick ;

chomp down on ;

}



{

<do>

perform ;

run ;

do ;

}





{

<assignumber>

2b (or not) ;

37.124672 ;

1cooldude ;

0 ;

0x000003c ;

0x0000107 ;

106x ;

}



{

<assignumber2>

1.01 ;

-1 ;

0x0000001 ;

zero ;

}





{

<create>

design ;

implement ; 

construct ;

create ;

program ;

work on ;

}





{

<created>

designed ;

implemented ; 

constructed ;

created ;

programmed ;

worked on ;

}



{

<type>

dynamically allocated ;

portable ;

general purpose ;

polymorphic ;

bug free ;

multi-dimensional ;

mutually recursive ;

}



{

<date>

Friday, the 13th of October ;

tomorrow ;

July 4, 1776 ;

Jan 1, 2000 ;

on your birthday ;

}



{

<datastructure>

hash table ;

doubly linked list ;

triply linked list ;

binary tree ;

macro table ;

parse table ;

}



{

<data>

compile-time bugs ;

video compression algorithms ;

function optimization algorithms ;

dirty jokes ;

derisive comments about Cal ;

test cheat notes ;

CS 107 grades (Oh Yes!) ;

pointers to <data> ;

pointers to pointers to <data> ;

arrays of pointers to <data> ;

pointers to pointers to pointers to <data> ;

arrays of <data> ;

<datastructure> 's of <data> ;

}



{

<function>

parsing ;

sorting ;

compression ;

holistic evaluation ;

analysis ;

searching ;

}



{

<check>

range ;

error ;

bug ;

patience limit ;

randomness ;

efficiency ;

style ;

}



{

<quality>

worthless ;

functionally appropriate ;

bug-ridden ;

terribly inefficient ;

painstakingly tested ;

trustworthy ;

}



{

<hard>

difficult ;

worthwhile ;

important to your grade ;

tough ;

lengthy ;

pointless ;

critical to the survival of mankind ;

detrimental to your social life ;

time consuming ;

detrimental to your health ;

}



{

<time>

at 2:00 in the morning ;

at 3:24 and 12.122 seconds ;

when you get up in the morning ;

just before you go to bed ;

at midnight ;

}



{

<submission>

electronically ;

by UPS overnight mail ;

telepathically ;

via the Pony Express ;

using a coherent positron beam ;

in Morse Code ;

in Spanish ;

}



{

<relative>

mother's <relative> ;

father's <relative> ;

sister's <relative> ;

brother's <relative> ;

uncle's <relative> ;

son's <relative> ;

daughter's <relative> ;

nephew's <relative> ;

dog ;

iguana ;

hamster ;

former roommate ;

}







{

<secretmessage>

This assignment will self destruct in 10 seconds. ;

Memorize this message, then eat it. ;

What really happens in the secret offices on the 11th floor of Hoover Tower? ;

If you are sitting at adelbert11 in Sweet Hall, does the sun shine on the back left side of your head when it is setting or rising?  If you can't answer this question, you should put more effort into the assignment. ; 

I am vary sick of people who are too lazey to proofread they're assingments before tunring them in. ;

}