Completeness theorem for parse-exact.
Theorem:
(defthm parse-exact-when-tree-match (implies (and (tree-match-element-p tree element *grammar*) (element-case element :num-val) (num-val-case (element-num-val->get element) :direct) (equal (num-val-direct->get (element-num-val->get element)) (list nat))) (equal (parse-exact nat (append (tree->string tree) rest-input)) (mv nil (tree-fix tree) (nat-list-fix rest-input)))))