		Search-engine friendly clone of the ACL2 documentation.

Parser

Parse-literal

Parse a literal.

Signature
(parse-literal 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-literal

(defun parse-literal (token input)
  (declare (xargs :guard (and (abnf::tree-optionp token)
                              (abnf::tree-listp input))))
  (let ((__function__ 'parse-literal))
    (declare (ignorable __function__))
    (b* (((pok tree)
          (if (token-stringp "(" token)
              (parse-affine-group-literal token input)
            (parse-atomic-literal token input))))
      (mv (abnf-tree-wrap tree "literal")
          token input))))

Theorem: tree-resultp-of-parse-literal.tree

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

Theorem: tree-optionp-of-parse-literal.next-token

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

Theorem: tree-listp-of-parse-literal.rest-input

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

Theorem: parsize-of-parse-literal-<=

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

Theorem: parsize-of-parse-literal-<

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

Theorem: parse-literal-of-tree-option-fix-token

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

Theorem: parse-literal-tree-option-equiv-congruence-on-token

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

Theorem: parse-literal-of-tree-list-fix-input

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

Theorem: parse-literal-tree-list-equiv-congruence-on-input

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