Lecture 4 Notes

example 19 here is a more

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: £ ¡   £  ¡ © ¤¦¢&¡ £ ¢  £ £  § ¦¢&¡ £  £  ¡ © ¤ &¡ £ §¤§   £  ¦¡¦ ¡ ¡ ¡ ¡ § § ¨¡ § §   § £ ¢ ¡£ £ ¡  ¡ ¦ £ § ¦ ¢&¡ £ ¥  £ £  ¦ ¢&¡ £ ¥  £ £  £¡ £ £ £ £ ¦ ¢&¡ £ §  &¡ £  ¦    ¦  ¡ © ¤¦¢&¡ £ " £  ¡ © ¡ £  ¢ £ ¦  ¢¡ £ The procedure first checks and . If is empty, then it makes no demands on , so the answer is . If is non-empty, but is empty, then requires something, but has nothing. So the answer is . Otherwise, we compare the names of the first variables declared by and . If they are the same, then their types must match, and we recur on the rest of both lists of declarations. If they are not to look for something that matches the same, then we recur on the cdr of the first declaration of . § ¢&¡ £ ¦  ¦  ¢&¡ £ ¦ ¢&¡ £  § ¦ ¢&¡ £  £ ¢ ¦  ¢&¡ £ §  &¡ £ ¦ ¦ ¢&¡ £  ¦¢&¡ £  §  &¡ £ ¦ § ¢&¡ £ ¦    § ¢¡ £ ¦  ¢ ¦  ¡ © ¤¦¢&¡ £ " £  ¦ ¢&¡ £  The procedure does the main work of comparing two sets of declarations. If and are two sets of declara...
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