Completeness theorem for parse-cnl-wsp.
Theorem:
(defthm parse-cnl-wsp-when-tree-match (implies (and (tree-match-element-p tree (!_ (/_ *c-nl* *wsp*)) *grammar*) (tree-terminatedp tree)) (equal (parse-cnl-wsp (append (tree->string tree) rest-input)) (mv nil (tree-fix tree) (nat-list-fix rest-input)))))