anchor.diff:    ;; this function takes a suffix to be consumed
     ;; and a node to start from and the current stem
     (labels ((c-suffix (iadfa current-suffix node profile)
  -		     (if (eq? 1 (length current-suffix))
  +		     (if (eq 1 (length current-suffix))
   			 (cons node (reverse current-suffix))
   		       (let ((next-node (ancestror-transition iadfa node (car current-suffix) (car profile))))
  -			 (if (or (not next-node) (eq? next-node (fsa-start-node (iadfa-fsa iadfa))))
  +			 (if (or (not next-node) (eq next-node (fsa-start-node (iadfa-fsa iadfa))))
   			     (cons node (reverse current-suffix))
   			   (c-suffix iadfa
   				     (cdr current-suffix)
  
positive.code:   fsa
    final)
  
  (defun delete-branch (iadfa stem-start-node stem-start-input stem-end-node)
    (remove-ancestror-to-childs iadfa stem-end-node)
    (node-remove-dsts-for-input stem-start-node stem-start-input))
  
  (defun common-prefix (iadfa word node)
    (let ((stem '())
  
negative.code:        iadfa))
      (iadfa-fsa iadfa)))
  
  
  
  