exer 11.2.4

[mike]

Wow ! this exercise was difficult, my brain is fryed! Since a deepl-
list may contain list which contains list (i will assume
that the list has symbols as elements as well). one had to look
at the (first l) and the (rest l). here is the code:
(define (refined-depth l)
(cond
((empty? l) 0)
((symbol? (first l)) (add1 (refined-depth (rest l))))
(else
(+ (add1 (refined-depth (first l))) (refined-depth (rest l))))))

this problem was definitely a curve ball.

[Grant Rettke]

Haven't reached it yet... can't wait!