Completeness theorem for parse-1*-dot-1*hexdig.
Theorem:
(defthm parse-1*-dot-1*hexdig-when-tree-list-match (implies (and (tree-list-match-repetition-p trees (1*_ (!_ (/_ "." (1*_ *hexdig*)))) *grammar*) (tree-list-terminatedp trees) (mv-nth 0 (parse-hexdig rest-input)) (mv-nth 0 (parse-ichar #\. rest-input))) (equal (parse-1*-dot-1*hexdig (append (tree-list->string trees) rest-input)) (mv nil (tree-list-fix trees) (nat-list-fix rest-input)))))