anchor.diff:  ;; possessive-noun = satisfies possessive-p (['s] or [s'])
   ;; conjunction = satisfies conjunction-p (i.e. "and" "&" "," etc.)
   ;;
  -;; Goal AST - (verb noun-clause adverb-list chat-string) ;;this will be expanded further.
  +;; Goal AST - (verb noun-clause adverb-list chat-string)
   ;; -----------Where NOUN-CLAUSE is (preposition noun-phrase noun-phrase)
  -;; -----------Where NOUN-PHRASE is (list-of-objects)  update
  -;;;; NOTE: I can grab a list of possessives and use (reduce #'list possessive-list) on them, in the
  -;;;;       order that I want the recursion to go in!!
  +;; -----------Where NOUN-PHRASE is (list-of-objects)
   
   (defun parse-string (string)
     "Parses a STRING that was entered by PLAYER and returns an Abstract Syntax Tree"
     (parse-sentence (string->token-list string)))
   
  -;; TODO: ALRIGHT. LET'S REWRITE THIS BITCH.
  -
   (defun parse-sentence (token-list)
     "Uses a TOKEN-LIST to generate an AST"
  -  ;; sentence =  chat-string
  -  ;; sentence =/ [adverb] verb [noun-clause] [adverb] [chat-string]
     (let ((verb nil)
   	(noun-clause nil)
   	(adverb-1 nil)
  
positive.code: 	       (progn
  		 (loop until (or (possessive-p (car token-list))
  				 (conjunction-p (cadr token-list))
  				 (string-equal "," (cadr token-list))
  				 (preposition-p (cadr token-list))
  				 (chat-string-p (cadr token-list))
  				 (adverb-p (cadr token-list))
  
negative.code: (defun parse-noun-clause (token-list)
    "Generates the NOUN-CLAUSE list.
  MULTIPLE RETURN VALUES: NOUN-CLAUSE list, and the remaining TOKEN-LIST"
    (let ((adverb nil)
  	(preposition nil)
  	(noun-group-2 nil))
  