		Search-engine friendly clone of the ACL2 documentation.

Parser

Lex-sp

Parse a sp.

Signature
(lex-sp abnf::input) → (mv abnf::tree abnf::rest-input)
Arguments: abnf::input — Guard (nat-listp abnf::input).
Returns: abnf::tree — Type (abnf::tree-resultp abnf::tree).; abnf::rest-input — Type (nat-listp abnf::rest-input).

Definitions and Theorems

Function: lex-sp

(defun lex-sp (abnf::input)
 (declare (xargs :guard (nat-listp abnf::input)))
 (let ((__function__ 'lex-sp))
  (declare (ignorable __function__))
  (b*
   (((mv abnf::treess abnf::input)
     (b* (((mv abnf::treess1 abnf::input1)
           (b* (((mv abnf::tree abnf::input)
                 (abnf::parse-direct (list 32)
                                     abnf::input))
                ((when (reserrp abnf::tree))
                 (mv (reserrf-push abnf::tree)
                     abnf::input))
                (abnf::trees1 (list abnf::tree))
                (abnf::treess (list abnf::trees1)))
             (mv abnf::treess abnf::input)))
          ((when (not (reserrp abnf::treess1)))
           (mv abnf::treess1 abnf::input1)))
      (mv
       (reserrf
         (list :found (list abnf::treess1)
               :required
               '(((:repetition (:repeat 1 (:finite 1))
                               (:num-val (:direct (:hex) (32))))))))
       abnf::input)))
    ((when (reserrp abnf::treess))
     (mv (reserrf-push abnf::treess)
         (nat-list-fix abnf::input))))
   (mv (abnf::make-tree-nonleaf :rulename? (abnf::rulename "sp")
                                :branches abnf::treess)
       abnf::input))))

Theorem: tree-resultp-of-lex-sp.tree

(defthm tree-resultp-of-lex-sp.tree
  (b* (((mv abnf::?tree abnf::?rest-input)
        (lex-sp abnf::input)))
    (abnf::tree-resultp abnf::tree))
  :rule-classes :rewrite)

Theorem: nat-listp-of-lex-sp.rest-input

(defthm nat-listp-of-lex-sp.rest-input
  (b* (((mv abnf::?tree abnf::?rest-input)
        (lex-sp abnf::input)))
    (nat-listp abnf::rest-input))
  :rule-classes :rewrite)

Theorem: len-of-lex-sp-<=

(defthm len-of-lex-sp-<=
  (b* (((mv abnf::?tree abnf::?rest-input)
        (lex-sp abnf::input)))
    (<= (len abnf::rest-input)
        (len abnf::input)))
  :rule-classes :linear)

Theorem: len-of-lex-sp-<

(defthm len-of-lex-sp-<
  (b* (((mv abnf::?tree abnf::?rest-input)
        (lex-sp abnf::input)))
    (implies (not (reserrp abnf::tree))
             (< (len abnf::rest-input)
                (len abnf::input))))
  :rule-classes :linear)

Theorem: lex-sp-of-nat-list-fix-input

(defthm lex-sp-of-nat-list-fix-input
  (equal (lex-sp (nat-list-fix abnf::input))
         (lex-sp abnf::input)))

Theorem: lex-sp-nat-list-equiv-congruence-on-input

(defthm lex-sp-nat-list-equiv-congruence-on-input
  (implies (acl2::nat-list-equiv abnf::input input-equiv)
           (equal (lex-sp abnf::input)
                  (lex-sp input-equiv)))
  :rule-classes :congruence)