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