• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Pfcs
        • Proof-support
        • Semantics
        • Lifting
        • R1cs-subset
        • Indexed-names
        • Well-formedness
        • Abstract-syntax
        • Concrete-syntax
          • Lexer
          • Grammar
          • Parser
            • Parse-separator
            • Parse-operator
            • Parse-definition
            • Parse-relation-constraint
            • Parse-equality-constraint
            • Parse-*-comma-identifier
            • Parse-*-comma-expression
            • Parse-*-comma-constraint
            • Parse-system
            • Parse-identifier
            • Parse-integer
            • Parse-constraint
            • Parse-*-definition
              • Parse-*-constraint
              • Parsize
              • Check-token-string
              • Check-token-root
              • Parse-token
              • Token-stringp
              • Token-rootp
              • Patbind-pok<
              • Parse-multiplication-expression-rest
              • Parse-addition-expression-rest
              • Parse-primary-expression
              • Parse-multiplication-expression
              • Parse-addition-expression
              • Parse-expression
              • Patbind-pok
              • Perr
            • Tokenizer
          • R1cs-bridge
          • Parser-interface
        • Wp-gen
        • Dimacs-reader
        • Legacy-defrstobj
        • Proof-checker-array
        • Soft
        • C
        • Farray
        • Rp-rewriter
        • Riscv
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Leftist-trees
        • Java
        • 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
        • Bigmems
        • Builtins
        • Execloader
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Std
      • Community
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Parser

    Parse-*-definition

    Parse a *definition.

    Signature
    (parse-*-definition token input) 
      → 
    (mv trees next-token rest-input)
    Arguments
    token — Guard (abnf::tree-optionp token).
    input — Guard (abnf::tree-listp input).
    Returns
    trees — Type (abnf::tree-list-resultp trees).
    next-token — Type (abnf::tree-optionp next-token).
    rest-input — Type (abnf::tree-listp rest-input).

    Definitions and Theorems

    Function: parse-*-definition

    (defun parse-*-definition (token input)
      (declare (xargs :guard (and (abnf::tree-optionp token)
                                  (abnf::tree-listp input))))
      (let ((__function__ 'parse-*-definition))
        (declare (ignorable __function__))
        (b* (((mv tree token-after-definition
                  input-after-definition)
              (parse-definition token input))
             ((when (reserrp tree))
              (mv nil (abnf::tree-option-fix token)
                  (abnf::tree-list-fix input)))
             ((pok trees)
              (parse-*-definition token-after-definition
                                  input-after-definition)))
          (mv (cons tree trees) token input))))

    Theorem: tree-list-resultp-of-parse-*-definition.trees

    (defthm tree-list-resultp-of-parse-*-definition.trees
      (b* (((mv ?trees ?next-token ?rest-input)
            (parse-*-definition token input)))
        (abnf::tree-list-resultp trees))
      :rule-classes :rewrite)

    Theorem: tree-optionp-of-parse-*-definition.next-token

    (defthm tree-optionp-of-parse-*-definition.next-token
      (b* (((mv ?trees ?next-token ?rest-input)
            (parse-*-definition token input)))
        (abnf::tree-optionp next-token))
      :rule-classes :rewrite)

    Theorem: tree-listp-of-parse-*-definition.rest-input

    (defthm tree-listp-of-parse-*-definition.rest-input
      (b* (((mv ?trees ?next-token ?rest-input)
            (parse-*-definition token input)))
        (abnf::tree-listp rest-input))
      :rule-classes :rewrite)

    Theorem: parsize-of-parse-*-definition-<=

    (defthm parsize-of-parse-*-definition-<=
      (b* (((mv ?trees ?next-token ?rest-input)
            (parse-*-definition token input)))
        (<= (parsize next-token rest-input)
            (parsize token input)))
      :rule-classes :linear)

    Theorem: parse-*-definition-of-tree-option-fix-token

    (defthm parse-*-definition-of-tree-option-fix-token
      (equal (parse-*-definition (abnf::tree-option-fix token)
                                 input)
             (parse-*-definition token input)))

    Theorem: parse-*-definition-tree-option-equiv-congruence-on-token

    (defthm parse-*-definition-tree-option-equiv-congruence-on-token
      (implies (abnf::tree-option-equiv token token-equiv)
               (equal (parse-*-definition token input)
                      (parse-*-definition token-equiv input)))
      :rule-classes :congruence)

    Theorem: parse-*-definition-of-tree-list-fix-input

    (defthm parse-*-definition-of-tree-list-fix-input
      (equal (parse-*-definition token (abnf::tree-list-fix input))
             (parse-*-definition token input)))

    Theorem: parse-*-definition-tree-list-equiv-congruence-on-input

    (defthm parse-*-definition-tree-list-equiv-congruence-on-input
      (implies (abnf::tree-list-equiv input input-equiv)
               (equal (parse-*-definition token input)
                      (parse-*-definition token input-equiv)))
      :rule-classes :congruence)