Constraints induced by a terminated tree
that matches
Theorem:
(defthm constraints-from-tree-match-?repeat-when-nonempty (implies (and (tree-match-element-p tree (?_ (/_ *repeat*)) *grammar*) (tree-terminatedp tree) (consp (tree->string tree))) (or (and (<= (char-code #\0) (car (tree->string tree))) (<= (car (tree->string tree)) (char-code #\9))) (equal (car (tree->string tree)) (char-code #\*)))) :rule-classes nil)