Constraints induced by a terminated tree that matches
Theorem:
(defthm constraints-from-tree-match-elements (implies (and (tree-match-element-p tree (element-rulename *elements*) *grammar*) (tree-terminatedp tree)) (or (and (<= (char-code #\A) (car (tree->string tree))) (<= (car (tree->string tree)) (char-code #\Z))) (and (<= (char-code #\a) (car (tree->string tree))) (<= (car (tree->string tree)) (char-code #\z))) (and (<= (char-code #\0) (car (tree->string tree))) (<= (car (tree->string tree)) (char-code #\9))) (member-equal (car (tree->string tree)) (chars=>nats '(#\" #\% #\( #\* #\< #\[))))) :rule-classes nil)