Completeness theorem for parse-?%i.
Theorem:
(defthm parse-?%i-when-tree-match (implies (and (tree-match-element-p tree (?_ (/_ "%i")) *grammar*) (mv-nth 0 (parse-ichar2 #\% #\i rest-input))) (equal (parse-?%i (append (tree->string tree) rest-input)) (mv nil (tree-fix tree) (nat-list-fix rest-input)))))