Lecture 10 Notes

4 871 2 6553 4320 36 this

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: u could modify to print out more information when a test fails.     C   !C  C ¡£ A 4    9 ¤    ¢¢ ©¢   ¡           " ¦ §   © ¡     ¦§ ¡ A ¡ ¤¢© 1¢ ¢¢¢ ¡ ¤¢© ¢ ¢¢¢  ¡ ¡ ¤¢© ¢ ¢¢¢  ¡ ¡ § 4¡ ¢C   4    ¥ ¨¥  ¡ 5©0  $£  ¡ ¤¦ ¤ 4 ¡¦ §© § §¦¤¢¨ & ¡ 5¡ 0   9 ¡ 4 ¤ ¤¥"¡ 4 " ¤  Here’s what happens when we run : 1.11 Trees [Note: This is based on Section 2.4 in EOPL3.] We will do a lot a manipulation of trees. For this we’ve created some extensions of Scheme. For PLT Scheme, these are loaded by selecting the EOPL language level. To see how this is done, consider a definition of binary trees  Int Symbol Bintree Bintree  Bintree :: But we would like to manipulate trees independent of their representation as Scheme data structures. For this we need an interface. What should the interface look l...
View Full Document

This document was uploaded on 03/17/2014 for the course CSG 111 at Northeastern.

Ask a homework question - tutors are online