• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Acre
    • Milawa
    • Smtlink
    • Aleobft
    • Abnf
      • Deftreeops
      • Defdefparse
      • Defgrammar
      • Abnf-tree-utilities
      • Notation
        • Syntax-abstraction
          • Abstract-repeat
          • Abstract-bin/dec/hex-val-rest-dot-p
          • Abstract-*digit-star-*digit
          • Abstract-*-grouped-terminal
          • Abstract-case-insensitive-string
          • Abstract-grouped-terminals
          • Abstract-hexdig
          • Abstract-hex-val-rest
          • Abstract-grouped-terminal
          • Abstract-dec-val-rest
          • Abstract-bin-val-rest
          • Abstract-rulename
          • Abstract-*hexdig
          • Abstract-*digit
          • Abstract-terminals
          • Abstract-terminal
          • Abstract-rule-/-*cwsp-cnl
          • Abstract-digit
          • Abstract-bin/dec/hex-val
          • Abstract-?repeat
          • Abstract-*bit
          • Abstract-rule
          • Abstract-hex-val
          • Abstract-dec-val
          • Abstract-char-val
          • Abstract-bin-val
          • Abstract-alpha/digit/dash
          • Abstract-*-rule-/-*cwsp-cnl
          • Abstract-*-alpha/digit/dash
          • Abstract-quoted-string
          • Abstract-prose-val
          • Abstract-defined-as
          • Abstract-case-sensitive-string
          • Abstract-bit
          • Abstract-*-dot-1*hexdig
          • Abstract-*-dot-1*digit
          • Abstract-*-dot-1*bit
          • Abstract-rulelist
          • Abstract-num-val
          • Abstract-element
          • Abstract-dot/dash-1*hexdig
          • Abstract-dot/dash-1*digit
          • Abstract-elements
          • Abstract-dot/dash-1*bit
          • Abstract-alpha
          • Abstract-repetition
          • Abstract-concatenation
          • Abstract-conc-rest
          • Abstract-alternation
          • Abstract-alt-rest
          • Abstract-group/option
          • Abstract-fail
          • Abstract-conc-rest-comp
          • Abstract-alt-rest-comp
        • Semantics
        • Abstract-syntax
        • Core-rules
        • Concrete-syntax
      • Grammar-parser
      • Meta-circular-validation
      • Parsing-primitives-defresult
      • Parsing-primitives-seq
      • Operations
      • 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

• Syntax-abstraction

Abstract-defined-as

A defined-as parse tree is abstracted to the boolean indicating whether the rule is incremental or not.

Signature

(abstract-defined-as tree) → incremental

Arguments

tree — Guard (treep tree).

Returns

incremental — Type (booleanp incremental).

Definitions and Theorems

Function: abstract-defined-as

(defun abstract-defined-as (tree)
  (declare (xargs :guard (treep tree)))
  (b* (((fun (fail)) (abstract-fail))
       ((unless (tree-case tree :nonleaf))
        (fail))
       (treess (tree-nonleaf->branches tree))
       ((unless (and (consp treess)
                     (consp (cdr treess))))
        (fail))
       (trees (cadr treess))
       ((unless (consp trees)) (fail))
       (subtree (car trees))
       (nats (abstract-grouped-terminals subtree)))
    (not (equal nats (list (char-code #\=))))))

Theorem: booleanp-of-abstract-defined-as

(defthm booleanp-of-abstract-defined-as
  (b* ((incremental (abstract-defined-as tree)))
    (booleanp incremental))
  :rule-classes :rewrite)