Draft of assign 6.

Author: dvanhorn

www/assignments.scrbl

@@ -8,7 +8,7 @@
 @include-section{assignments/3.scrbl}
 @include-section{assignments/4.scrbl}
 @include-section{assignments/5.scrbl}
-@;include-section{assignments/6.scrbl}
+@include-section{assignments/6.scrbl}
 @;;include-section{assignments/7.scrbl}
 
 @;{assignment 8: quote in general, and quasiquote}

www/assignments/6.scrbl

@@ -1,88 +1,67 @@
 #lang scribble/manual
-@title[#:tag "Assignment 6" #:style 'unnumbered]{Assignment 6: Syntax Checking}
+@title[#:tag "Assignment 6" #:style 'unnumbered]{Assignment 6: Squid Game}
 
 @(require (for-label (except-in racket ...)))
 @(require "../notes/ev.rkt"
           "../notes/utils.rkt")
 
-@bold{Due: Thursday, May 5th, 11:59PM EDT}
+@bold{Due: Monday, Nov 13, 11:59PM EDT}
 
-The goal of this assignment is to add syntax checking to our compiler.
+The goal of this assignment is to hone your testing skills.
 
-You are given a repository with a starter compiler similar to the
-@seclink["Mountebank"]{Mountebank} language we studied in class.  You
-are tasked with:
+@section[#:tag-prefix "a6-" #:style 'unnumbered #:tag "game"]{The Game}
 
-@itemlist[
+The autograder for this assignment includes a collection of compilers
+that implement @secref["Assignment 5"] and a reference interpreter.
 
-@item{implementing compile-time syntax checking.}
+You must submit a list of programs that will be run on each compiler.
+If a compiler produces a result that is inconsistent with the
+reference interpreter, it is eliminated.  Your goal is to construct
+a set of test programs that eliminate the largest number of compilers.
+The player that eliminates the largest number of compilers, wins.
 
-]
+When you submit, choose a name to display on the leaderboard.  It does
+not need to be your real name, but please keep it appropriate for this
+setting.
 
-@section[#:tag-prefix "a6-" #:style 'unnumbered #:tag "checking"]{Syntax Checking}
+After submitting, click "Leaderboard" to see the latest standings.
 
+Initially there will be around 30 compilers included, but more will be
+added before the deadline.
 
-Up until now, we've written our compiler assuming that programs are
-well-formed, but there has never been any code that actually checks
-this assumption.  The assumptions go beyond the properties checked
-during parsing.  For example, our parser will happily accept a program
-like @racket[(lambda (x x) x)], and the compiler will emit code for it
-even though this is not a well-formed program.
+We reserve the right to update the reference interpreter.
 
-The idea of this assignment is to implement a function, defined in
-@tt{check-syntax.rkt}:
+Submissions should be written using the following format:
 
-@#reader scribble/comment-reader
-(racketblock
-;; Prog -> Prog
-(define (check-syntax p) ...)
-)
+@codeblock|{
+#lang info
+(define programs
+  (list
+    '[ (add1 1) ]
+    '[ (write-byte 97) ]
+    '[ (define (f x) (+ x x)) (f 5) ]))
+}|
 
-If the program is well-formed, it should behave like the identity
-function, returning the same program it was given as input.  On
-ill-formed programs, it should signal an error using @racket[error].
+If you'd like to include a program reads data from the standard input
+port, you can add an enties which are two-element lists, where the first
+element is a string that is used as the contents of the input port
+and the second element is the program, for example:
 
-For the purposes of this assignment, the quality of the error messages
-doesn't matter, although in real programming language implementations,
-good error messages are crucial.
+@codeblock|{
+#lang info
+(define programs
+  (list
+    '[ (add1 1) ]
+    '[ (write-byte 97) ]
+    (list "abc" '[ (read-byte) ])
+    '[ (define (f x) (+ x x)) (f 5) ]))
+}|
 
-Here are the properties that should be checked of each program:
 
-@itemlist[
+You may add as many programs as you'd like to the file.
 
-@item{Programs are @emph{closed}; there are no unbound variables in
-the program.}
-
-@item{Every @racket[define]d function should have a distinct name.}
-
-@item{Every function parameter should be distinct from the other
-parameters of that function.}
-
-@item{Every function's name should be distinct from all of its
-parameters' names.}
-
-@item{Every function name and variable should not clash with any of
-the keywords of our language, e.g. @racket[lambda], @racket[if], etc.
-(Note this is not a restriction Racket puts on programs; the following
-is a perfectly reasonable expression: @racket[(λ (λ) λ)], but we'll
-consider this a syntax error.)}
-
-@item{Every pattern variable in a pattern should be distinct.  (Racket
-also allows this, but it has a complicated run-time semantics which we
-don't implement so instead we just rule out these programs.)}
-
-]
-
-The starter code calls @racket[check-syntax] in both
-@tt{compile-file.rkt} and @tt{interp-file.rkt}.  The definition of
-@racket[check-syntax] is stubbed out in @tt{check-syntax.rkt}.
-
-There are tests included in @tt{test/check-syntax.rkt}. You can also use this file 
-to write your own tests for debugging.
 
 @section[#:tag-prefix "a6-" #:style 'unnumbered]{Submitting}
 
-You should submit on Gradescope. You should submit a zip file that has
-exactly the same structure that the stub contains. We will only use
-the @tt{check-syntax.rkt} files for grading, so make sure all your
-work is contained there!
+You should submit on Gradescope. You should a single file named
+@tt{info.rkt} that conforms to the format shown above.