Parse a group
(parse-conc-rest-comp input) → (mv error? tree? rest-input)
The linear rules below are used in the guard verification proof.
Function:
(defun parse-conc-rest-comp (input) (declare (xargs :guard (nat-listp input))) (seq input (trees := (parse-1*cwsp input)) (tree := (parse-repetition input)) (return (make-tree-nonleaf :rulename? nil :branches (list trees (list tree))))))
Theorem:
(defthm len-of-parse-conc-rest-comp-linear-1 (<= (len (mv-nth 2 (parse-conc-rest-comp input))) (len input)) :rule-classes :linear)
Theorem:
(defthm len-of-parse-conc-rest-comp-linear-2 (implies (not (mv-nth 0 (parse-conc-rest-comp input))) (< (len (mv-nth 2 (parse-conc-rest-comp input))) (len input))) :rule-classes :linear)