• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
      • Apt
      • Acre
        • Acre-internals
        • Parse-and-match-regex
        • Match-regex
        • Parse
        • Matchresult->matchedp
        • Match
        • Milawa
        • Smtlink
        • Abnf
        • Vwsim
        • Isar
        • Wp-gen
        • Dimacs-reader
        • Legacy-defrstobj
        • Prime-field-constraint-systems
        • Proof-checker-array
        • Soft
        • Rp-rewriter
        • Farray
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Leftist-trees
        • Taspi
        • Bitcoin
        • Des
        • Ethereum
        • Sha-2
        • Yul
        • Zcash
        • Proof-checker-itp13
        • Bigmem
        • Regex
        • ACL2-programming-language
        • Java
        • C
        • Jfkr
        • X86isa
        • Equational
        • Cryptography
        • Where-do-i-place-my-book
        • Json
        • Built-ins
        • Execloader
        • Solidity
        • Paco
        • Concurrent-programs
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Testing-utilities
      • Math
    • Acre

    Match

    Match a string against a regular expression, which is parsed at macroexpansion time.

    Signature:

    (match pattern str :case-insens nil :legible t)
    --> match-result

    This macro runs parse at macroexpansion time to create a regular expression object that is "compiled in" to the function, so that parsing doesn't need to be done every time. This means that the input pattern must be a string literal and legible must be a Boolean literal. If the regular expression is malformed, it will result in an error at macroexpansion time.