anchor.diff:                    (0)
                     nil))) ;; abc
           )
  -    (all-results test1)
  +    ;;(create-str (find-least (all-results test0)))
  +    (smallest-from-leaf test1)
       ))
  -
  
positive.code:   (let ((result '())
          (left-re (all-results (cadr nodes)))
          (right-re (all-results (caddr nodes))))
      ;;(format t "~a;~a~%" left-re right-re)
      (if (and (not left-re) (not right-re)) (return-from all-results (list (list (car nodes)))))
      (setf result
            (append result
  
negative.code:     result
      ))
  
  (defun find-least (ll)
    (let ((reverse-ll (mapcar #'reverse ll)))
      (labels ((compare-inner (a b)
                 (do ((aa a (cdr aa))
                      (bb b (cdr bb)))
                     ((or (not aa) (not bb))
                      (return (if (not aa)
                                  a
                                  b)))
                   (cond ((< (car aa) (car bb)) (return-from compare-inner a))
                         ((> (car aa) (car bb)) (return-from compare-inner b))))
                 ))
        (reduce #'compare-inner reverse-ll))
      ))
  
  (defun create-str (l)
    (coerce (mapcar (lambda (x) (code-char (+ 97 x))) l) 'string))
  
  (defun main ()
    (let ((test0 '(0
  