Lecture 10 Notes

to replace 4 d 2 5 d 4

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: ned data, the structure of the program should be patterned after the structure of the data. More precisely: Write one procedure for each nonterminal in the grammar. The procedure will be responsible for handling the data corresponding to that nonterminal. § ¤  In each procedure, you will have one line for each production corresponding to that nonterminal. You may have additional case structure, but this will get you started on the right foot.     ! 2¡ §©§ and Output: a list similar to of . , and an list but with all occurrences of ¤ ¤ Input: Two symbols:  !  Procedure replaced by instances 2¡ §©§ Example:  ¥        £        ¥       £ £       But wait: need to be more precise about what kind of lists are possible inputs. Let’s write a grammar to describe these nested lists of symbols: Definition 7 (s-list, s-exp) ¥ ¤ £¢ S-exp Symbol  S-list :: S-exp :: S-list An s-list is a list of s-exps, and an s-exp is either an s-list or...
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