Tree matching theorem for parse-char-val.
Theorem:
(defthm tree-match-of-parse-char-val (b* (((mv error? tree? &) (parse-char-val input))) (implies (and (not error?) (equal element (element-rulename *char-val*))) (tree-match-element-p tree? element *grammar*))))