• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Debugging
  • Projects
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
    • Kestrel-books
      • Crypto-hdwallet
      • Error-checking
      • Apt
      • Abnf
        • Defdefparse
        • Deftreeops
        • Defgrammar
        • Notation
        • Grammar-parser
        • Meta-circular-validation
        • Parsing-primitives-defresult
          • Parse-schars
          • Parse-ichars
          • Parse-direct
          • Parse-range
          • Parse-next
        • Parsing-primitives-seq
        • Operations
        • Differences-with-paper
        • Examples
        • Grammar-printer
        • Parsing-tools
      • Fty-extensions
      • Isar
      • Kestrel-utilities
      • Prime-field-constraint-systems
      • Soft
      • Bv
      • Imp-language
      • Event-macros
      • Bitcoin
      • Ethereum
      • Yul
      • Zcash
      • ACL2-programming-language
      • Prime-fields
      • Java
      • C
      • Syntheto
      • Number-theory
      • Cryptography
      • Lists-light
      • File-io-light
      • Json
      • Built-ins
      • Solidity
      • Axe
      • Std-extensions
      • Htclient
      • Typed-lists-light
      • Arithmetic-light
    • X86isa
    • Execloader
    • Axe
  • Testing-utilities
  • Math

• Parsing-primitives-defresult

Parse-ichars

Parse a case-insensitive character value consisting of a given string of characters.

Signature

(parse-ichars chars input) → (mv tree rest-input)

Arguments

chars — Guard (common-lisp::stringp chars).

input — Guard (nat-listp input).

Returns

tree — Type (tree-resultp tree).

rest-input — Type (nat-listp rest-input).

Definitions and Theorems

Function: parse-ichars-aux

(defun
  parse-ichars-aux (chars input)
  (declare (xargs :guard (and (character-listp chars)
                              (nat-listp input))))
  (let ((__function__ 'parse-ichars-aux))
       (declare (ignorable __function__))
       (b* (((when (endp chars))
             (mv nil (nat-list-fix input)))
            ((mv nat? input1) (parse-next input))
            ((when (reserrp nat?))
             (mv (reserrf-push nat?)
                 (nat-list-fix input)))
            (nat nat?)
            ((unless (nat-match-insensitive-char-p nat (car chars)))
             (mv (reserrf (list :found nat
                                :required (char-fix (car chars))))
                 (nat-list-fix input)))
            ((mv nats? input2)
             (parse-ichars-aux (cdr chars) input1))
            ((when (reserrp nats?))
             (mv (reserrf-push nats?) input1))
            (nats nats?))
           (mv (cons nat nats) input2))))

Theorem: nat-list-resultp-of-parse-ichars-aux.nats

(defthm nat-list-resultp-of-parse-ichars-aux.nats
        (b* (((mv ?nats ?rest-input)
              (parse-ichars-aux chars input)))
            (nat-list-resultp nats))
        :rule-classes :rewrite)

Theorem: nat-listp-of-parse-ichars-aux.rest-input

(defthm nat-listp-of-parse-ichars-aux.rest-input
        (b* (((mv ?nats ?rest-input)
              (parse-ichars-aux chars input)))
            (nat-listp rest-input))
        :rule-classes :rewrite)

Theorem: len-of-parse-ichars-aux-<=

(defthm len-of-parse-ichars-aux-<=
        (b* (((mv ?nats ?rest-input)
              (parse-ichars-aux chars input)))
            (<= (len rest-input) (len input)))
        :rule-classes :linear)

Theorem: len-of-parse-ichars-aux-<

(defthm len-of-parse-ichars-aux-<
        (b* (((mv ?nats ?rest-input)
              (parse-ichars-aux chars input)))
            (implies (and (not (reserrp nats)) (consp chars))
                     (< (len rest-input) (len input))))
        :rule-classes :linear)

Theorem: parse-ichars-aux-of-make-character-list-chars

(defthm parse-ichars-aux-of-make-character-list-chars
        (equal (parse-ichars-aux (make-character-list chars)
                                 input)
               (parse-ichars-aux chars input)))

Theorem: parse-ichars-aux-charlisteqv-congruence-on-chars

(defthm parse-ichars-aux-charlisteqv-congruence-on-chars
        (implies (str::charlisteqv chars chars-equiv)
                 (equal (parse-ichars-aux chars input)
                        (parse-ichars-aux chars-equiv input)))
        :rule-classes :congruence)

Theorem: parse-ichars-aux-of-nat-list-fix-input

(defthm parse-ichars-aux-of-nat-list-fix-input
        (equal (parse-ichars-aux chars (nat-list-fix input))
               (parse-ichars-aux chars input)))

Theorem: parse-ichars-aux-nat-list-equiv-congruence-on-input

(defthm parse-ichars-aux-nat-list-equiv-congruence-on-input
        (implies (acl2::nat-list-equiv input input-equiv)
                 (equal (parse-ichars-aux chars input)
                        (parse-ichars-aux chars input-equiv)))
        :rule-classes :congruence)

Function: parse-ichars

(defun parse-ichars (chars input)
       (declare (xargs :guard (and (common-lisp::stringp chars)
                                   (nat-listp input))))
       (let ((__function__ 'parse-ichars))
            (declare (ignorable __function__))
            (b* (((mv nats input)
                  (parse-ichars-aux (explode chars)
                                    input))
                 ((when (reserrp nats))
                  (mv (reserrf-push nats) input)))
                (mv (tree-leafterm nats) input))))

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

(defthm tree-resultp-of-parse-ichars.tree
        (b* (((mv ?tree ?rest-input)
              (parse-ichars chars input)))
            (tree-resultp tree))
        :rule-classes :rewrite)

Theorem: nat-listp-of-parse-ichars.rest-input

(defthm nat-listp-of-parse-ichars.rest-input
        (b* (((mv ?tree ?rest-input)
              (parse-ichars chars input)))
            (nat-listp rest-input))
        :rule-classes :rewrite)

Theorem: len-of-parse-ichars-<=

(defthm len-of-parse-ichars-<=
        (b* (((mv ?tree ?rest-input)
              (parse-ichars chars input)))
            (<= (len rest-input) (len input)))
        :rule-classes :linear)

Theorem: len-of-parse-ichars-<

(defthm len-of-parse-ichars-<
        (b* (((mv ?tree ?rest-input)
              (parse-ichars chars input)))
            (implies (and (not (reserrp tree))
                          (consp (explode chars)))
                     (< (len rest-input) (len input))))
        :rule-classes :linear)

Theorem: parse-ichars-of-str-fix-chars

(defthm parse-ichars-of-str-fix-chars
        (equal (parse-ichars (acl2::str-fix chars)
                             input)
               (parse-ichars chars input)))

Theorem: parse-ichars-streqv-congruence-on-chars

(defthm parse-ichars-streqv-congruence-on-chars
        (implies (acl2::streqv chars chars-equiv)
                 (equal (parse-ichars chars input)
                        (parse-ichars chars-equiv input)))
        :rule-classes :congruence)

Theorem: parse-ichars-of-nat-list-fix-input

(defthm parse-ichars-of-nat-list-fix-input
        (equal (parse-ichars chars (nat-list-fix input))
               (parse-ichars chars input)))

Theorem: parse-ichars-nat-list-equiv-congruence-on-input

(defthm parse-ichars-nat-list-equiv-congruence-on-input
        (implies (acl2::nat-list-equiv input input-equiv)
                 (equal (parse-ichars chars input)
                        (parse-ichars chars input-equiv)))
        :rule-classes :congruence)