• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Community
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
      • Warnings
      • Primitives
      • Use-set
      • Syntax
      • Getting-started
      • Utilities
      • Loader
        • Preprocessor
        • Vl-loadconfig
        • Lexer
          • Lex-strings
          • Lex-identifiers
            • Vl-printable-not-whitespace-p
            • Vl-simple-id-tail-p
            • Vl-simple-id-head-p
            • Vl-read-escaped-identifier
            • Vl-lex-system-identifier
            • Vl-lex-simple-identifier-or-keyword
            • Vl-printable-not-whitespace-list-p
            • Vl-simple-id-tail-list-p
            • Vl-simple-id-head-list-p
            • Vl-read-simple-identifier
            • Vl-lex-escaped-identifier
          • Vl-typo-uppercase-p
          • Vl-typo-number-p
          • Vl-typo-lowercase-p
          • Lex-numbers
          • Chartypes
          • Vl-lex
          • Defchar
          • Tokens
          • Lex-keywords
          • Lexstate
          • Make-test-tokens
          • Lexer-utils
          • Lex-comments
          • Vl-typo-uppercase-list-p
          • Vl-typo-lowercase-list-p
          • Vl-typo-number-list-p
        • Vl-loadstate
        • Parser
        • Vl-load-merge-descriptions
        • Scope-of-defines
        • Vl-load-file
        • Vl-flush-out-descriptions
        • Vl-description
        • Vl-loadresult
        • Vl-read-file
        • Vl-find-basename/extension
        • Vl-find-file
        • Vl-read-files
        • Extended-characters
        • Vl-load
        • Vl-load-main
        • Vl-load-description
        • Vl-descriptions-left-to-load
        • Inject-warnings
        • Vl-load-descriptions
        • Vl-load-files
        • Vl-load-summary
        • Vl-collect-modules-from-descriptions
        • Vl-descriptionlist
      • Transforms
      • Lint
      • Mlib
      • Server
      • Kit
      • Printer
      • Esim-vl
      • Well-formedness
    • Sv
    • Fgl
    • Vwsim
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Lex-identifiers
• Chartypes

Vl-simple-id-head-p

[a-zA-Z_]

We originally defined this as:

(or (and (char<= #a x) (char<= x #z))
    (and (char<= #A x) (char<= x #Z))
    (eql x #_))

The new definition is about 15% faster according to simple tests. We take advantage of the ASCII ordering. We know uppercase comes before lowercase, and underscore is between upper and lowercase.

;; (time$
;;  ;; 4.68 seconds with original definition,
;;  ;; 4.01 seconds with new definition.
;;  (loop for i fixnum from 1 to 1000000000 do
;;        (vl2014::vl-simple-id-head-p #m)
;;        (vl2014::vl-simple-id-head-p #M)
;;        (vl2014::vl-simple-id-head-p #Space)))

Definitions and Theorems

Function: vl-simple-id-head-p$inline

(defun vl-simple-id-head-p$inline (x)
  (declare (type character x))
  (and (mbt (characterp x))
       (b* (((the (unsigned-byte 8) code)
             (char-code x)))
         (and (<= (explicit-char-code #\A) code)
              (<= code (explicit-char-code #\z))
              (or (<= (explicit-char-code #\a) code)
                  (<= code (explicit-char-code #\Z))
                  (= code (explicit-char-code #\_)))))))

Function: vl-simple-id-head-echar-p$inline

(defun vl-simple-id-head-echar-p$inline (x)
  (declare (xargs :guard (vl-echar-p x)))
  (vl-simple-id-head-p (vl-echar->char x)))

Function: vl-simple-id-head-list-p

(defun vl-simple-id-head-list-p (x)
  (declare (xargs :guard (character-listp x)))
  (let ((__function__ 'vl-simple-id-head-list-p))
    (declare (ignorable __function__))
    (if (consp x)
        (and (vl-simple-id-head-p (car x))
             (vl-simple-id-head-list-p (cdr x)))
      t)))

Theorem: vl-simple-id-head-list-p-of-cons

(defthm vl-simple-id-head-list-p-of-cons
  (equal (vl-simple-id-head-list-p (cons acl2::a acl2::x))
         (and (vl-simple-id-head-p acl2::a)
              (vl-simple-id-head-list-p acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-cdr-when-vl-simple-id-head-list-p

(defthm
      vl-simple-id-head-list-p-of-cdr-when-vl-simple-id-head-list-p
  (implies (vl-simple-id-head-list-p (double-rewrite acl2::x))
           (vl-simple-id-head-list-p (cdr acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-when-not-consp

(defthm vl-simple-id-head-list-p-when-not-consp
  (implies (not (consp acl2::x))
           (vl-simple-id-head-list-p acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-p-of-car-when-vl-simple-id-head-list-p

(defthm vl-simple-id-head-p-of-car-when-vl-simple-id-head-list-p
  (implies (vl-simple-id-head-list-p acl2::x)
           (iff (vl-simple-id-head-p (car acl2::x))
                (or (consp acl2::x)
                    (vl-simple-id-head-p nil))))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-append

(defthm vl-simple-id-head-list-p-of-append
  (equal (vl-simple-id-head-list-p (append acl2::a acl2::b))
         (and (vl-simple-id-head-list-p acl2::a)
              (vl-simple-id-head-list-p acl2::b)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-list-fix

(defthm vl-simple-id-head-list-p-of-list-fix
  (equal (vl-simple-id-head-list-p (list-fix acl2::x))
         (vl-simple-id-head-list-p acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-sfix

(defthm vl-simple-id-head-list-p-of-sfix
  (iff (vl-simple-id-head-list-p (sfix acl2::x))
       (or (vl-simple-id-head-list-p acl2::x)
           (not (setp acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-insert

(defthm vl-simple-id-head-list-p-of-insert
  (iff (vl-simple-id-head-list-p (insert acl2::a acl2::x))
       (and (vl-simple-id-head-list-p (sfix acl2::x))
            (vl-simple-id-head-p acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-delete

(defthm vl-simple-id-head-list-p-of-delete
  (implies (vl-simple-id-head-list-p acl2::x)
           (vl-simple-id-head-list-p (delete acl2::k acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-mergesort

(defthm vl-simple-id-head-list-p-of-mergesort
  (iff (vl-simple-id-head-list-p (mergesort acl2::x))
       (vl-simple-id-head-list-p (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-union

(defthm vl-simple-id-head-list-p-of-union
  (iff (vl-simple-id-head-list-p (union acl2::x acl2::y))
       (and (vl-simple-id-head-list-p (sfix acl2::x))
            (vl-simple-id-head-list-p (sfix acl2::y))))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-intersect-1

(defthm vl-simple-id-head-list-p-of-intersect-1
  (implies (vl-simple-id-head-list-p acl2::x)
           (vl-simple-id-head-list-p (intersect acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-intersect-2

(defthm vl-simple-id-head-list-p-of-intersect-2
  (implies (vl-simple-id-head-list-p acl2::y)
           (vl-simple-id-head-list-p (intersect acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-difference

(defthm vl-simple-id-head-list-p-of-difference
  (implies (vl-simple-id-head-list-p acl2::x)
           (vl-simple-id-head-list-p (difference acl2::x acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-duplicated-members

(defthm vl-simple-id-head-list-p-of-duplicated-members
  (implies (vl-simple-id-head-list-p acl2::x)
           (vl-simple-id-head-list-p (duplicated-members acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-rev

(defthm vl-simple-id-head-list-p-of-rev
  (equal (vl-simple-id-head-list-p (rev acl2::x))
         (vl-simple-id-head-list-p (list-fix acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-rcons

(defthm vl-simple-id-head-list-p-of-rcons
  (iff (vl-simple-id-head-list-p (acl2::rcons acl2::a acl2::x))
       (and (vl-simple-id-head-p acl2::a)
            (vl-simple-id-head-list-p (list-fix acl2::x))))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-p-when-member-equal-of-vl-simple-id-head-list-p

(defthm
  vl-simple-id-head-p-when-member-equal-of-vl-simple-id-head-list-p
  (and (implies (and (member-equal acl2::a acl2::x)
                     (vl-simple-id-head-list-p acl2::x))
                (vl-simple-id-head-p acl2::a))
       (implies (and (vl-simple-id-head-list-p acl2::x)
                     (member-equal acl2::a acl2::x))
                (vl-simple-id-head-p acl2::a)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-when-subsetp-equal

(defthm vl-simple-id-head-list-p-when-subsetp-equal
  (and (implies (and (subsetp-equal acl2::x acl2::y)
                     (vl-simple-id-head-list-p acl2::y))
                (vl-simple-id-head-list-p acl2::x))
       (implies (and (vl-simple-id-head-list-p acl2::y)
                     (subsetp-equal acl2::x acl2::y))
                (vl-simple-id-head-list-p acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-set-equiv-congruence

(defthm vl-simple-id-head-list-p-set-equiv-congruence
  (implies (set-equiv acl2::x acl2::y)
           (equal (vl-simple-id-head-list-p acl2::x)
                  (vl-simple-id-head-list-p acl2::y)))
  :rule-classes :congruence)

Theorem: vl-simple-id-head-list-p-of-set-difference-equal

(defthm vl-simple-id-head-list-p-of-set-difference-equal
 (implies
  (vl-simple-id-head-list-p acl2::x)
  (vl-simple-id-head-list-p (set-difference-equal acl2::x acl2::y)))
 :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-intersection-equal-1

(defthm vl-simple-id-head-list-p-of-intersection-equal-1
 (implies
    (vl-simple-id-head-list-p (double-rewrite acl2::x))
    (vl-simple-id-head-list-p (intersection-equal acl2::x acl2::y)))
 :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-intersection-equal-2

(defthm vl-simple-id-head-list-p-of-intersection-equal-2
 (implies
    (vl-simple-id-head-list-p (double-rewrite acl2::y))
    (vl-simple-id-head-list-p (intersection-equal acl2::x acl2::y)))
 :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-union-equal

(defthm vl-simple-id-head-list-p-of-union-equal
  (equal (vl-simple-id-head-list-p (union-equal acl2::x acl2::y))
         (and (vl-simple-id-head-list-p (list-fix acl2::x))
              (vl-simple-id-head-list-p (double-rewrite acl2::y))))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-take

(defthm vl-simple-id-head-list-p-of-take
  (implies (vl-simple-id-head-list-p (double-rewrite acl2::x))
           (iff (vl-simple-id-head-list-p (take acl2::n acl2::x))
                (or (vl-simple-id-head-p nil)
                    (<= (nfix acl2::n) (len acl2::x)))))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-repeat

(defthm vl-simple-id-head-list-p-of-repeat
  (iff (vl-simple-id-head-list-p (repeat acl2::n acl2::x))
       (or (vl-simple-id-head-p acl2::x)
           (zp acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-p-of-nth-when-vl-simple-id-head-list-p

(defthm vl-simple-id-head-p-of-nth-when-vl-simple-id-head-list-p
  (implies (and (vl-simple-id-head-list-p acl2::x)
                (< (nfix acl2::n) (len acl2::x)))
           (vl-simple-id-head-p (nth acl2::n acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-update-nth

(defthm vl-simple-id-head-list-p-of-update-nth
 (implies
  (vl-simple-id-head-list-p (double-rewrite acl2::x))
  (iff
     (vl-simple-id-head-list-p (update-nth acl2::n acl2::y acl2::x))
     (and (vl-simple-id-head-p acl2::y)
          (or (<= (nfix acl2::n) (len acl2::x))
              (vl-simple-id-head-p nil)))))
 :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-butlast

(defthm vl-simple-id-head-list-p-of-butlast
  (implies (vl-simple-id-head-list-p (double-rewrite acl2::x))
           (vl-simple-id-head-list-p (butlast acl2::x acl2::n)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-nthcdr

(defthm vl-simple-id-head-list-p-of-nthcdr
  (implies (vl-simple-id-head-list-p (double-rewrite acl2::x))
           (vl-simple-id-head-list-p (nthcdr acl2::n acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-last

(defthm vl-simple-id-head-list-p-of-last
  (implies (vl-simple-id-head-list-p (double-rewrite acl2::x))
           (vl-simple-id-head-list-p (last acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-remove

(defthm vl-simple-id-head-list-p-of-remove
  (implies (vl-simple-id-head-list-p acl2::x)
           (vl-simple-id-head-list-p (remove acl2::a acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-simple-id-head-list-p-of-revappend

(defthm vl-simple-id-head-list-p-of-revappend
  (equal (vl-simple-id-head-list-p (revappend acl2::x acl2::y))
         (and (vl-simple-id-head-list-p (list-fix acl2::x))
              (vl-simple-id-head-list-p acl2::y)))
  :rule-classes ((:rewrite)))

Function: vl-read-while-simple-id-head-impl

(defun vl-read-while-simple-id-head-impl (echars acc)
 (declare (xargs :guard (vl-echarlist-p echars)))
 (cond ((atom echars) (mv acc echars))
       ((vl-simple-id-head-p (vl-echar->char (car echars)))
        (vl-read-while-simple-id-head-impl (cdr echars)
                                           (cons (car echars) acc)))
       (t (mv acc echars))))

Function: vl-read-while-simple-id-head$inline

(defun vl-read-while-simple-id-head$inline (echars)
  (declare (xargs :guard (vl-echarlist-p echars)))
  (mbe :logic
       (cond ((atom echars) (mv nil echars))
             ((vl-simple-id-head-p (vl-echar->char (car echars)))
              (mv-let (prefix remainder)
                      (vl-read-while-simple-id-head (cdr echars))
                (mv (cons (car echars) prefix)
                    remainder)))
             (t (mv nil echars)))
       :exec
       (mv-let (prefix-rev remainder)
               (vl-read-while-simple-id-head-impl echars nil)
         (mv (reverse prefix-rev) remainder))))

Theorem: prefix-of-vl-read-while-simple-id-head

(defthm prefix-of-vl-read-while-simple-id-head
 (and
  (true-listp (mv-nth 0
                      (vl-read-while-simple-id-head echars)))
  (implies
   (force (vl-echarlist-p echars))
   (vl-echarlist-p (mv-nth 0
                           (vl-read-while-simple-id-head echars)))))
 :rule-classes
 ((:rewrite)
  (:type-prescription
      :corollary
      (true-listp (mv-nth 0
                          (vl-read-while-simple-id-head echars))))))

Theorem: remainder-of-vl-read-while-simple-id-head

(defthm remainder-of-vl-read-while-simple-id-head
 (and
  (equal (true-listp (mv-nth 1
                             (vl-read-while-simple-id-head echars)))
         (true-listp echars))
  (implies
   (vl-echarlist-p echars)
   (vl-echarlist-p (mv-nth 1
                           (vl-read-while-simple-id-head echars)))))
 :rule-classes
 ((:rewrite)
  (:type-prescription
   :corollary
   (implies
     (true-listp echars)
     (true-listp (mv-nth 1
                         (vl-read-while-simple-id-head echars)))))))

Theorem: prefix-of-vl-read-while-simple-id-head-when-vl-simple-id-head-p

(defthm
    prefix-of-vl-read-while-simple-id-head-when-vl-simple-id-head-p
  (implies (vl-simple-id-head-p (vl-echar->char (car echars)))
           (iff (mv-nth 0 (vl-read-while-simple-id-head echars))
                (consp echars))))

Theorem: vl-read-while-simple-id-head-sound

(defthm vl-read-while-simple-id-head-sound
  (vl-simple-id-head-list-p
       (vl-echarlist->chars
            (mv-nth 0
                    (vl-read-while-simple-id-head echars)))))

Theorem: vl-read-while-simple-id-head-complete

(defthm vl-read-while-simple-id-head-complete
 (equal
    (vl-simple-id-head-p
         (vl-echar->char
              (car (mv-nth 1
                           (vl-read-while-simple-id-head echars)))))
    (if (consp (mv-nth 1
                       (vl-read-while-simple-id-head echars)))
        nil
      (vl-simple-id-head-p (vl-echar->char nil)))))

Theorem: append-of-vl-read-while-simple-id-head

(defthm append-of-vl-read-while-simple-id-head
  (equal (append (mv-nth 0 (vl-read-while-simple-id-head echars))
                 (mv-nth 1
                         (vl-read-while-simple-id-head echars)))
         echars))

Theorem: no-change-loser-of-vl-read-while-simple-id-head

(defthm no-change-loser-of-vl-read-while-simple-id-head
  (implies (not (mv-nth 0
                        (vl-read-while-simple-id-head echars)))
           (equal (mv-nth 1 (vl-read-while-simple-id-head echars))
                  echars)))

Theorem: acl2-count-of-vl-read-while-simple-id-head-weak

(defthm acl2-count-of-vl-read-while-simple-id-head-weak
  (<= (acl2-count (mv-nth 1
                          (vl-read-while-simple-id-head echars)))
      (acl2-count echars))
  :rule-classes ((:rewrite) (:linear)))

Theorem: acl2-count-of-vl-read-while-simple-id-head-strong

(defthm acl2-count-of-vl-read-while-simple-id-head-strong
 (implies
      (mv-nth 0 (vl-read-while-simple-id-head echars))
      (< (acl2-count (mv-nth 1
                             (vl-read-while-simple-id-head echars)))
         (acl2-count echars)))
 :rule-classes ((:rewrite) (:linear)))