Exercise 4.33.  Ben Bitdiddle tests the lazy list implementation given 
above by evaluating the expression

(car '(a b c))

To his surprise, this produces an error. After some thought, he realizes 
that the ``lists'' obtained by reading in quoted expressions are 
different from the lists manipulated by the new definitions of cons, 
car, and cdr. Modify the evaluator's treatment of quoted expressions so 
that quoted lists typed at the driver loop will produce true lazy lists.

————————————————————————————————————————————————————————————————————————

Currently a quotation is represented as a tagged list, and the contents 
are obtained by taking the cdr of this list.  This only works so long as 
the list representation is the same between the meta-circular evaluator 
and the underlying Scheme implementation.

(define (text-of-quotation exp) (cadr exp))

To fix this we can redefine text-of-quotation to translate pairs in the 
underlying scheme into pairs in the procedure representation.

(define (text-of-quotation exp) (fix-pairs (cadr exp)))

(define (fix-pairs x)
  (if (pair? x)
      (proc-cons (fix-pairs (car x)) (fix-pairs (cdr x)))
      x))

Where proc-cons is defined as the new cons implementation given in the 
text.