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