Tree matching theorem for parse-1*bit.
Theorem:
(defthm tree-list-match-of-parse-1*bit (b* (((mv error? trees &) (parse-1*bit input))) (implies (and (not error?) (equal repetition (1*_ *bit*))) (tree-list-match-repetition-p trees repetition *grammar*))))