Tree matching theorem for parse-*wsp/vchar.
Theorem:
(defthm tree-list-match-of-parse-*wsp/vchar (b* (((mv & trees &) (parse-*wsp/vchar input))) (implies (equal repetition (*_ (!_ (/_ *wsp*) (/_ *vchar*)))) (tree-list-match-repetition-p trees repetition *grammar*))))