		Search-engine friendly clone of the ACL2 documentation.

Parser

Parse-locator

Parse a locator.

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

(defun parse-locator (token input)
 (declare (xargs :guard (and (abnf::tree-optionp token)
                             (abnf::tree-listp input))))
 (let ((__function__ 'parse-locator))
  (declare (ignorable __function__))
  (b* (((pok tree1)
        (parse-program-id token input))
       ((pok tree2)
        (parse-symbol "/" token input))
       ((pok tree3)
        (parse-identifier token input)))
   (mv
      (abnf::make-tree-nonleaf :rulename? (abnf::rulename "locator")
                               :branches (list (list tree1)
                                               (list tree2)
                                               (list tree3)))
      token input))))

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

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

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

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

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

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

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

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

Theorem: parsize-of-parse-locator-<

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

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

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

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

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

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

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

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

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