• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
    • Kestrel-books
      • Crypto-hdwallet
      • Apt
      • Error-checking
      • Fty-extensions
      • Isar
      • Kestrel-utilities
      • Soft
      • Bv
      • Imp-language
      • C
      • Event-macros
      • Java
      • Bitcoin
      • Ethereum
      • Yul
        • Transformations
        • Language
          • Abstract-syntax
          • Dynamic-semantics
          • Concrete-syntax
            • Lexer
            • Parser
              • Parse-keyword
              • Parse-variable-declaration
              • Parse-symbol
              • Parse-literal
              • Parse-identifier
              • Parse-assignment-statement
              • Parse-identifier-and-open-paren
              • Parse-*-comma-identifier
              • Parse-*-.-identifier
              • Parse-continue-statement
              • Parse-*-comma-path
              • Parse-path
              • Parse-leave-statement
              • Parse-break-statement
              • Cst2ast-string-literal-content
              • Cst2ast-escape-sequence
              • Cst2ast-string-literal-contents
              • Cst2ast-quoted-printable
              • Parse-yul
              • Cst2ast-string-literal
              • Cst2ast-hex-string
              • Parse-yul-bytes
              • Hex-chars-to-hex-pair-list
              • Cst2ast-hex-number
              • Cst2ast-uhhhh
              • Cst2ast-literal-kind
              • Cst2ast-single-char
              • Cst2ast-decimal-number
              • Cst2ast-xhh
              • Cst2ast-boolean
              • Parse-*-case-clause
              • Looks-like-hex-string-fringe
              • Cst2ast-hex-digit-char-list
              • Parse-*-statement
              • Parse-*-comma-expression
              • Parse-switch-statement
              • Parse-if-statement
              • Parse-for-statement
              • Parse-expression
              • Parse-case-clause
              • Parse-fundef
              • Parse-function-call
              • Parse-block
              • *single-quote-tree-list*
              • *double-quote-tree-list*
              • *yul-keywords*
              • *single-quoted-content-rulenames*
              • *list-leafterm-x*
              • *list-leafterm-u*
              • *list-leafterm-92*
              • *double-quoted-content-rulenames*
              • *yul-symbols*
            • Grammar-new
            • Tokenizer
            • Grammar-old
          • Static-soundness
          • Static-semantics
          • Errors
        • Yul-json
      • Zcash
      • ACL2-programming-language
      • Prime-fields
      • Json
      • Syntheto
      • File-io-light
      • Number-theory
      • Cryptography
      • Lists-light
      • Builtins
      • Axe
      • Solidity
      • Helpers
      • Htclient
      • Typed-lists-light
      • Arithmetic-light
    • X86isa
    • Axe
    • Execloader
  • Math
  • Testing-utilities

• Parser

Parse-path

Attempts to eat a path and build a path AST node.

Signature

(parse-path tokens) → (mv ast-node tokens-after-path)

Arguments

tokens — Guard (abnf::tree-listp tokens).

Returns

ast-node — Type (path-resultp ast-node).

tokens-after-path — Type (abnf::tree-listp tokens-after-path).

Definitions and Theorems

Function: parse-path

(defun parse-path (tokens)
  (declare (xargs :guard (abnf::tree-listp tokens)))
  (let ((__function__ 'parse-path))
    (declare (ignorable __function__))
    (b* (((when (endp tokens))
          (mv (reserrf (cons "no path here" tokens))
              nil))
         ((mv first-id tokens-after-first-id)
          (parse-identifier tokens))
         ((when (null first-id))
          (mv (reserrf (cons "can't be path since no identifier"
                             tokens))
              nil))
         ((when (reserrp tokens-after-first-id))
          (mv (reserrf (cons "can't be path since no identifier 2"
                             tokens))
              nil))
         ((mv rest-ids rest-tokens)
          (parse-*-.-identifier tokens-after-first-id))
         ((unless (mbt (< (len rest-tokens) (len tokens))))
          (mv (reserrf (cons "logic error"
                             (cons tokens-after-first-id tokens)))
              nil)))
      (mv (make-path :get (cons first-id rest-ids))
          rest-tokens))))

Theorem: path-resultp-of-parse-path.ast-node

(defthm path-resultp-of-parse-path.ast-node
  (b* (((mv ?ast-node ?tokens-after-path)
        (parse-path tokens)))
    (path-resultp ast-node))
  :rule-classes :rewrite)

Theorem: tree-listp-of-parse-path.tokens-after-path

(defthm tree-listp-of-parse-path.tokens-after-path
  (b* (((mv ?ast-node ?tokens-after-path)
        (parse-path tokens)))
    (abnf::tree-listp tokens-after-path))
  :rule-classes :rewrite)

Theorem: len-of-parse-path-<

(defthm len-of-parse-path-<
  (b* (((mv ?ast-node ?tokens-after-path)
        (parse-path tokens)))
    (implies (not (reserrp ast-node))
             (< (len tokens-after-path)
                (len tokens))))
  :rule-classes :linear)