		Search-engine friendly clone of the ACL2 documentation.

Parser

Lex-ws

Parse a ws.

Signature
(lex-ws 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-ws

(defun lex-ws (abnf::input)
 (declare (xargs :guard (nat-listp abnf::input)))
 (let ((__function__ 'lex-ws))
  (declare (ignorable __function__))
  (b*
   (((mv abnf::treess abnf::input)
     (b*
      (((mv abnf::treess1 abnf::input1)
        (b* (((mv abnf::trees1 abnf::input)
              (lex-repetition-*-plain-ws-or-escaped-lf abnf::input))
             ((when (reserrp abnf::trees1))
              (mv (reserrf-push abnf::trees1)
                  abnf::input))
             (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 0 (:infinity))
             (:group
                (((:repetition (:repeat 1 (:infinity))
                               (:rulename (:rulename "plain-ws"))))
                 ((:repetition
                       (:repeat 1 (:finite 1))
                       (:rulename (:rulename "escaped-lf")))))))))))
       abnf::input)))
    ((when (reserrp abnf::treess))
     (mv (reserrf-push abnf::treess)
         (nat-list-fix abnf::input))))
   (mv (abnf::make-tree-nonleaf :rulename? (abnf::rulename "ws")
                                :branches abnf::treess)
       abnf::input))))

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

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

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

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

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

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

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

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

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

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