863 lines
37 KiB
Scheme
863 lines
37 KiB
Scheme
#|
|
|
|
|
redex: disallow non-terminals on rhs of rules unless they are actually bound(?)
|
|
|
|
need support for:
|
|
- collecting statistics
|
|
- simplifying test cases
|
|
|
|
To do a better job of not generating programs with free variables,
|
|
keep track of which forms introduce binders
|
|
and prefer to generate that before generating any variables
|
|
(also get rid of kludge, as below)
|
|
|
|
|#
|
|
|
|
#lang scheme
|
|
|
|
(require "matcher.ss"
|
|
"reduction-semantics.ss"
|
|
"underscore-allowed.ss"
|
|
"term.ss"
|
|
"error.ss"
|
|
"struct.ss"
|
|
(for-syntax "rewrite-side-conditions.ss")
|
|
(for-syntax "term-fn.ss")
|
|
(for-syntax "reduction-semantics.ss")
|
|
mrlib/tex-table)
|
|
|
|
(define (allow-free-var? [random random]) (= 0 (random 30)))
|
|
(define (exotic-choice? [random random]) (= 0 (random 5)))
|
|
(define (use-lang-literal? [random random]) (= 0 (random 20)))
|
|
(define (preferred-production? attempt [random random])
|
|
(and (>= attempt preferred-production-threshold)
|
|
(zero? (random 2))))
|
|
(define (try-to-introduce-binder?) (= 0 (random 2)) #f)
|
|
|
|
;; unique-chars : (listof string) -> (listof char)
|
|
(define (unique-chars strings)
|
|
(let ([uniq (make-hasheq)])
|
|
(for ([lit strings])
|
|
(for ([char lit])
|
|
(hash-set! uniq char #t)))
|
|
(hash-map uniq (λ (k v) k))))
|
|
|
|
(define generation-retries 100)
|
|
|
|
(define default-check-attempts 100)
|
|
|
|
(define ascii-chars-threshold 50)
|
|
(define tex-chars-threshold 500)
|
|
(define chinese-chars-threshold 2000)
|
|
|
|
(define preferred-production-threshold 3000)
|
|
|
|
(define (pick-var lang-chars lang-lits bound-vars attempt [random random])
|
|
(if (or (null? bound-vars) (allow-free-var? random))
|
|
(let ([length (add1 (random-natural 4/5 random))])
|
|
(string->symbol (random-string lang-chars lang-lits length attempt random)))
|
|
(pick-from-list bound-vars random)))
|
|
|
|
(define (pick-char attempt lang-chars [random random])
|
|
(if (and (not (null? lang-chars))
|
|
(or (< attempt ascii-chars-threshold)
|
|
(not (exotic-choice? random))))
|
|
(pick-from-list lang-chars random)
|
|
(if (or (< attempt tex-chars-threshold) (not (exotic-choice? random)))
|
|
(let ([i (random (- #x7E #x20 1))]
|
|
[_ (- (char->integer #\_) #x20)])
|
|
(integer->char (+ #x20 (if (= i _) (add1 i) i))))
|
|
(if (or (< attempt chinese-chars-threshold) (not (exotic-choice? random)))
|
|
(car (string->list (pick-from-list (map cadr tex-shortcut-table) random)))
|
|
(integer->char (+ #x4E00 (random (- #x9FCF #x4E00))))))))
|
|
|
|
(define (random-string lang-chars lang-lits length attempt [random random])
|
|
(if (and (not (null? lang-lits)) (use-lang-literal? random))
|
|
(pick-from-list lang-lits random)
|
|
(list->string (build-list length (λ (_) (pick-char attempt lang-chars random))))))
|
|
|
|
(define (pick-any lang sexp [random random])
|
|
(let ([c-lang (rg-lang-clang lang)]
|
|
[c-sexp (rg-lang-clang sexp)])
|
|
(if (and (not (null? (compiled-lang-lang c-lang))) (zero? (random 5)))
|
|
(values lang (pick-from-list (map nt-name (compiled-lang-lang c-lang)) random))
|
|
(values sexp (nt-name (car (compiled-lang-lang c-sexp)))))))
|
|
|
|
(define (pick-string lang-chars lang-lits attempt [random random])
|
|
(random-string lang-chars lang-lits (random-natural 1/5 random) attempt random))
|
|
|
|
(define ((pick-nt pref-prods [random random]) name lang bound-vars attempt)
|
|
(let* ([prods (nt-rhs (nt-by-name lang name))]
|
|
[binders (filter (λ (x) (not (null? (rhs-var-info x)))) prods)]
|
|
[do-intro-binder? (and (null? bound-vars)
|
|
(not (null? binders))
|
|
(try-to-introduce-binder?))])
|
|
(cond [do-intro-binder? binders]
|
|
[(and (not (eq? lang sexp))
|
|
(preferred-production? attempt random))
|
|
(hash-ref pref-prods name)]
|
|
[else prods])))
|
|
|
|
(define (pick-from-list l [random random]) (list-ref l (random (length l))))
|
|
|
|
;; Chooses a random (exact) natural number from the "shifted" geometric distribution:
|
|
;; P(random-natural = k) = p(1-p)^k
|
|
;;
|
|
;; P(random-natural >= k) = (1-p)^(k+1)
|
|
;; E(random-natural) = (1-p)/p
|
|
;; Var(random-natural) = (1-p)/p^2
|
|
(define (random-natural p [random random])
|
|
(sub1 (inexact->exact (ceiling (real-part (/ (log (random)) (log (- 1 p))))))))
|
|
|
|
(define (negative? random)
|
|
(zero? (random 2)))
|
|
|
|
(define (random-integer p [random random])
|
|
(* (if (negative? random) -1 1) (random-natural p random)))
|
|
|
|
(define (random-rational p [random random])
|
|
(/ (random-integer p random) (add1 (random-natural p random))))
|
|
|
|
(define (random-real p [random random])
|
|
(* (random) 2 (random-integer p random)))
|
|
|
|
(define (random-complex p [random random])
|
|
(let ([randoms (list random-integer random-rational random-real)])
|
|
(make-rectangular ((pick-from-list randoms random) p random)
|
|
((pick-from-list randoms random) p random))))
|
|
|
|
(define integer-threshold 100)
|
|
(define rational-threshold 500)
|
|
(define real-threshold 1000)
|
|
(define complex-threshold 2000)
|
|
|
|
;; Determines the parameter p for which random-natural's expected value is E
|
|
(define (expected-value->p E)
|
|
;; E = 0 => p = 1, which breaks random-natural
|
|
(/ 1 (+ (max 1 E) 1)))
|
|
|
|
; Determines a size measure for numbers, sequences, etc., using the
|
|
; attempt count.
|
|
(define (attempt->size n)
|
|
(inexact->exact (floor (/ (log (add1 n)) (log 5)))))
|
|
|
|
(define (pick-number attempt [random random])
|
|
(cond [(or (< attempt integer-threshold) (not (exotic-choice? random)))
|
|
(random-natural (expected-value->p (attempt->size attempt)) random)]
|
|
[(or (< attempt rational-threshold) (not (exotic-choice? random)))
|
|
(random-integer (expected-value->p (attempt->size (- attempt integer-threshold))) random)]
|
|
[(or (< attempt real-threshold) (not (exotic-choice? random)))
|
|
(random-rational (expected-value->p (attempt->size (- attempt rational-threshold))) random)]
|
|
[(or (< attempt complex-threshold) (not (exotic-choice? random)))
|
|
(random-real (expected-value->p (attempt->size (- attempt real-threshold))) random)]
|
|
[else (random-complex (expected-value->p (attempt->size (- attempt complex-threshold))) random)]))
|
|
|
|
(define (pick-sequence-length attempt)
|
|
(random-natural (expected-value->p (attempt->size attempt))))
|
|
|
|
(define (zip . lists)
|
|
(apply (curry map list) lists))
|
|
|
|
(define (min-prods nt base-table)
|
|
(let* ([sizes (hash-ref base-table (nt-name nt))]
|
|
[min-size (apply min/f sizes)])
|
|
(map cadr (filter (λ (x) (equal? min-size (car x))) (zip sizes (nt-rhs nt))))))
|
|
|
|
(define-struct rg-lang (clang lits chars base-table))
|
|
(define (prepare-lang lang)
|
|
(let ([lits (map symbol->string (compiled-lang-literals lang))])
|
|
(make-rg-lang (parse-language lang) lits (unique-chars lits) (find-base-cases lang))))
|
|
|
|
(define (generate lang decisions@)
|
|
(define-values/invoke-unit decisions@
|
|
(import) (export decisions^))
|
|
|
|
(define ((generate-nt lang generate base-table) name fvt-id bound-vars size attempt in-hole state)
|
|
(let*-values
|
|
([(bound-vars) (append (extract-bound-vars fvt-id state) bound-vars)]
|
|
[(term _)
|
|
(generate/pred
|
|
name
|
|
(λ ()
|
|
(let ([rhs (pick-from-list
|
|
(if (zero? size)
|
|
(min-prods (nt-by-name lang name) base-table)
|
|
((next-non-terminal-decision) name lang bound-vars attempt)))])
|
|
(generate bound-vars (max 0 (sub1 size)) attempt
|
|
(make-state (map fvt-entry (rhs-var-info rhs)) #hash())
|
|
in-hole (rhs-pattern rhs))))
|
|
(λ (_ env) (mismatches-satisfied? env)))])
|
|
(values term (extend-found-vars fvt-id term state))))
|
|
|
|
(define (generate-sequence ellipsis generate state length)
|
|
(define (split-environment env)
|
|
(foldl (λ (var seq-envs)
|
|
(let ([vals (hash-ref env var #f)])
|
|
(if vals
|
|
(map (λ (seq-env val) (hash-set seq-env var val)) seq-envs vals)
|
|
seq-envs)))
|
|
(build-list length (λ (_) #hash())) (ellipsis-vars ellipsis)))
|
|
(define (merge-environments seq-envs)
|
|
(foldl (λ (var env)
|
|
(hash-set env var (map (λ (seq-env) (hash-ref seq-env var)) seq-envs)))
|
|
(state-env state) (ellipsis-vars ellipsis)))
|
|
(let-values
|
|
([(seq envs fvt)
|
|
(let recur ([fvt (state-fvt state)]
|
|
[envs (split-environment (state-env state))])
|
|
(if (null? envs)
|
|
(values null null fvt)
|
|
(let*-values
|
|
([(term state) (generate (make-state fvt (car envs)) the-hole (ellipsis-pattern ellipsis))]
|
|
[(terms envs fvt) (recur (state-fvt state) (cdr envs))])
|
|
(values (cons term terms) (cons (state-env state) envs) fvt))))])
|
|
(values seq (make-state fvt (merge-environments envs)))))
|
|
|
|
(define (generate/pred name gen pred)
|
|
(let retry ([remaining generation-retries])
|
|
(if (zero? remaining)
|
|
(error 'generate "unable to generate pattern ~s in ~s attempts"
|
|
name generation-retries)
|
|
(let-values ([(term state) (gen)])
|
|
(if (pred term (state-env state))
|
|
(values term state)
|
|
(retry (sub1 remaining)))))))
|
|
|
|
(define (generate/prior name state generate)
|
|
(let* ([none (gensym)]
|
|
[prior (hash-ref (state-env state) name none)])
|
|
(if (eq? prior none)
|
|
(let-values ([(term state) (generate)])
|
|
(values term (set-env state name term)))
|
|
(values prior state))))
|
|
|
|
(define (mismatches-satisfied? env)
|
|
(let ([groups (make-hasheq)])
|
|
(define (get-group group)
|
|
(hash-ref groups group
|
|
(λ ()
|
|
(let ([vals (make-hash)])
|
|
(hash-set! groups group vals)
|
|
vals))))
|
|
(for/and ([(name val) env])
|
|
(or (not (mismatch? name))
|
|
(let ([prior (get-group (mismatch-group name))])
|
|
(and (not (hash-ref prior val #f))
|
|
(hash-set! prior val #t)))))))
|
|
|
|
(define-struct state (fvt env))
|
|
(define new-state (make-state null #hash()))
|
|
(define (set-env state name value)
|
|
(make-state (state-fvt state) (hash-set (state-env state) name value)))
|
|
|
|
(define (bindings env)
|
|
(make-bindings
|
|
(for/fold ([bindings null]) ([(key val) env])
|
|
(if (binder? key)
|
|
(cons (make-bind (binder-name key) val) bindings)
|
|
bindings))))
|
|
|
|
(define-struct found-vars (nt source bound-vars found-nt?))
|
|
(define (fvt-entry binds)
|
|
(make-found-vars (binds-binds binds) (binds-source binds) '() #f))
|
|
|
|
(define (generate-pat lang sexp bound-vars size attempt state in-hole pat)
|
|
(define recur (curry generate-pat lang sexp bound-vars size attempt))
|
|
(define recur/pat (recur state in-hole))
|
|
|
|
(define clang (rg-lang-clang lang))
|
|
(define gen-nt (generate-nt clang (curry generate-pat lang sexp) (rg-lang-base-table lang)))
|
|
|
|
(match pat
|
|
[`number (values ((next-number-decision) attempt) state)]
|
|
[`(variable-except ,vars ...)
|
|
(generate/pred 'variable
|
|
(λ () (recur/pat 'variable))
|
|
(λ (var _) (not (memq var vars))))]
|
|
[`variable
|
|
(values ((next-variable-decision)
|
|
(rg-lang-chars lang) (rg-lang-lits lang) bound-vars attempt)
|
|
state)]
|
|
[`variable-not-otherwise-mentioned
|
|
(generate/pred 'variable
|
|
(λ () (recur/pat 'variable))
|
|
(λ (var _) (not (memq var (compiled-lang-literals clang)))))]
|
|
[`(variable-prefix ,prefix)
|
|
(define (symbol-append prefix suffix)
|
|
(string->symbol (string-append (symbol->string prefix) (symbol->string suffix))))
|
|
(let-values ([(term state) (recur/pat 'variable)])
|
|
(values (symbol-append prefix term) state))]
|
|
[`string
|
|
(values ((next-string-decision) (rg-lang-chars lang) (rg-lang-lits lang) attempt)
|
|
state)]
|
|
[`(side-condition ,pat ,(? procedure? condition))
|
|
(generate/pred (unparse-pattern pat)
|
|
(λ () (recur/pat pat))
|
|
(λ (_ env) (condition (bindings env))))]
|
|
[`(name ,(? symbol? id) ,p)
|
|
(let-values ([(term state) (recur/pat p)])
|
|
(values term (set-env state (make-binder id) term)))]
|
|
[`hole (values in-hole state)]
|
|
[`(in-hole ,context ,contractum)
|
|
(let-values ([(term state) (recur/pat contractum)])
|
|
(recur state term context))]
|
|
[`(hide-hole ,pattern) (recur state the-hole pattern)]
|
|
[`any
|
|
(let*-values ([(lang nt) ((next-any-decision) lang sexp)]
|
|
[(term _) (generate-pat lang sexp null size attempt new-state the-hole nt)])
|
|
(values term state))]
|
|
[(? (is-nt? clang))
|
|
(gen-nt pat pat bound-vars size attempt in-hole state)]
|
|
[(struct binder ((and name (or (? (is-nt? clang) nt) (app (symbol-match named-nt-rx) (? (is-nt? clang) nt))))))
|
|
(generate/prior pat state (λ () (gen-nt nt name bound-vars size attempt in-hole state)))]
|
|
[(struct binder ((or (? built-in? b) (app (symbol-match named-nt-rx) (? built-in? b)))))
|
|
(generate/prior pat state (λ () (recur/pat b)))]
|
|
[(struct mismatch (name (app (symbol-match mismatch-nt-rx) (? symbol? (? (is-nt? clang) nt)))))
|
|
(let-values ([(term state) (gen-nt nt pat bound-vars size attempt in-hole state)])
|
|
(values term (set-env state pat term)))]
|
|
[(struct mismatch (name (app (symbol-match mismatch-nt-rx) (? symbol? (? built-in? b)))))
|
|
(let-values ([(term state) (recur/pat b)])
|
|
(values term (set-env state pat term)))]
|
|
[`(cross ,(? symbol? cross-nt))
|
|
(gen-nt cross-nt #f bound-vars size attempt in-hole state)]
|
|
[(or (? symbol?) (? number?) (? string?) (? boolean?) (? null?)) (values pat state)]
|
|
[(list-rest (and (struct ellipsis (name sub-pat class vars)) ellipsis) rest)
|
|
(let*-values ([(length) (let ([prior (hash-ref (state-env state) class #f)])
|
|
(if prior prior ((next-sequence-decision) attempt)))]
|
|
[(seq state) (generate-sequence ellipsis recur state length)]
|
|
[(rest state) (recur (set-env (set-env state class length) name length)
|
|
in-hole rest)])
|
|
(values (append seq rest) state))]
|
|
[(list-rest pat rest)
|
|
(let*-values
|
|
([(pat-term state) (recur/pat pat)]
|
|
[(rest-term state) (recur state in-hole rest)])
|
|
(values (cons pat-term rest-term) state))]
|
|
[else
|
|
(error 'generate "unknown pattern ~s\n" pat)]))
|
|
|
|
(define (extract-bound-vars pat state)
|
|
(let loop ([found-vars-table (state-fvt state)])
|
|
(cond
|
|
[(null? found-vars-table) '()]
|
|
[else (let ([found-vars (car found-vars-table)])
|
|
(if (eq? pat (found-vars-nt found-vars))
|
|
(found-vars-bound-vars found-vars)
|
|
(loop (cdr found-vars-table))))])))
|
|
|
|
(define (extend-found-vars pat res state)
|
|
(make-state
|
|
(map
|
|
(λ (found-vars)
|
|
(cond
|
|
[(eq? (found-vars-source found-vars) pat)
|
|
(let ([new-found-vars
|
|
(make-found-vars (found-vars-nt found-vars)
|
|
(found-vars-source found-vars)
|
|
(cons res (found-vars-bound-vars found-vars))
|
|
#f)])
|
|
(when (found-vars-found-nt? found-vars)
|
|
(error 'generate "kludge in #:binds was exposed! #:binds ~s ~s"
|
|
(found-vars-nt found-vars)
|
|
(found-vars-source found-vars)))
|
|
new-found-vars)]
|
|
[(eq? (found-vars-nt found-vars) pat)
|
|
(make-found-vars (found-vars-nt found-vars)
|
|
(found-vars-source found-vars)
|
|
(found-vars-bound-vars found-vars)
|
|
#t)]
|
|
[else found-vars]))
|
|
(state-fvt state))
|
|
(state-env state)))
|
|
|
|
(let ([rg-lang (prepare-lang lang)]
|
|
[rg-sexp (prepare-lang sexp)])
|
|
(λ (pat)
|
|
(let ([parsed (reassign-classes (parse-pattern pat lang 'top-level))])
|
|
(λ (size attempt)
|
|
(let-values ([(term state)
|
|
(generate/pred
|
|
pat
|
|
(λ ()
|
|
(generate-pat rg-lang rg-sexp null size attempt
|
|
new-state the-hole parsed))
|
|
(λ (_ env) (mismatches-satisfied? env)))])
|
|
(values term (bindings (state-env state)))))))))
|
|
|
|
;; find-base-cases : compiled-language -> hash-table
|
|
(define (find-base-cases lang)
|
|
(define nt-table (make-hasheq))
|
|
(define changed? #f)
|
|
(define (nt-get nt) (hash-ref nt-table nt 'inf))
|
|
(define (nt-set nt new)
|
|
(let ([old (nt-get nt)])
|
|
(unless (equal? new old)
|
|
(set! changed? #t)
|
|
(hash-set! nt-table nt new))))
|
|
|
|
(define (process-nt nt)
|
|
(nt-set (nt-name nt) (apply min/f (map process-rhs (nt-rhs nt)))))
|
|
|
|
(define (process-rhs rhs)
|
|
(let ([nts (rhs->nts (rhs-pattern rhs))])
|
|
(if (null? nts)
|
|
0
|
|
(add1/f (apply max/f (map nt-get nts))))))
|
|
|
|
;; rhs->path : pattern -> (listof symbol)
|
|
;; determines all of the non-terminals in a pattern
|
|
(define (rhs->nts pat)
|
|
(let ([nts '()])
|
|
(let loop ([pat pat])
|
|
(match pat
|
|
[(? symbol? pat)
|
|
(when ((is-nt? lang) (symbol->nt pat))
|
|
(set! nts (cons (symbol->nt pat) nts)))]
|
|
[`(cross ,(? symbol? x-nt))
|
|
(set! nts (cons x-nt nts))]
|
|
[`() (void)]
|
|
[(struct ellipsis (_ p _ _))
|
|
(loop p)]
|
|
[`(,a . ,b)
|
|
(loop a)
|
|
(loop b)]
|
|
[_ (void)]))
|
|
nts))
|
|
|
|
(let ([nts (append (compiled-lang-lang lang) (compiled-lang-cclang lang))])
|
|
(let loop ()
|
|
(set! changed? #f)
|
|
(for-each process-nt nts)
|
|
(when changed?
|
|
(loop)))
|
|
|
|
(let ([ht (make-hash)])
|
|
(for-each
|
|
(λ (nt) (hash-set! ht (nt-name nt) (map process-rhs (nt-rhs nt))))
|
|
nts)
|
|
ht)))
|
|
|
|
(define min/f
|
|
(case-lambda
|
|
[(a) a]
|
|
[(a b)
|
|
(cond
|
|
[(eq? a 'inf) b]
|
|
[(eq? b 'inf) a]
|
|
[else (min a b)])]
|
|
[(a b . c) (min/f a (apply min/f b c))]))
|
|
(define max/f
|
|
(case-lambda
|
|
[(a) a]
|
|
[(a b)
|
|
(cond
|
|
[(eq? a 'inf) a]
|
|
[(eq? b 'inf) b]
|
|
[else (max a b)])]
|
|
[(a b . c) (max/f a (apply max/f b c))]))
|
|
(define (add1/f a) (if (eq? a 'inf) 'inf (+ a 1)))
|
|
|
|
;; is-nt? : compiled-lang any -> boolean
|
|
(define ((is-nt? lang) x)
|
|
(and (hash-ref (compiled-lang-ht lang) x #f) #t))
|
|
|
|
;; built-in? : any -> boolean
|
|
(define (built-in? x)
|
|
(and (memq x underscore-allowed) #t))
|
|
|
|
;; nt-by-name : lang symbol -> nt
|
|
(define (nt-by-name lang name)
|
|
(findf (λ (nt) (eq? name (nt-name nt)))
|
|
(append (compiled-lang-lang lang)
|
|
(compiled-lang-cclang lang))))
|
|
|
|
(define named-nt-rx #rx"^([^_]+)_[^_]*$")
|
|
(define mismatch-nt-rx #rx"([^_]+)_!_[^_]*$")
|
|
(define named-ellipsis-rx #rx"^\\.\\.\\._[^_]*$")
|
|
(define mismatch-ellipsis-rx #rx"^\\.\\.\\._!_[^_]*$")
|
|
|
|
;; symbol-match : regexp -> any -> (or/c false symbol)
|
|
;; Returns the sub-symbol matching the sub-pattern inside
|
|
;; the first capturing parens.
|
|
(define ((symbol-match rx) x)
|
|
(and (symbol? x)
|
|
(let ([match (regexp-match rx (symbol->string x))])
|
|
(and match (cadr match) (string->symbol (cadr match))))))
|
|
|
|
(define-struct class (id) #:inspector (make-inspector))
|
|
(define-struct mismatch (id group) #:inspector (make-inspector))
|
|
(define-struct binder (name) #:inspector (make-inspector))
|
|
|
|
;; name: (or/c symbol? mismatch?)
|
|
;; The generator records `name' in the environment when generating an ellipsis,
|
|
;; to enforce sequence length constraints.
|
|
;; class: class?
|
|
;; When one binding appears under two (non-nested) ellipses, the sequences generated
|
|
;; must have the same length; `class' groups ellipses to reflect this constraint.
|
|
;; var: (list/c (or/c symbol? class? mismatch? binder?))
|
|
;; the bindings within an ellipses, used to split and merge the environment before
|
|
;; and after generating an ellipsis
|
|
(define-struct ellipsis (name pattern class vars) #:inspector (make-inspector))
|
|
|
|
;; parse-pattern : pattern compiled-lang (or/c 'cross 'top-level 'grammar) -> parsed-pattern
|
|
;; Turns "pat ...", "pat ..._id", and "pat ..._!_id" into ellipsis structs,
|
|
;; "nt_!_id" into mismatch structs, "nt_id" into binder structs, and
|
|
;; "nt/underscore-allowed" in top-level patterns into binder structs.
|
|
(define (parse-pattern pattern lang mode)
|
|
(define (recur pat vars)
|
|
(match pat
|
|
[(or (app (symbol-match named-nt-rx) (or (? (is-nt? lang)) (? built-in?)))
|
|
(and (? (λ (_) (eq? mode 'top-level))) (or (? (is-nt? lang)) (? built-in?))))
|
|
(let ([b (make-binder pat)])
|
|
(values b (cons b vars)))]
|
|
[(app (symbol-match mismatch-nt-rx) (or (? (is-nt? lang)) (? built-in?)))
|
|
(let ([mismatch (make-mismatch (gensym) pat)])
|
|
(values mismatch (cons mismatch vars)))]
|
|
[`(name ,name ,sub-pat)
|
|
(let-values ([(parsed vars) (recur sub-pat vars)])
|
|
(values `(name ,name ,parsed) (cons (make-binder name) vars)))]
|
|
[(list-rest sub-pat (and (? symbol?) (app symbol->string (regexp named-ellipsis-rx)) name) rest)
|
|
(let*-values ([(sub-pat-parsed sub-pat-vars) (recur sub-pat null)]
|
|
[(seq) (make-ellipsis name sub-pat-parsed (make-class name) sub-pat-vars)]
|
|
[(vars) (append (list* name (make-class name) sub-pat-vars) vars)]
|
|
[(rest-parsed vars) (recur rest vars)])
|
|
(values (cons seq rest-parsed) vars))]
|
|
[(list-rest sub-pat '... rest)
|
|
(let*-values ([(sub-pat-parsed sub-pat-vars) (recur sub-pat null)]
|
|
[(class) (make-class (gensym))]
|
|
[(seq) (make-ellipsis '... sub-pat-parsed class sub-pat-vars)]
|
|
[(rest-parsed vars) (recur rest (cons class (append sub-pat-vars vars)))])
|
|
(values (cons seq rest-parsed) vars))]
|
|
[(list-rest sub-pat (and (? symbol?) (app symbol->string (regexp mismatch-ellipsis-rx)) name) rest)
|
|
(let*-values ([(sub-pat-parsed sub-pat-vars) (recur sub-pat null)]
|
|
[(mismatch) (make-mismatch (gensym) name)]
|
|
[(class) (make-class (gensym))]
|
|
[(seq) (make-ellipsis mismatch sub-pat-parsed class sub-pat-vars)]
|
|
[(vars) (append (list* class mismatch sub-pat-vars) vars)]
|
|
[(rest-parsed vars) (recur rest vars)])
|
|
(values (cons seq rest-parsed) vars))]
|
|
[(and (? (λ (_) (not (eq? mode 'cross)))) `(cross ,(and (? (is-nt? lang)) nt)))
|
|
(let ([nt-str (symbol->string nt)])
|
|
(values `(cross ,(string->symbol (string-append nt-str "-" nt-str))) vars))]
|
|
[(cons first rest)
|
|
(let-values ([(first-parsed vars) (recur first vars)])
|
|
(let-values ([(rest-parsed vars) (recur rest vars)])
|
|
(values (cons first-parsed rest-parsed) vars)))]
|
|
[_ (values pat vars)]))
|
|
(let-values ([(parsed _) (recur pattern null)])
|
|
parsed))
|
|
|
|
;; parse-language: compiled-lang -> compiled-lang
|
|
(define (parse-language lang)
|
|
(define ((parse-nt mode) nt)
|
|
(make-nt (nt-name nt) (map (parse-rhs mode) (nt-rhs nt))))
|
|
(define ((parse-rhs mode) rhs)
|
|
(make-rhs (reassign-classes (parse-pattern (rhs-pattern rhs) lang mode))
|
|
(rhs-var-info rhs)))
|
|
(struct-copy
|
|
compiled-lang lang
|
|
[lang (map (parse-nt 'grammar) (compiled-lang-lang lang))]
|
|
[cclang (map (parse-nt 'top-level) (compiled-lang-cclang lang))]))
|
|
|
|
;; unparse-pattern: parsed-pattern -> pattern
|
|
(define unparse-pattern
|
|
(match-lambda
|
|
[(struct binder (name)) name]
|
|
[(struct mismatch (_ group)) group]
|
|
[(list-rest (struct ellipsis (name sub-pat _ _)) rest)
|
|
(let ([ellipsis (if (mismatch? name) (mismatch-group name) name)])
|
|
(list* (unparse-pattern sub-pat) ellipsis (unparse-pattern rest)))]
|
|
[(cons first rest)
|
|
(cons (unparse-pattern first) (unparse-pattern rest))]
|
|
[else else]))
|
|
|
|
;; class-reassignments : parsed-pattern -> hash[sym -o> sym]
|
|
(define (class-reassignments pattern)
|
|
; union-find w/o balancing or path compression (at least for now)
|
|
(define (union e f sets)
|
|
(hash-set sets (find f sets) (find e sets)))
|
|
(define (find e sets)
|
|
(let recur ([chd e] [par (hash-ref sets e #f)])
|
|
(if (and par (not (eq? chd par))) (recur par (hash-ref sets par #f)) chd)))
|
|
|
|
(let* ([last-contexts (make-hasheq)]
|
|
[record-binder
|
|
(λ (pat under assignments)
|
|
(if (null? under)
|
|
assignments
|
|
(let ([last (hash-ref last-contexts pat #f)])
|
|
(if last
|
|
(foldl (λ (cur last asgns) (union cur last asgns)) assignments under last)
|
|
(begin
|
|
(hash-set! last-contexts pat under)
|
|
assignments)))))]
|
|
[assignments
|
|
(let recur ([pat pattern] [under null] [assignments #hasheq()])
|
|
(match pat
|
|
;; `(name ,id ,sub-pat) not considered, since bindings introduced
|
|
;; by name must be unique.
|
|
[(struct binder (name))
|
|
(record-binder name under assignments)]
|
|
[(struct ellipsis (name sub-pat (struct class (cls)) _))
|
|
(recur sub-pat (cons cls under)
|
|
(if (and (symbol? name) (regexp-match named-ellipsis-rx (symbol->string name)))
|
|
(record-binder name under assignments)
|
|
assignments))]
|
|
[(? list?)
|
|
(foldl (λ (pat asgns) (recur pat under asgns)) assignments pat)]
|
|
[_ assignments]))])
|
|
(make-immutable-hasheq (hash-map assignments (λ (cls _) (cons cls (find cls assignments)))))))
|
|
|
|
(define (reassign-classes pattern)
|
|
(let* ([reassignments (class-reassignments pattern)]
|
|
[rewrite (λ (c) (make-class (hash-ref reassignments (class-id c) (class-id c))))])
|
|
(let recur ([pat pattern])
|
|
(match pat
|
|
[(struct ellipsis (name sub-pat class vars))
|
|
(make-ellipsis name (recur sub-pat) (rewrite class)
|
|
(map (λ (v) (if (class? v) (rewrite v) v)) vars))]
|
|
[(? list?) (map recur pat)]
|
|
[_ pat]))))
|
|
|
|
;; used in generating the `any' pattern
|
|
(define-language sexp (sexp variable string number hole (sexp ...)))
|
|
|
|
(define-for-syntax (metafunc name)
|
|
(let ([tf (syntax-local-value name (λ () #f))])
|
|
(and (term-fn? tf) (term-fn-get-id tf))))
|
|
|
|
(define-for-syntax (metafunc/err name stx)
|
|
(let ([m (metafunc name)])
|
|
(if m m (raise-syntax-error #f "not a metafunction" stx name))))
|
|
|
|
(define (assert-nat name x)
|
|
(unless (and (integer? x) (>= x 0))
|
|
(raise-type-error name "natural number" x)))
|
|
|
|
(define-for-syntax (term-generator lang pat decisions what)
|
|
(with-syntax ([pattern
|
|
(rewrite-side-conditions/check-errs
|
|
(language-id-nts lang what)
|
|
what #t pat)]
|
|
[lang lang]
|
|
[decisions decisions])
|
|
(syntax ((generate lang (decisions lang)) `pattern))))
|
|
|
|
(define-syntax (generate-term stx)
|
|
(syntax-case stx ()
|
|
[(_ lang pat size #:attempt attempt)
|
|
(with-syntax ([generate (term-generator #'lang #'pat #'(generation-decisions) 'generate-term)])
|
|
(syntax/loc stx
|
|
(let-values ([(term _) (generate size attempt)])
|
|
term)))]
|
|
[(_ lang pat size)
|
|
(syntax/loc stx (generate-term lang pat size #:attempt 1))]))
|
|
|
|
(define check-randomness (make-parameter random))
|
|
|
|
(define-syntax (redex-check stx)
|
|
(syntax-case stx ()
|
|
[(_ lang pat property . kw-args)
|
|
(let-values ([(names names/ellipses)
|
|
(extract-names (language-id-nts #'lang 'redex-check)
|
|
'redex-check #t #'pat)]
|
|
[(attempts-stx source-stx)
|
|
(let loop ([args (syntax kw-args)]
|
|
[attempts #f]
|
|
[source #f])
|
|
(syntax-case args ()
|
|
[() (values attempts source)]
|
|
[(#:attempts a . rest)
|
|
(not (or attempts (keyword? (syntax-e #'a))))
|
|
(loop #'rest #'a source)]
|
|
[(#:source s . rest)
|
|
(not (or source (keyword? (syntax-e #'s))))
|
|
(loop #'rest attempts #'s)]
|
|
[else (raise-syntax-error #f "bad keyword syntax" stx args)]))])
|
|
(with-syntax ([(name ...) names]
|
|
[(name/ellipses ...) names/ellipses]
|
|
[attempts (or attempts-stx #'default-check-attempts)])
|
|
(quasisyntax/loc stx
|
|
(let ([att attempts])
|
|
(assert-nat 'redex-check att)
|
|
(check-property
|
|
(cons (list #,(term-generator #'lang #'pat #'random-decisions 'redex-check) #f)
|
|
(let ([lang-gen (generate lang (random-decisions lang))])
|
|
#,(if (not source-stx)
|
|
#'null
|
|
#`(let-values
|
|
([(pats srcs src-lang)
|
|
#,(cond [(and (identifier? source-stx) (metafunc source-stx))
|
|
=>
|
|
(λ (m) #`(values (metafunc-proc-lhs-pats #,m)
|
|
(metafunc-srcs #,m)
|
|
(metafunc-proc-lang #,m)))]
|
|
[else
|
|
#`(let ([r #,source-stx])
|
|
(unless (reduction-relation? r)
|
|
(raise-type-error 'redex-check "reduction-relation" r))
|
|
(values
|
|
(map rewrite-proc-lhs (reduction-relation-make-procs r))
|
|
(reduction-relation-srcs r)
|
|
(reduction-relation-lang r)))])])
|
|
(unless (eq? src-lang lang)
|
|
(error 'redex-check "language for secondary source must match primary pattern's language"))
|
|
(zip (map lang-gen pats) srcs)))))
|
|
#,(and source-stx #'(test-match lang pat))
|
|
(λ (generated) (error 'redex-check "~s does not match ~s" generated 'pat))
|
|
(λ (_ bindings)
|
|
(term-let ([name/ellipses (lookup-binding bindings 'name)] ...)
|
|
property))
|
|
att
|
|
(λ (term attempt source port)
|
|
(fprintf port "counterexample found~aafter ~a attempts:\n"
|
|
(if source (format " (~a) " source) " ") attempt)
|
|
(pretty-print term port))
|
|
(check-randomness))
|
|
(void)))))]))
|
|
|
|
(define (check-property gens-srcs match match-fail property attempts display [random random])
|
|
(let loop ([remaining attempts])
|
|
(if (zero? remaining)
|
|
#t
|
|
(let ([attempt (add1 (- attempts remaining))])
|
|
(let*-values ([(generator source)
|
|
(apply values
|
|
(if (and (not (null? (cdr gens-srcs))) (zero? (random 10)))
|
|
(pick-from-list (cdr gens-srcs) random)
|
|
(car gens-srcs)))]
|
|
[(term bindings)
|
|
(generator (attempt->size attempt) attempt)])
|
|
(if (andmap (λ (bindings)
|
|
(with-handlers ([exn:fail? (λ (exn)
|
|
(fprintf (current-error-port)
|
|
"checking ~s raises ~s\n"
|
|
term exn)
|
|
(raise exn))])
|
|
(property term bindings)))
|
|
(cond [(and match (match term))
|
|
=> (curry map (compose make-bindings match-bindings))]
|
|
[match (match-fail term)]
|
|
[else (list bindings)]))
|
|
(loop (sub1 remaining))
|
|
(begin
|
|
(display term attempt source (current-output-port))
|
|
#f)))))))
|
|
|
|
(define-syntax (check-metafunction-contract stx)
|
|
(syntax-case stx ()
|
|
[(_ name)
|
|
(syntax/loc stx
|
|
(check-metafunction-contract name #:attempts default-check-attempts))]
|
|
[(_ name #:attempts attempts)
|
|
(identifier? #'name)
|
|
(with-syntax ([m (metafunc/err #'name stx)])
|
|
(syntax/loc stx
|
|
(let ([lang (metafunc-proc-lang m)]
|
|
[dom (metafunc-proc-dom-pat m)]
|
|
[decisions (generation-decisions)]
|
|
[att attempts])
|
|
(assert-nat 'check-metafunction-contract att)
|
|
(check-property
|
|
(list (list ((generate lang (decisions lang)) (if dom dom '(any (... ...)))) #f))
|
|
#f
|
|
#f
|
|
(λ (t _)
|
|
(with-handlers ([exn:fail:redex? (λ (_) #f)])
|
|
(begin (term (name ,@t)) #t)))
|
|
att
|
|
(λ (term attempt _ port)
|
|
(fprintf port "counterexample found after ~a attempts:\n" attempt)
|
|
(pretty-print term port)))
|
|
(void))))]))
|
|
|
|
(define (check-property-many lang pats srcs prop decisions attempts)
|
|
(let ([lang-gen (generate lang (decisions lang))])
|
|
(for/and ([pat pats] [src srcs])
|
|
(check-property
|
|
(let ([gen (lang-gen pat)])
|
|
(list (list (λ (size attempt) (gen size attempt)) src)))
|
|
#f
|
|
#f
|
|
(λ (term _) (prop term))
|
|
attempts
|
|
(λ (term attempt source port)
|
|
(fprintf port "counterexample found after ~a attempts with ~a:\n"
|
|
attempt source)
|
|
(pretty-print term port))))
|
|
(void)))
|
|
|
|
(define (metafunc-srcs m)
|
|
(build-list (length (metafunc-proc-lhs-pats m))
|
|
(compose (curry format "clause #~s") add1)))
|
|
|
|
(define-syntax (check-metafunction stx)
|
|
(syntax-case stx ()
|
|
[(_ name property)
|
|
(syntax/loc stx (check-metafunction name property #:attempts default-check-attempts))]
|
|
[(_ name property #:attempts attempts)
|
|
(with-syntax ([m (metafunc/err #'name stx)])
|
|
(syntax/loc stx
|
|
(let ([att attempts])
|
|
(assert-nat 'check-metafunction att)
|
|
(check-property-many
|
|
(metafunc-proc-lang m)
|
|
(metafunc-proc-lhs-pats m)
|
|
(metafunc-srcs m)
|
|
property
|
|
(generation-decisions)
|
|
att))))]))
|
|
|
|
(define (reduction-relation-srcs r)
|
|
(map (λ (proc) (or (rewrite-proc-name proc) 'unnamed))
|
|
(reduction-relation-make-procs r)))
|
|
|
|
(define (check-reduction-relation
|
|
relation property
|
|
#:decisions [decisions random-decisions]
|
|
#:attempts [attempts default-check-attempts])
|
|
(check-property-many
|
|
(reduction-relation-lang relation)
|
|
(map rewrite-proc-lhs (reduction-relation-make-procs relation))
|
|
(reduction-relation-srcs relation)
|
|
property
|
|
decisions
|
|
attempts))
|
|
|
|
(define-signature decisions^
|
|
(next-variable-decision
|
|
next-number-decision
|
|
next-non-terminal-decision
|
|
next-sequence-decision
|
|
next-any-decision
|
|
next-string-decision))
|
|
|
|
(define (random-decisions lang)
|
|
(define preferred-productions
|
|
(make-immutable-hasheq
|
|
(map (λ (nt) (cons (nt-name nt) (list (pick-from-list (nt-rhs nt)))))
|
|
(append (compiled-lang-lang lang)
|
|
(compiled-lang-cclang lang)))))
|
|
(unit (import) (export decisions^)
|
|
(define (next-variable-decision) pick-var)
|
|
(define (next-number-decision) pick-number)
|
|
(define (next-non-terminal-decision) (pick-nt preferred-productions))
|
|
(define (next-sequence-decision) pick-sequence-length)
|
|
(define (next-any-decision) pick-any)
|
|
(define (next-string-decision) pick-string)))
|
|
|
|
(define generation-decisions (make-parameter random-decisions))
|
|
|
|
(provide pick-from-list pick-var min-prods decisions^ pick-sequence-length
|
|
is-nt? pick-char random-string pick-string redex-check nt-by-name
|
|
pick-nt unique-chars pick-any sexp generate-term parse-pattern
|
|
class-reassignments reassign-classes unparse-pattern
|
|
(struct-out ellipsis) (struct-out mismatch) (struct-out class)
|
|
(struct-out binder) check-metafunction-contract prepare-lang
|
|
pick-number parse-language check-reduction-relation
|
|
preferred-production-threshold check-metafunction check-randomness
|
|
generation-decisions)
|
|
|
|
(provide/contract
|
|
[find-base-cases (-> compiled-lang? hash?)])
|