thelittleschemer代码第十章.docVIP

#lang racket (define atom? (lambda(x) (and (not(pair? x)) (not (null? x))))) (define build (lambda (s1 s2) (cond (else(cons s1 (cons s2 (quote ()))))))) (define new-entry build) ;给Build函数起新名字 (define lookup-in-entry-help (lambda (name names values entry-f) (cond ((null? names) (entry-f name)) ((eq? (car names) name) (car values)) (else(lookup-in-entry-help name (cdr names) (cdr values) entry-f))))) (define lookup-in-entry (lambda (name entry entry-f) (lookup-in-entry-help name (first entry) (second entry) entry-f))) ;(lookup-in-entry entree ((appetizer entree beverage) (food tastes good))) (define extend-table cons) (define lookup-in-table (lambda (name table table-f) (cond ((null? table) (table-f name)) (else (lookup-in-entry name (car table) (lambda (name) (lookup-in-table name (cdr table) table-f))))))) (define initial-table (lambda (name) (car (quote ())))) (define meaning (lambda (e table ) ((expression-to-action e) e table))) (define value (lambda (e) (meaning e (quote())))) (define *identifier (lambda (e table) (lookup-in-table e table initial-table))) (define *const (lambda (e table) (cond ((number? e ) e) ((eq? e #t ) #t) ((eq? e #f) #f) (else (build (quote primitive ) e))))) (define *lambad (lambda (e table) (build(quote non-primitive) (cons table (cdr e))))) (define else? (lambda(x) (cond ((atom? x) (eq? x (quote else))) (else #f)))) (define question-of first) (define answer-of second) (define *cond (lambda(e table)