Completeness theorem for parse-bin-val.
Theorem:
(defthm parse-bin-val-when-tree-match (implies (and (tree-match-element-p tree (element-rulename *bin-val*) *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 (append (tree->string tree) rest-input)) (mv nil (tree-fix tree) (nat-list-fix rest-input)))))