		Search-engine friendly clone of the ACL2 documentation.

Parser

Parse-program-declaration

Parse an program-declaration.

Signature
(parse-program-declaration 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-program-declaration

(defun parse-program-declaration (token input)
  (declare (xargs :guard (and (abnf::tree-optionp token)
                              (abnf::tree-listp input))))
  (let ((__function__ 'parse-program-declaration))
    (declare (ignorable __function__))
    (b* (((pok tree1)
          (parse-keyword "program" token input))
         ((pok tree2)
          (parse-program-id token input))
         ((pok tree3)
          (parse-symbol "{" token input))
         ((pok trees4)
          (parse-*-program-item token input))
         ((pok tree5)
          (parse-symbol "}" token input)))
      (mv (abnf::make-tree-nonleaf
               :rulename? (abnf::rulename "program-declaration")
               :branches (list (list tree1)
                               (list tree2)
                               (list tree3)
                               trees4 (list tree5)))
          token input))))

Theorem: tree-resultp-of-parse-program-declaration.tree

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

Theorem: tree-optionp-of-parse-program-declaration.next-token

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

Theorem: tree-listp-of-parse-program-declaration.rest-input

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

Theorem: parsize-of-parse-program-declaration-<=

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

Theorem: parsize-of-parse-program-declaration-<

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

Theorem: parse-program-declaration-of-tree-option-fix-token

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

Theorem: parse-program-declaration-tree-option-equiv-congruence-on-token

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

Theorem: parse-program-declaration-of-tree-list-fix-input

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

Theorem: parse-program-declaration-tree-list-equiv-congruence-on-input

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