		Search-engine friendly clone of the ACL2 documentation.

Parser

Parse-*-program-item

Parse a *program-item.

Signature
(parse-*-program-item token input) → (mv trees next-token rest-input)
Arguments: token — Guard (abnf::tree-optionp token).; input — Guard (abnf::tree-listp input).
Returns: trees — Type (abnf::tree-list-resultp trees).; next-token — Type (abnf::tree-optionp next-token).; rest-input — Type (abnf::tree-listp rest-input).

Definitions and Theorems

Function: parse-*-program-item

(defun parse-*-program-item (token input)
  (declare (xargs :guard (and (abnf::tree-optionp token)
                              (abnf::tree-listp input))))
  (let ((__function__ 'parse-*-program-item))
    (declare (ignorable __function__))
    (b* (((when (token-stringp "}" token))
          (mv nil (abnf::tree-option-fix token)
              (abnf::tree-list-fix input)))
         ((pok< tree)
          (parse-program-item token input))
         ((pok trees)
          (parse-*-program-item token input)))
      (mv (cons tree trees) token input))))

Theorem: tree-list-resultp-of-parse-*-program-item.trees

(defthm tree-list-resultp-of-parse-*-program-item.trees
  (b* (((mv ?trees ?next-token ?rest-input)
        (parse-*-program-item token input)))
    (abnf::tree-list-resultp trees))
  :rule-classes :rewrite)

Theorem: tree-optionp-of-parse-*-program-item.next-token

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

Theorem: tree-listp-of-parse-*-program-item.rest-input

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

Theorem: parsize-of-parse-*-program-item-<=

(defthm parsize-of-parse-*-program-item-<=
  (b* (((mv ?trees ?next-token ?rest-input)
        (parse-*-program-item token input)))
    (<= (parsize next-token rest-input)
        (parsize token input)))
  :rule-classes :linear)

Theorem: parse-*-program-item-of-tree-option-fix-token

(defthm parse-*-program-item-of-tree-option-fix-token
  (equal (parse-*-program-item (abnf::tree-option-fix token)
                               input)
         (parse-*-program-item token input)))

Theorem: parse-*-program-item-tree-option-equiv-congruence-on-token

(defthm parse-*-program-item-tree-option-equiv-congruence-on-token
  (implies (abnf::tree-option-equiv token token-equiv)
           (equal (parse-*-program-item token input)
                  (parse-*-program-item token-equiv input)))
  :rule-classes :congruence)

Theorem: parse-*-program-item-of-tree-list-fix-input

(defthm parse-*-program-item-of-tree-list-fix-input
  (equal (parse-*-program-item token (abnf::tree-list-fix input))
         (parse-*-program-item token input)))

Theorem: parse-*-program-item-tree-list-equiv-congruence-on-input

(defthm parse-*-program-item-tree-list-equiv-congruence-on-input
  (implies (abnf::tree-list-equiv input input-equiv)
           (equal (parse-*-program-item token input)
                  (parse-*-program-item token input-equiv)))
  :rule-classes :congruence)