anchor.diff:  
   ;;; parse trees
   (defclass function-form (form) ())
  +(defclass complete-function-form (form complete-form-mixin) ())
  +(defclass incomplete-function-form (form incomplete-form-mixin) ())
   
   (define-parser-state |#' | (form-may-follow) ())
   (define-parser-state |#' form | (lexer-toplevel-state parser-state) ())
   
   (define-new-lisp-state (form-may-follow function-lexeme) |#' |)
  -(define-new-lisp-state (|#' | form) |#' form |)
  +(define-new-lisp-state (|#' | complete-form-mixin) |#' form |)
   (define-new-lisp-state (|#' | comment) |#' |)
   
   ;;; reduce according to the rule form -> #' form
   (define-lisp-action (|#' form | t)
  -  (reduce-until-type function-form function-lexeme))
  +  (reduce-until-type complete-function-form function-lexeme))
  +(define-lisp-action (|#' | unmatched-right-parenthesis-lexeme)
  +  (reduce-until-type incomplete-function-form function-lexeme))
  +(define-lisp-action (|#' | (eql nil))
  +  (reduce-until-type incomplete-function-form function-lexeme))
   
   ;;;;;;;;;;;;;;;; Reader conditionals
   
  
positive.code: (define-parser-state |` form | (lexer-toplevel-state parser-state) ())
  
  (define-new-lisp-state (form-may-follow backquote-lexeme) |` |)
  (define-new-lisp-state (|` | form) |` form |)
  (define-new-lisp-state (|` | comment) |` |)
  (define-new-lisp-state (|` | unmatched-right-parenthesis-lexeme) |( form* ) |)
  
  
negative.code:   (values tree 0))
  
  (defmethod indent-form ((syntax lisp-syntax) (tree long-comment-form) path)
    (values tree 0))
  
  (defmethod indent-form ((syntax lisp-syntax) (tree pathname-form) path)
    (values tree 0))
  
  (defmethod indent-form ((syntax lisp-syntax) (tree quote-form) path)
  