• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
        • Deftreeops
        • Defdefparse
        • Defgrammar
        • Tree-utilities
        • Notation
          • Syntax-abstraction
          • Semantics
            • Tree-terminatedp
            • Tree->string
            • String-has-finite-parse-trees-p
            • Parse-trees-of-string-p
            • Tree-match-element-p
            • Parse-treep
            • Symbol
            • String-unambiguousp
            • Tree-match-num-val-p
            • Nat-match-insensitive-char-p
            • Nats-match-insensitive-chars-p
            • Tree-option
            • String-parsablep
            • Lookup-rulename
            • Nats-match-sensitive-chars-p
            • Numrep-match-repeat-range-p
            • Tree-match-char-val-p
            • Tree-list-match-repetition-p
            • String-ambiguousp
            • Parse
              • Tree-match-prose-val-p
              • Nat-match-sensitive-char-p
              • Theorems-about-terminated-trees-matching-elements
              • Tree-option-result
              • Tree-list-result
              • Tree-list-list-result
              • Tree-result
              • Tree-list-list-match-concatenation-p
              • Languagep
              • Terminal-string-for-rules-p
              • Tree-list-list-match-alternation-p
              • Tree-list-match-element-p
              • Parse!
              • String
              • Tree-set
              • Trees
            • Abstract-syntax
            • Core-rules
            • Concrete-syntax
          • Grammar-parser
          • Meta-circular-validation
          • Parsing-primitives-defresult
          • Parsing-primitives-seq
          • Operations
          • Examples
          • Differences-with-paper
          • Constructor-utilities
          • Grammar-printer
          • Parsing-tools
        • 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
        • Taspi
        • Bitcoin
        • Riscv
        • 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
        • Bigmems
        • Builtins
        • Execloader
        • Aleo
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Semantics

    Parse

    Parse a string.

    Signature
    (parse string rulename rules) → result
    Arguments
    string — Guard (stringp string).
    rulename — Guard (rulenamep rulename).
    rules — Guard (rulelistp rules).
    Returns
    result — Type (or (tree-setp result) (equal result :infinite)).

    If the string has a finite number of parse trees, return the finite set of its parse trees. Otherwise, return :infinite to indicate that the string has an infinite number of parse trees.

    Definitions and Theorems

    Function: parse

    (defun parse (string rulename rules)
     (declare (xargs :guard (and (stringp string)
                                 (rulenamep rulename)
                                 (rulelistp rules))))
     (if (string-has-finite-parse-trees-p string rulename rules)
         (string-has-finite-parse-trees-p-witness string rulename rules)
       :infinite))

    Theorem: return-type-of-parse

    (defthm return-type-of-parse
      (b* ((result (parse string rulename rules)))
        (or (tree-setp result)
            (equal result :infinite)))
      :rule-classes :rewrite)

    Theorem: distinguish-infinite-from-trees

    (defthm distinguish-infinite-from-trees
      (not (tree-setp :infinite)))

    Theorem: parse-when-not-string-parsablep

    (defthm parse-when-not-string-parsablep
      (implies (not (string-parsablep string rulename rules))
               (equal (parse string rulename rules)
                      nil)))

    Theorem: parse-when-string-unambiguousp

    (defthm parse-when-string-unambiguousp
     (implies
         (string-unambiguousp string rulename rules)
         (equal (parse string rulename rules)
                (insert (string-parsablep-witness string rulename rules)
                        nil))))

    Theorem: not-string-parsablep-when-parse-nil

    (defthm not-string-parsablep-when-parse-nil
      (implies (equal (parse string rulename rules)
                      nil)
               (not (string-parsablep string rulename rules))))

    Theorem: string-unambiguousp-when-parse-one

    (defthm string-unambiguousp-when-parse-one
     (implies
         (equal (parse string rulename rules)
                (insert (string-parsablep-witness string rulename rules)
                        nil))
         (string-unambiguousp string rulename rules)))