Parse a
(parse-group-coordinate token input) → (mv tree next-token rest-input)
Function:
(defun parse-group-coordinate (token input) (declare (xargs :guard (and (abnf::tree-optionp token) (abnf::tree-listp input)))) (let ((__function__ 'parse-group-coordinate)) (declare (ignorable __function__)) (cond ((token-stringp "+" token) (b* (((pok tree) (parse-symbol "+" token input))) (mv (abnf-tree-wrap tree "group-coordinate") token input))) ((token-stringp "-" token) (b* (((pok< tree) (parse-symbol "-" token input)) ((when (null token)) (mv (abnf-tree-wrap tree "group-coordinate") token input)) ((mv tree1 next1 input1) (parse-numeral token input)) ((unless (reserrp tree1)) (mv (abnf::make-tree-nonleaf :rulename? (abnf::rulename "group-coordinate") :branches (list (list (abnf::make-tree-nonleaf :rulename? nil :branches (list (list (abnf::make-tree-nonleaf :rulename? nil :branches (list (list tree)))) (list tree1)))))) next1 input1))) (mv (abnf-tree-wrap tree "group-coordinate") token input))) ((token-stringp "_" token) (b* (((pok tree) (parse-symbol "_" token input))) (mv (abnf-tree-wrap tree "group-coordinate") token input))) (t (b* (((pok tree) (parse-numeral token input))) (mv (abnf::make-tree-nonleaf :rulename? (abnf::rulename "group-coordinate") :branches (list (list (abnf::make-tree-nonleaf :rulename? nil :branches (list (list (abnf::make-tree-nonleaf :rulename? nil :branches (list))) (list tree)))))) token input))))))
Theorem:
(defthm tree-resultp-of-parse-group-coordinate.tree (b* (((mv ?tree ?next-token ?rest-input) (parse-group-coordinate token input))) (abnf::tree-resultp tree)) :rule-classes :rewrite)
Theorem:
(defthm tree-optionp-of-parse-group-coordinate.next-token (b* (((mv ?tree ?next-token ?rest-input) (parse-group-coordinate token input))) (abnf::tree-optionp next-token)) :rule-classes :rewrite)
Theorem:
(defthm tree-listp-of-parse-group-coordinate.rest-input (b* (((mv ?tree ?next-token ?rest-input) (parse-group-coordinate token input))) (abnf::tree-listp rest-input)) :rule-classes :rewrite)
Theorem:
(defthm parsize-of-parse-group-coordinate-<= (b* (((mv ?tree ?next-token ?rest-input) (parse-group-coordinate token input))) (<= (parsize next-token rest-input) (parsize token input))) :rule-classes :linear)
Theorem:
(defthm parsize-of-parse-group-coordinate-< (b* (((mv ?tree ?next-token ?rest-input) (parse-group-coordinate token input))) (implies (not (reserrp tree)) (< (parsize next-token rest-input) (parsize token input)))) :rule-classes :linear)
Theorem:
(defthm parse-group-coordinate-of-tree-option-fix-token (equal (parse-group-coordinate (abnf::tree-option-fix token) input) (parse-group-coordinate token input)))
Theorem:
(defthm parse-group-coordinate-tree-option-equiv-congruence-on-token (implies (abnf::tree-option-equiv token token-equiv) (equal (parse-group-coordinate token input) (parse-group-coordinate token-equiv input))) :rule-classes :congruence)
Theorem:
(defthm parse-group-coordinate-of-tree-list-fix-input (equal (parse-group-coordinate token (abnf::tree-list-fix input)) (parse-group-coordinate token input)))
Theorem:
(defthm parse-group-coordinate-tree-list-equiv-congruence-on-input (implies (abnf::tree-list-equiv input input-equiv) (equal (parse-group-coordinate token input) (parse-group-coordinate token input-equiv))) :rule-classes :congruence)