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