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