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