X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment4.mdwn;h=9b7ec2c028622dc92e17dced54403aa6043b8896;hp=12c1ef2a213e195cd9f88066baf9e8e53e9d5c46;hb=9b5f91f462e9f64944ce2aa95ab3f8d30371a469;hpb=0a79dd27b99169648a1f03ec0b8847a1c5b822fc diff --git a/assignment4.mdwn b/assignment4.mdwn index 12c1ef2a..9b7ec2c0 100644 --- a/assignment4.mdwn +++ b/assignment4.mdwn @@ -64,10 +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. (You just programmed this above.) +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. +Write the fringe-enumeration function. It should work on the +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.)