From: Jim Pryor Date: Tue, 30 Nov 2010 13:47:54 +0000 (-0500) Subject: ass8 tweaks X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=57e4fb87e24913780f5ed25f975986775adc068a ass8 tweaks Signed-off-by: Jim Pryor --- diff --git a/assignment8.mdwn b/assignment8.mdwn index a1e0140c..a66c26ae 100644 --- a/assignment8.mdwn +++ b/assignment8.mdwn @@ -1,4 +1,4 @@ -1. Complete the definitions of `move_botleft` and `move_right_or_up` from the same-fringe solution in the [[week11]] notes. Test your attempts against some example trees to see if the resulting `make_fringe_enumerator` and `same_fringe` functions work as expected. +1. Complete the definitions of `move_botleft` and `move_right_or_up` from the same-fringe solution in the [[week11]] notes. **Test your attempts** against some example trees to see if the resulting `make_fringe_enumerator` and `same_fringe` functions work as expected. Show us some of your tests. type 'a tree = Leaf of 'a | Node of ('a tree * 'a tree) @@ -64,7 +64,7 @@ ;; -2. Here's another implementation of the same-fringe function, in Scheme. It's taken from . It uses thunks to delay the evaluation of code that computes the tail of a list of a tree's fringe. It also involves passing continuations as arguments. Your assignment is to fill in the blanks in the code, and also to supply comments to the code, to explain what every significant piece is doing. +2. Here's another implementation of the same-fringe function, in Scheme. It's taken from . It uses thunks to delay the evaluation of code that computes the tail of a list of a tree's fringe. It also involves passing continuations as arguments. Your assignment is to fill in the blanks in the code, **and also to supply comments to the code,** to explain what every significant piece is doing. Don't forget to supply the comments, this is an important part of the assignment. This code uses Scheme's `cond` construct. That works like this;