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