• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Acre
    • Milawa
    • Smtlink
    • Aleobft
    • Abnf
      • Deftreeops
      • Defdefparse
      • Defgrammar
      • Abnf-tree-utilities
      • Notation
      • Grammar-parser
      • Meta-circular-validation
      • Parsing-primitives-defresult
      • Parsing-primitives-seq
      • Operations
        • In-terminal-set
        • Well-formedness
        • Closure
        • Plugging
        • Ambiguity
        • Renaming
        • Numeric-range-retrieval
        • Rule-utilities
          • Rule-simple-subs
          • Rulenames-from-singular-conc-and-rep
        • Removal
        • Character-value-retrieval
      • Examples
      • Differences-with-paper
      • Grammar-printer
      • Parsing-tools
    • Vwsim
    • Isar
    • Wp-gen
    • Dimacs-reader
    • Pfcs
    • Legacy-defrstobj
    • Proof-checker-array
    • Soft
    • Farray
    • Rp-rewriter
    • Instant-runoff-voting
    • Imp-language
    • Sidekick
    • Leftist-trees
    • C
    • Java
    • Taspi
    • Bitcoin
    • Des
    • Ethereum
    • X86isa
    • Sha-2
    • Yul
    • Riscv
    • Zcash
    • Proof-checker-itp13
    • Regex
    • ACL2-programming-language
    • Json
    • Jfkr
    • Equational
    • Cryptography
    • Poseidon
    • Where-do-i-place-my-book
    • Bigmems
    • Builtins
    • Axe
    • Execloader
    • Solidity
    • Leo
    • Paco
    • Concurrent-programs
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Rule-utilities

Rule-simple-subs

See if a rule could be used to define a type/subtype relationship.

Signature

(rule-simple-subs rule-name grammar) → sub-rule-names

Arguments

rule-name — Guard (common-lisp::stringp rule-name).

grammar — Guard (rulelistp grammar).

Returns

sub-rule-names — Type (acl2::string-list-resultp sub-rule-names).

This uses a very restrictive definition of whether the rule names in a rule are being used like a type/subtype relationship:

• There must be only one rule with the given name in grammar.
• It is not an incremental rule.
• The rule must consist solely of an alternation of unadorned rule names. By unadorned we mean the concatenation and repetition are singular in the abstract syntax.

For example:

integer-type = unsigned-type / signed-type

If all of the requirements are satisified, the return value is a list of the "sub" rulenames. Otherwise a reserrp is returned.

Definitions and Theorems

Function: rule-simple-subs

(defun rule-simple-subs (rule-name grammar)
 (declare (xargs :guard (and (common-lisp::stringp rule-name)
                             (rulelistp grammar))))
 (let ((__function__ 'rule-simple-subs))
   (declare (ignorable __function__))
   (b* (((mv rules ?not-rules)
         (rules-of-name (rulename (acl2::str-fix rule-name))
                        grammar))
        ((unless (equal (len rules) 1))
         (reserrf (cons :not-exactly-one-rule-with-name rule-name)))
        (the-rule (car rules))
        ((when (rule->incremental the-rule))
         (reserrf (cons :the-rule-is-incremental the-rule)))
        (alt (rule->definiens the-rule))
        ((unless (alternationp alt))
         (reserrf (cons :impossible alt))))
     (rulenames-from-singular-conc-and-rep
          (rule->definiens the-rule)))))

Theorem: string-list-resultp-of-rule-simple-subs

(defthm string-list-resultp-of-rule-simple-subs
  (b* ((sub-rule-names (rule-simple-subs rule-name grammar)))
    (acl2::string-list-resultp sub-rule-names))
  :rule-classes :rewrite)