		Search-engine friendly clone of the ACL2 documentation.

Output-parser

Parse-output-expression

Parse an output-expression.

Signature
(parse-output-expression 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-output-expression

(defun parse-output-expression (token input)
  (declare (xargs :guard (and (abnf::tree-optionp token)
                              (abnf::tree-listp input))))
  (let ((__function__ 'parse-output-expression))
    (declare (ignorable __function__))
    (b* (((pok tree)
          (parse-expression token input)))
      (mv (abnf-tree-wrap tree "output-expression")
          token input))))

Theorem: tree-resultp-of-parse-output-expression.tree

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

Theorem: tree-optionp-of-parse-output-expression.next-token

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

Theorem: tree-listp-of-parse-output-expression.rest-input

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

Theorem: parsize-of-parse-output-expression-<=

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

Theorem: parsize-of-parse-output-expression-<

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

Theorem: parse-output-expression-of-tree-option-fix-token

(defthm parse-output-expression-of-tree-option-fix-token
  (equal (parse-output-expression (abnf::tree-option-fix token)
                                  input)
         (parse-output-expression token input)))

Theorem: parse-output-expression-tree-option-equiv-congruence-on-token

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

Theorem: parse-output-expression-of-tree-list-fix-input

(defthm parse-output-expression-of-tree-list-fix-input
  (equal (parse-output-expression token (abnf::tree-list-fix input))
         (parse-output-expression token input)))

Theorem: parse-output-expression-tree-list-equiv-congruence-on-input

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