This homework assignment is also available in PDF.
Assigned: Friday, February 23, 2007
Due: Tuesday, February 27, 2007
Summary: In this assignment, you will further explore the evaluation of expressions in Scheme.
Purposes: To reinforce Scheme's evaluation strategy. To give you experience writing recursive procedures. To raise the question of how to implement a language.
Expected Time: One to two hours.
Collaboration: You may work in a group of any size between two and four, inclusive. You may consult others outside your group, provided you cite those others. You need only submit one assignment per group.
Submitting: Email me your work, using a subject of CSC151 Homework 8.
Warning: So that this exercise is a learning assignment for everyone, I may spend class time publicly critiquing your work.
As you may recall from our discussion in class, Scheme uses a straightforward strategy for evaluating most expressions:
You may have also observed that procedure applications look remarkably like lists. For example,
(+ 2 3)
apply the procedure + to the values 2 and 3 or
it may be a list with elements
(* (+ 2 a) (+ 3 b))
might be the product of two sums, or it may be a list with two sublists.
The close ties between lists and general expressions is intentional. In fact, behind the scenes, Scheme represents expressions as lists and has an internal procedure that evaluates them using the algorithm above.
In this assignment, you will build a simple version of that algorithm.
Consider a Scheme-like language for building strings, which we'll call Streme. In Streme, the basic values are all strings (things surrounded by quotation marks). The valid operations on strings are
(first str), which extracts the first letter of str as a string;
(last str), which extracts the last letter of str as a string;
(remove-first str), which returns a string that corresponds to all but the first letter of str;
(remove-last str), which returns a string that corresponds to all but the last letter of str;
(reverse str), which reverses the letters in the string;
(alphabetically-first str1 str2), which returns the alphabetically first of str1 and str2;
(longer-string str1 str2, which returns the longer of the two strings; and
(join str1 str2), which joins the two strings together into a new string.
Your goal in this assignment is to write three related procedures,
(streme-apply-unary unary-function str), and
(streme-apply-binary binary-function str1 str2),
that we can use to evaluate Streme expressions.
streme-eval procedure should evaluate its argument using
a modified version of the technique discussed above. (That is, determine
str-exp is a string or a procedure application.
In the latter case, evaluate the arguments and then apply the procedure.)
streme-eval should look something like the
(define streme-eval (lambda (str-exp) (cond ((string? str-exp) str-exp) ((procedure-call-with-one-parameter? str-exp) (streme-apply-unary (car str-exp) (streme-eval (cadr str-exp)))) ((procedure-call-with-two-parameters? str-exp) ...) (else #f))))
You will, of course, have to fill in the ellipses and the definitions of the new predicates. Note that the correspondence between lists and expressions suggests that a procedure call with one parameter is simply a list of two elements (the procedure and the expression to which to apply the procedure).
(define procedure-call-with-one-parameter? (lambda (str-exp) (and (list? str-exp) (= (length str-exp) 2))))
As the code above sugests, the
procedures should give the instructions necessary to apply
the given procedure to one string or two strings, respectively.
streme-apply-unary should look something like the
(define streme-apply-unary (lambda (proc str) (cond ((eq? proc 'first) (substring str 0 1)) ... (else #f))))
Here are some sample sessions with our Streme interpreter.
> (define sample1 (list 'first "Hello")) > sample1 (first "Hello") > (streme-eval sample1) "H" > (define sample2 (list 'remove-first (list 'remove-first "Hello"))) > sample2 (remove-first (remove-first "Hello")) > (streme-eval sample2) "llo" > (define sample3 (list 'remove-first (list 'remove-last "Hello"))) > sample3 (remove-first (remove-last "Hello")) > (streme-eval sample3) "ell" > (define sample4 (list 'join (list 'first "Joy") (list 'remove-first "Hello"))) > sample4 (join (first "Joy") (remove-first "Hello")) > (streme-eval sample4) "Jello" > (define sample5 '(join (reverse "Hello") (remove-first "Hello"))) > sample5 (join (reverse "Hello") (remove-first "Hello")) > (streme-eval sample5) "olleHello"
As the last example suggests, when testing it is okay if you build your
expressions using quote. (In general, I prefer that you not build
lists with quote, but here, it's clearly more natural.) Just be sure not
to use quotes anywhere within the expressions.
This problem is a bit bigger than the other work you've done so far, but it is managable if you break it up into pieces.
We'd recommend that you try implementing the procedures in
the order given above
As has been the case in all recent assignments, my primary evaluation criteria will be correctness, layout, and elegance.
Early September 2006 [Samuel A. Rebelsky]
Friday, 15 September 2006 [Samuel A. Rebelsky]
Monday, 18 September 2006 [Samuel A. Rebelsky]
Tuesday, 19 September 2006 [Samuel A. Rebelsky]
Wednesday, 20 September 2006 [Samuel A. Rebelsky]
Thursday, 21 September 2006 [Samuel A. Rebelsky]
Friday, 23 February 2007 [Samuel A. Rebelsky]
I usually create these pages
on the fly, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Thu Sep 13 20:54:10 2007.
The source to the document was last modified on Fri Feb 23 11:36:56 2007.
This document may be found at
You may wish to validate this document's HTML ; ;Samuel A. Rebelsky, email@example.com
http://creativecommons.org/licenses/by-nc/2.5/or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.