• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • Proof-checker-array
      • Soft
      • C
      • Farray
      • Rp-rewriter
      • Instant-runoff-voting
      • Imp-language
      • Sidekick
      • Leftist-trees
      • Java
      • Riscv
      • Taspi
      • Bitcoin
      • Des
      • Ethereum
      • X86isa
      • Sha-2
      • Yul
      • Zcash
      • Proof-checker-itp13
      • Regex
      • ACL2-programming-language
      • Json
      • Jfkr
      • Equational
      • Cryptography
      • Poseidon
      • Where-do-i-place-my-book
      • Axe
      • Aleo
        • Aleobft
        • Aleovm
        • Leo
          • Grammar
          • Early-version
            • Json2ast
            • Testing
            • Definition
              • Flattening
              • Abstract-syntax
              • Dynamic-semantics
              • Compilation
              • Static-semantics
              • Concrete-syntax
                • Pretty-printer
                • Grammar
                • Lexing-and-parsing
                  • Lexer
                    • Lex-symbol
                      • Lex-rest-of-block-comment-+-lex-rest-of-block-comment-after-star
                      • Lex-not-double-quote-or-backslash-or-line-feed-or-carriage-return
                      • Lex-not-star-or-slash-or-line-feed-or-carriage-return
                      • Lex-identifier/keyword/boolean/address
                      • Lex-simple-character-escape
                      • Lex-hexadecimal-digit
                      • Lex-token
                      • Lex-not-star-or-line-feed-or-carriage-return
                      • Lex-u8/16/32/64/128
                      • Lex-not-line-feed-or-carriage-return
                      • Lex-i8/16/32/64/128
                      • Lex-string-literal-element
                      • Lex-safe-ascii
                      • Lex-numeric-literal
                      • Lex-safe-nonascii
                      • Lex-letter/decdigit/underscore
                      • Lex-line-terminator
                      • Lex-unicode-character-escape
                      • Lex-ascii-character-escape
                      • Lex-1*6-hexadecimal-digit
                      • Lex-whitespace
                      • Lex-unsigned-literal
                      • Lex-lcletter/decdigit
                      • Lex-string-literal
                      • Lex-signed-literal
                      • Lex-product-group-literal
                      • Lex-lexeme
                      • Lex-single-quote-escape
                      • Lex-integer-literal
                      • Lex-double-quote-escape
                      • Lex-address-literal
                      • Lex-scalar-literal
                      • Lex-null-character-escape
                      • Lex-identifier
                      • Lex-horizontal-tab-escape
                      • Lex-carriage-return-escape
                      • Lex-line-comment
                      • Lex-letter
                      • Lex-field-literal
                      • Lex-comment
                      • Lex-block-comment
                      • Lex-uppercase-letter
                      • Lex-lowercase-letter
                      • Lex-line-feed-escape
                      • Lex-horizontal-tab
                      • Lex-carriage-return
                      • Lex-backslash-escape
                      • Lex-annotation
                      • Lex-visible-ascii
                      • Lex-single-quote
                      • Lex-octal-digit
                      • Lex-double-quote
                      • Lex-decimal-digit
                      • Lex-*-not-line-feed-or-carriage-return
                      • Lex-line-feed
                      • Lex-space
                      • Lex-numeral
                      • Lex-*-letter/decdigit/underscore
                      • Lex-*-string-literal-element
                      • Lex-58-lcletter/decdigit
                      • Lexemize-leo-from-string
                      • Lex-*-lcletter/decdigit
                      • Lex-*-hexadecimal-digit
                      • Lex-1*-decimal-digit
                      • Lex-*-decimal-digit
                      • Lex-*-lexeme
                      • Lexemize-leo-from-bytes
                      • Lexemize-leo
                      • *defparse-leo-repetition-table*
                      • *defparse-leo-group-table*
                      • Lex-generation-macros
                      • Lex-generation-tables
                      • *defparse-leo-option-table*
                    • Parser
                    • Token-fringe
                    • Longest-lexp
                    • Parser-interface
                    • Grammar-lexp
                    • Identifier-lexp
                    • Output-file-parsep
                    • Input-file-parsep
                    • File-lex-parse-p
                    • Filter-tokens
                    • Lexp
                    • File-parsep
                    • Input-parser
                    • Output-file-lex-parse-p
                    • Input-file-lex-parse-p
                    • Parser-abstractor-interface
                    • Identifier-abnf-stringp
                    • Symbol-abnf-stringp
                    • Keyword-abnf-stringp
                    • Output-parser
                    • Tokenizer
                  • Input-pretty-printer
                  • Output-pretty-printer
                  • Unicode-characters
                  • Concrete-syntax-trees
                  • Symbols
                  • Keywords
        • Bigmems
        • Builtins
        • Execloader
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Community
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Lexer

    Lex-symbol

    Lex a symbol.

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

    It is critical that symbols that are prefixes of other symbols are tried after trying the longer ones, to satisfy the longest lexing requirement.

    Definitions and Theorems

    Function: lex-symbol

    (defun lex-symbol (input)
      (declare (xargs :guard (nat-listp input)))
      (let ((__function__ 'lex-symbol))
        (declare (ignorable __function__))
        (b* (((mv tree input)
              (b* (((mv tree input1)
                    (abnf::parse-schars ")group" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "(" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars ")" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "[" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "]" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "{" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "}" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "&&=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "&&" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "||=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "||" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "&=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "&" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "|=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "|" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "^=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "^" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "_" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "?" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "," input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars ";" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars ".." input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "." input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "::" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars ":" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "!=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "!" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "<<=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "<<" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars ">>=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars ">>" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "=>" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "==" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "<=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "<" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars ">=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars ">" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "+=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "+" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "/=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "/" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "%=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "%" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "->" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "-=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "-" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "**=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "**" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "*=" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1))
                   ((mv tree input1)
                    (abnf::parse-ichars "*" input))
                   ((when (not (reserrp tree)))
                    (mv tree input1)))
                (mv (reserrf :no-symbol)
                    (nat-list-fix input))))
             ((when (reserrp tree)) (mv tree input)))
          (mv (abnf-tree-wrap tree "symbol")
              input))))

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

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

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

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

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

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

    Theorem: len-of-lex-symbol-<

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

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

    (defthm lex-symbol-of-nat-list-fix-input
      (equal (lex-symbol (nat-list-fix input))
             (lex-symbol input)))

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

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