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