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