		Search-engine friendly clone of the ACL2 documentation.

Parser

Parse-increment-statement

Parse a increment-statement.

Signature
(parse-increment-statement token input) → (mv tree next-token rest-input)
Arguments: token — Guard (abnf::tree-optionp token).; input — Guard (abnf::tree-listp input).
Returns: tree — Type (abnf::tree-resultp tree).; next-token — Type (abnf::tree-optionp next-token).; rest-input — Type (abnf::tree-listp rest-input).

Definitions and Theorems

Function: parse-increment-statement

(defun parse-increment-statement (token input)
  (declare (xargs :guard (and (abnf::tree-optionp token)
                              (abnf::tree-listp input))))
  (let ((__function__ 'parse-increment-statement))
    (declare (ignorable __function__))
    (b* (((pok tree1)
          (parse-keyword "increment" token input))
         ((pok tree2)
          (parse-symbol "(" token input))
         ((pok tree3)
          (parse-identifier token input))
         ((pok tree4)
          (parse-symbol "," token input))
         ((pok tree5)
          (parse-expression token input))
         ((pok tree6)
          (parse-symbol "," token input))
         ((pok tree7)
          (parse-expression token input))
         ((pok tree8)
          (parse-?-comma token input))
         ((pok tree9)
          (parse-symbol ")" token input))
         ((pok tree10)
          (parse-symbol ";" token input)))
      (mv (abnf::make-tree-nonleaf
               :rulename? (abnf::rulename "increment-statement")
               :branches (list (list tree1)
                               (list tree2)
                               (list tree3)
                               (list tree4)
                               (list tree5)
                               (list tree6)
                               (list tree7)
                               (list tree8)
                               (list tree9)
                               (list tree10)))
          token input))))

Theorem: tree-resultp-of-parse-increment-statement.tree

(defthm tree-resultp-of-parse-increment-statement.tree
  (b* (((mv ?tree ?next-token ?rest-input)
        (parse-increment-statement token input)))
    (abnf::tree-resultp tree))
  :rule-classes :rewrite)

Theorem: tree-optionp-of-parse-increment-statement.next-token

(defthm tree-optionp-of-parse-increment-statement.next-token
  (b* (((mv ?tree ?next-token ?rest-input)
        (parse-increment-statement token input)))
    (abnf::tree-optionp next-token))
  :rule-classes :rewrite)

Theorem: tree-listp-of-parse-increment-statement.rest-input

(defthm tree-listp-of-parse-increment-statement.rest-input
  (b* (((mv ?tree ?next-token ?rest-input)
        (parse-increment-statement token input)))
    (abnf::tree-listp rest-input))
  :rule-classes :rewrite)

Theorem: parsize-of-parse-increment-statement-<=

(defthm parsize-of-parse-increment-statement-<=
  (b* (((mv ?tree ?next-token ?rest-input)
        (parse-increment-statement token input)))
    (<= (parsize next-token rest-input)
        (parsize token input)))
  :rule-classes :linear)

Theorem: parsize-of-parse-increment-statement-<

(defthm parsize-of-parse-increment-statement-<
  (b* (((mv ?tree ?next-token ?rest-input)
        (parse-increment-statement token input)))
    (implies (not (reserrp tree))
             (< (parsize next-token rest-input)
                (parsize token input))))
  :rule-classes :linear)

Theorem: parse-increment-statement-of-tree-option-fix-token

(defthm parse-increment-statement-of-tree-option-fix-token
  (equal (parse-increment-statement (abnf::tree-option-fix token)
                                    input)
         (parse-increment-statement token input)))

Theorem: parse-increment-statement-tree-option-equiv-congruence-on-token

(defthm
    parse-increment-statement-tree-option-equiv-congruence-on-token
  (implies (abnf::tree-option-equiv token token-equiv)
           (equal (parse-increment-statement token input)
                  (parse-increment-statement token-equiv input)))
  :rule-classes :congruence)

Theorem: parse-increment-statement-of-tree-list-fix-input

(defthm parse-increment-statement-of-tree-list-fix-input
  (equal
       (parse-increment-statement token (abnf::tree-list-fix input))
       (parse-increment-statement token input)))

Theorem: parse-increment-statement-tree-list-equiv-congruence-on-input

(defthm
      parse-increment-statement-tree-list-equiv-congruence-on-input
  (implies (abnf::tree-list-equiv input input-equiv)
           (equal (parse-increment-statement token input)
                  (parse-increment-statement token input-equiv)))
  :rule-classes :congruence)