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