From af912bf1c2bf575fe417d96b4b1d1cd900ae766f Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Mon, 4 Oct 2010 12:11:51 -0400 Subject: [PATCH] tweak assignment4 Signed-off-by: Jim Pryor --- assignment4.mdwn | 11 ++++++----- 1 file changed, 6 insertions(+), 5 deletions(-) diff --git a/assignment4.mdwn b/assignment4.mdwn index 6a528a23..9b7ec2c0 100644 --- a/assignment4.mdwn +++ b/assignment4.mdwn @@ -64,14 +64,15 @@ return later in the term to the problem of determining when two trees have the same fringe. For now, one straightforward way to determine this would be: enumerate the fringe of the first tree. That gives you a list. Enumerate the fringe of the second tree. That also gives you a list. Then compare the two -lists to see if they're equal. +lists to see if they're equal. Write the fringe-enumeration function. It should work on the -implementation of trees you designed in the previous step, and it -should make use of the list comparison function you wrote for question -2. Thus you'll have to make sure you only use Church numerals as the -labels of your leaves, though nothing enforces this self-discipline. +implementation of trees you designed in the previous step. +Then combine this with the list comparison function you wrote for question 2, +to yield a same-fringe detector. (To use your list comparison function, you'll +have to make sure you only use Church numerals as the labels of your leaves, +though nothing enforces this self-discipline.) -- 2.11.0