I laughed when it occurred to me that, since their parser only accepts variables named after a character from a play, Shakespeare programs are limited by having a finite number of variables and storage, but laughed even harder when reading their solution to this problem, stacks.
Each variable is a stack that can push and pop, with no error handling:
"Trying to pop when the stack is empty is a sure sign that the author has not yet perfected her storytelling skills, and will severly disappoint the runtime system."
Fantastic. All the user-friendliness of assembly indeed.
I'm still laughing hard! These guys deserve to graduate right now ... or maybe a perpetual grant to stay in school and write such assignments :D Excellente!
This is amazing! I took a Shakespeare class in college, and it would have been awesome to have given my instructor some source code for assignments. :)
[+] [-] tjarratt|16 years ago|reply
Each variable is a stack that can push and pop, with no error handling:
"Trying to pop when the stack is empty is a sure sign that the author has not yet perfected her storytelling skills, and will severly disappoint the runtime system."
Fantastic. All the user-friendliness of assembly indeed.
[+] [-] mkramlich|16 years ago|reply
[+] [-] alain94040|16 years ago|reply
[+] [-] makmanalp|16 years ago|reply
[+] [-] aufreak2|16 years ago|reply
Edit: Just noticed 2001
[+] [-] ricaurte|16 years ago|reply
[+] [-] elblanco|16 years ago|reply
[+] [-] nitrogen|16 years ago|reply
[+] [-] pigbucket|16 years ago|reply