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