• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
        • Proof-support
        • Abstract-syntax
        • R1cs-subset
        • Semantics
        • Abstract-syntax-operations
        • Indexed-names
        • Well-formedness
        • Concrete-syntax
          • Lexer
          • Grammar
            • Abnf-tree-with-root-p
            • Cst-token-conc?
            • Cst-list-list-conc-matchp$
            • Cst-list-list-alt-matchp$
            • Cst-whitespace-conc?
            • Cst-constraint-conc?
            • Cst-list-rep-matchp$
            • Cst-list-elem-matchp$
            • Cst-letter-conc?
            • Cst-lexeme-conc?
            • Abnf-tree-wrap-fn
            • Abnf-tree-wrap
            • Cst-matchp$
            • *grammar*
              • *grammar*-tree-operations
            • Cst-whitespace-conc2-rep-elem
            • Cst-whitespace-conc1-rep-elem
            • Cst-constraint-conc2-rep-elem
            • Cst-constraint-conc1-rep-elem
            • Cst-whitespace-conc2-rep
            • Cst-whitespace-conc1-rep
            • Cst-uppercase-letter-conc-rep-elem
            • Cst-uppercase-letter-conc-rep
            • Cst-relation-constraint-conc
            • Cst-lowercase-letter-conc-rep-elem
            • Cst-lowercase-letter-conc-rep
            • Cst-lexeme-conc2-rep-elem
            • Cst-lexeme-conc1-rep-elem
            • Cst-letter-conc2-rep-elem
            • Cst-letter-conc1-rep-elem
            • Cst-equality-constraint-conc
            • Cst-constraint-conc2-rep
            • Cst-constraint-conc1-rep
            • Cst-carriage-return-conc-rep-elem
            • Cst-carriage-return-conc-rep
            • Cst-whitespace-conc2
            • Cst-whitespace-conc1
            • Cst-uppercase-letter-conc
            • Cst-token-conc4-rep-elem
            • Cst-token-conc3-rep-elem
            • Cst-token-conc2-rep-elem
            • Cst-token-conc1-rep-elem
            • Cst-lowercase-letter-conc
            • Cst-line-terminator-conc
            • Cst-line-feed-conc-rep-elem
            • Cst-lexeme-conc2-rep
            • Cst-lexeme-conc1-rep
            • Cst-letter-conc2-rep
            • Cst-letter-conc1-rep
            • Cst-expression-conc-rep-elem
            • Cst-constraint-conc2
            • Cst-constraint-conc1
            • Cst-carriage-return-conc
            • Cst-token-conc4-rep
            • Cst-token-conc4
            • Cst-token-conc3-rep
            • Cst-token-conc3
            • Cst-token-conc2-rep
            • Cst-token-conc2
            • Cst-token-conc1-rep
            • Cst-token-conc1
            • Cst-space-conc-rep-elem
            • Cst-line-feed-conc-rep
            • Cst-line-feed-conc
            • Cst-lexeme-conc2
            • Cst-lexeme-conc1
            • Cst-letter-conc2
            • Cst-letter-conc1
            • Cst-identifier-conc
            • Cst-expression-conc-rep
            • Cst-expression-conc
            • Cst-digit-conc-rep-elem
            • Cst-definition-conc
            • Cst-system-conc
            • Cst-space-conc-rep
            • Cst-space-conc
            • Cst-numeral-conc
            • Cst-integer-conc
            • Cst-digit-conc-rep
            • Cst-digit-conc
            • Abnf-tree-list-with-root-p
            • Cst-%x61-7a-nat
            • Cst-%x41-5a-nat
            • Cst-%x30-39-nat
          • Parser
          • Tokenizer
        • R1cs-bridge
        • Parser-interface
      • 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
  • Grammar

*grammar*

The grammar of PFCSes, in ACL2.

We use our verified ABNF grammar parser and our ABNF grammar abstractor to turn the grammar in the grammar.abnf file into an ACL2 representation.

We use ACL2::add-const-to-untranslate-preprocess to keep this constant unexpanded in output.

We show that the grammar is well-formed, closed, and ASCII.

Definitions and Theorems

Function: untranslate-preprocess-*grammar*

(defun untranslate-preprocess-*grammar* (acl2::term acl2::wrld)
  (if (equal acl2::term (list 'quote *grammar*))
      '*grammar*
    (abnf::untranslate-preprocess-*grammar* acl2::term acl2::wrld)))

Theorem: rulelist-wfp-of-*grammar*

(defthm rulelist-wfp-of-*grammar*
  (abnf::rulelist-wfp *grammar*))

Theorem: rulelist-closedp-of-*grammar*

(defthm rulelist-closedp-of-*grammar*
  (abnf::rulelist-closedp *grammar*))

Theorem: ascii-only-*grammar*

(defthm ascii-only-*grammar*
  (abnf::rulelist-in-termset-p *grammar*
                               (acl2::integers-from-to 0 127)))

Subtopics

*grammar*-tree-operations
Tree operations specialized to *grammar*.