Completeness theorem for parse-repeat.
Theorem:
(defthm parse-repeat-when-tree-match (implies (and (tree-match-element-p tree (element-rulename *repeat*) *grammar*) (tree-terminatedp tree) (mv-nth 0 (parse-digit rest-input)) (mv-nth 0 (parse-ichar #\* rest-input))) (equal (parse-repeat (append (tree->string tree) rest-input)) (mv nil (tree-fix tree) (nat-list-fix rest-input)))))