(module combinator (lib "lazy.ss" "lazy") (require (lib "unit.ss") (only (lib "etc.ss") opt-lambda)) (require "structs.scm" "parser-sigs.ss" (lib "lex.ss" "parser-tools")) (provide (all-defined)) (define-unit combinators@ (import error-format-parameters^ ranking-parameters^ language-dictionary^) (export combinator-parser-forms^) (define return-name "dummy") ;terminal: ('a -> bool 'a -> 'b string) -> ( (list 'a) -> res ) (define terminal (opt-lambda (pred build name [spell? #f] [case? #f] [class? #f]) (let* ([fail-str (string-append "failed " name)] [t-name (lambda (t) (if src? (token-name (position-token-token t)) (token-name t)))] [t-val (lambda (t) (if src? (token-value (position-token-token t)) (token-value t)))] [spell? (if spell? spell? (lambda (token) (when (position-token? token) (set! token (position-token-token token))) (if (token-value token) (misspelled name (token-value token)) 0)))] [case? (if case? case? (lambda (token) (when (position-token? token) (set! token (position-token-token token))) (and (token-value token) (misscap name (token-value token)))))] [class? (if class? class? (lambda (token) (when (position-token? token) (set! token (position-token-token token))) (missclass name (token-name token))))] [make-fail (lambda (c n k i u) (make-terminal-fail c (if (and src? i) (make-src-lst (position-token-start-pos i) (position-token-end-pos i)) null) n 0 u k (if src? (position-token-token i) i)))] [value (lambda (t) (or (t-val t) name))] [builder (if src? (lambda (token) (build (position-token-token token) (position-token-start-pos token) (position-token-end-pos token))) build)]) (opt-lambda (input [last-src (list 1 0 1 0)] [alts 1]) #;(!!! (printf "terminal ~a~n" name)) #;(!!! (printf "input ~a~n" (pair? input))) #;(!!! (printf "input ~a~n" (null? input))) #;(!!! (cond [(eq? input return-name) (printf "dummy given~n")] [(null? input) (printf "null given~n")] [else (let ([token (!!! ((!!! position-token-token) (!!! (car input))))]) (!!! (printf "Look at token ~a~n" token)) #;(!!! (printf "calling token-name: ~a~n" ((!!! token-name) token))) #;(!!! (printf "calling pred: ~a~n" (pred token))) (!!! (printf "called pred~n")) #;(!!! (printf "car of input ~a~n" (position-token-token (car input)))))])) (cond [(eq? input return-name) name] [(null? input) (fail-res null (make-terminal-fail rank-end last-src name 0 0 'end #f))] [else (let* ([curr-input (car input)] [token (position-token-token curr-input)]) (cond [(pred token) (make-res (list (builder curr-input)) (cdr input) name (value curr-input) 1 #f curr-input)] [else #;(!!! (printf "Incorrect input for ~a : ~a miscase? ~a misspell? ~a ~n" name (cond [(token-value token) (token-value token)] [else (token-name token)]) (case? curr-input) (spell? curr-input))) (fail-res (cdr input) (let-values ([(chance kind may-use) (cond [(case? curr-input) (values rank-caps 'misscase 1)] [(> (spell? curr-input) 3/5) (values (* rank-misspell (spell? curr-input)) 'misspell 1)] [(class? curr-input) (values rank-class 'missclass 1)] [else (values rank-wrong 'wrong 0)])]) (make-fail chance name kind curr-input may-use)))]))]))))) ;seq: ( (list ((list 'a) -> res)) ((list 'b) -> 'c) string -> ((list 'a) -> result) (define seq (opt-lambda (sub-list build name [id-position 0]) (let* ([sequence-length (length sub-list)] [memo-table (make-hash-table 'weak)] [prev (lambda (x) (cond [(eq? x return-name) "default previous"] [else (fail-res null null)]))] [builder (lambda (r) (cond [(res? r) (make-res (list (build (res-a r))) (res-rest r) name (res-id r) (res-used r) (res-possible-error r) (res-first-tok r))] [(repeat-res? r) (make-res (list (build (res-a (repeat-res-a r)))) (res-rest (repeat-res-a r)) name (res-id (repeat-res-a r)) (res-used (repeat-res-a r)) (repeat-res-stop r) (res-first-tok (repeat-res-a r)))] [else (error 'parser-internal-error1 r)]))] [my-error (sequence-error-gen name sequence-length)] [my-walker (seq-walker id-position name my-error)]) (opt-lambda (input [last-src (list 1 0 1 0)] [alts 1]) #;(!!! (printf "seq ~a~n" name)) (cond [(eq? input return-name) name] [(hash-table-get memo-table input #f) (hash-table-get memo-table input)] [(null? sub-list) (builder (make-res null input name #f 0 #f #f))] [else (let* ([pre-build-ans (my-walker sub-list input prev #f #f null 0 alts last-src)] [ans (cond [(and (res? pre-build-ans) (res-a pre-build-ans)) (builder pre-build-ans)] [(pair? pre-build-ans) (map builder pre-build-ans)] [else pre-build-ans])]) (hash-table-put! memo-table input ans) #;(!!! (printf "sequence ~a returning ~n" name)) #;(!!! (printf "answer is ~a ~n" ans)) ans)]))))) ;seq-walker: int string error-gen -> [(list parser) (list alpha) parser result (U bool string) (list string) int int -> result (define (seq-walker id-position seq-name build-error) (letrec ([next-res (lambda (a id used tok rst) (cond [(res? rst) (make-res (append a (res-a rst)) (res-rest rst) seq-name (or id (res-id rst)) (+ used (res-used rst)) (res-possible-error rst) tok)] [(repeat-res? rst) (make-res (append a (res-a (repeat-res-a rst))) (res-rest (repeat-res-a rst)) seq-name (or id (res-id (repeat-res-a rst))) (+ used (res-used (repeat-res-a rst))) (repeat-res-stop rst) tok)] [else (error 'parser-internal-error2 rst)] ))] [walker (lambda (subs input previous? look-back curr-id seen used alts last-src) (let* ([next-preds (cdr subs)] [curr-pred (car subs)] [id-spot? (= id-position (add1 (length seen)))] [next-call (lambda (old-result curr curr-name new-id tok alts) (let* ([old-answer (res-a old-result)] [rest (res-rest old-result)] [old-used (res-used old-result)] [rsts (walker next-preds rest curr-pred curr (or new-id curr-id) (cons curr-name seen) (+ old-used used) alts (if (and src? (res-first-tok old-result)) (make-src-lst (position-token-start-pos (res-first-tok old-result)) (position-token-end-pos (res-first-tok old-result))) last-src))]) (cond [(and (res? rsts) (res-a rsts)) (next-res old-answer new-id old-used tok rsts)] [(res? rsts) (fail-res rest (res-msg rsts))] [(pair? rsts) (map (lambda (rst) (next-res old-answer new-id old-used tok rst)) (correct-list rsts))] [(choice-res? rsts) (map (lambda (rst) (next-res old-answer new-id old-used tok rst)) (correct-list (choice-res-matches rsts)))] [(repeat-res? rsts) (next-res old-answer new-id old-used tok rsts)] [else (error 'parser-internal-error3 rsts)])))]) (cond [(null? subs) (error 'end-of-subs)] [(null? next-preds) #;(printf "seq-warker called: last case, ~a case of ~a ~n" seq-name (curr-pred return-name)) (build-error (curr-pred input last-src) (previous? input) (previous? return-name) #f look-back used curr-id seen alts last-src)] [else #;(printf "seq-walker called: else case, ~a case of ~a ~ath case ~n" seq-name (curr-pred return-name) (length seen)) (let ([fst (curr-pred input last-src)]) (cond [(res? fst) #;(!!! (printf "res case ~a ~a~n" seq-name (length seen))) (cond [(res-a fst) (next-call fst fst (res-msg fst) (and id-spot? (res-id fst)) (res-first-tok fst) alts)] [else #;(printf "error situation ~a ~a~n" seq-name (length seen)) (build-error fst (previous? input) (previous? return-name) (car next-preds) look-back used curr-id seen alts last-src)])] [(repeat-res? fst) #;(!!! (printf "repeat-res: ~a ~a~n" seq-name (length seen))) #;(!!! (printf "res? ~a~n" (res? (repeat-res-a fst)))) (next-call (repeat-res-a fst) fst (res-msg (repeat-res-a fst)) #f (res-first-tok (repeat-res-a fst)) alts)] [(or (choice-res? fst) (pair? fst)) #;(!!! (printf "choice-res or pair: ~a ~a ~a~n" (choice-res? fst) seq-name (length seen) #;(if (choice-res? fst) (map res-rest (choice-res-matches fst)) fst) #;(if (choice-res? fst) (map res-a (choice-res-matches fst)) fst))) (let*-values ([(lst name curr) (if (choice-res? fst) (values (choice-res-matches fst) (lambda (_) (choice-res-name fst)) (lambda (_) fst)) (values fst res-msg (lambda (x) x)))] [(new-alts) (+ alts (length lst))] [(rsts) (map (lambda (res) (cond [(res? res) #;(!!! (printf "choice-res, res ~a ~a~n" seq-name (length seen))) (next-call res (curr res) (name res) (and id-spot? (res-id res)) (res-first-tok res) new-alts)] [(repeat-res? res) #;(!!! (printf "choice-res, repeat-res ~a ~a ~a~n" (res? (repeat-res-a res)) seq-name (length seen))) (next-call (repeat-res-a res) res (res-msg (repeat-res-a res)) #f (res-first-tok (repeat-res-a res)) new-alts)] [else (!!! (error 'parser-internal-error4 res))])) (correct-list lst))] [(correct-rsts) (correct-list rsts)]) #;(printf "rsts =~a~n" rsts) #;(printf "correct-rsts ~a~n" (map res-a correct-rsts)) #;(printf "rsts: ~a~n" (map res-a rsts)) (cond [(null? correct-rsts) (let ([fails (map (lambda (rst) (!!! (unless (res? rst) (error 'here-we-are))) (res-msg (build-error rst (previous? input) (previous? return-name) (car next-preds) look-back used curr-id seen alts last-src))) rsts)]) (fail-res input (make-options-fail (rank-choice (map fail-type-chance fails)) #f seq-name (rank-choice (map fail-type-used fails)) (rank-choice (map fail-type-may-use fails)) fails)))] [else correct-rsts]))] [else (error 'here3)]))])))]) walker)) ;get-fail-info: fail-type -> (values symbol 'a 'b) (define (get-fail-info fail) (cond [(terminal-fail? fail) (values (terminal-fail-kind fail) (fail-type-name fail) (terminal-fail-found fail))] [(sequence-fail? fail) (values 'sub-seq (sequence-fail-expected fail) fail)] [(choice-fail? fail) (values 'choice null fail)] [(options-fail? fail) (values 'options null fail)] [else (error 'parser-internal-error5 fail)])) ;update-src: symbol src-list src-list token -> src-list (define (update-src error-kind src prev-src tok) (and src? (case error-kind [(choice options) prev-src] [(sub-seq misscase misspell end) src] [(missclass wrong) (if tok (update-src-start src (position-token-start-pos tok)) src)]))) ;build-options-fail: name (list-of fail-type) -> fail-type (define (build-options-fail name fails) (make-options-fail (rank-choice (map fail-type-chance fails)) #f name (rank-choice (map fail-type-used fails)) (rank-choice (map fail-type-may-use fails)) fails)) ;build-sequence-error: result boolean result string int [U #f string] [listof string] int int -> result (define (sequence-error-gen name len) (letrec ([repeat->res (lambda (rpt back) (cond [(pair? rpt) (map (lambda (r) (repeat->res r back)) rpt)] [(repeat-res? rpt) (let ([inn (repeat-res-a rpt)] [stop (repeat-res-stop rpt)]) (cond [(fail-type? stop) (make-res (res-a inn) (res-rest inn) (res-msg inn) (res-id inn) (res-used inn) (if (and (zero? (res-used inn)) (choice-res? back) (choice-res-errors back) (> (fail-type-chance (choice-res-errors back)) (fail-type-chance stop))) (choice-res-errors back) stop) (res-first-tok inn))] [else inn]))] [else rpt]))]) (lambda (old-res prev prev-name next-pred look-back used id seen alts last-src) (cond #;[(and (pair? old-res) (null? (cdr old-res))) (car old-res)] [(or (and (res? old-res) (res-a old-res)) (choice-res? old-res)) old-res] [(repeat-res? old-res) #;(!!! (printf "finished on repeat-res for ~a res ~n" name #;old-res)) (repeat->res old-res look-back)] [(pair? old-res) #;(!!! (printf "finished on pairs of res for ~a~n" name #;old-res)) (map (lambda (r) (repeat->res r look-back)) old-res)] [else #;(printf "There actually was an error for ~a~n" name) (fail-res (res-rest old-res) (let*-values ([(fail) (res-msg old-res)] [(possible-fail) (cond [(and (repeat-res? look-back) (fail-type? (repeat-res-stop look-back)) (> (fail-type-chance (repeat-res-stop look-back)) (fail-type-chance fail))) (repeat-res-stop look-back)] #;[(and (choice-res? look-back) (choice-res-errors look-back) (> (fail-type-chance (choice-res-errors look-back)) (fail-type-chance fail))) (choice-res-errors look-back)] #;[(and (res? look-back) (fail-type? (res-possible-error look-back)) (> (fail-type-chance (res-possible-error look-back)) (fail-type-chance fail))) (res-possible-error look-back)] [else #f])] [(next-ok?) (and (= (fail-type-may-use fail) 1) (not (null? (res-rest old-res))) next-pred (next-pred (cdr (res-rest old-res))))] [(next-used) (if (and next-ok? (res? next-ok?) (res-a next-ok?)) (res-used next-ok?) 0)] [(kind expected found) (get-fail-info fail)] [(new-src) (update-src kind (fail-type-src fail) last-src (res-first-tok old-res))] [(seen-len) (length seen)] [(updated-len) (+ (- used seen-len) len)]) #;(printf "sequence ~a failed.~n seen ~a~n" name (reverse seen)) #;(when (repeat-res? look-back) (printf "look-back repeat-res ~a : ~a vs ~a : ~a > ~a~n" (fail-type? (repeat-res-stop look-back)) (and (fail-type? (repeat-res-stop look-back)) (fail-type-name (repeat-res-stop look-back))) (fail-type-name (res-msg old-res)) (and (fail-type? (repeat-res-stop look-back)) (fail-type-chance (repeat-res-stop look-back))) (fail-type-chance (res-msg old-res)))) #;(when (choice-res? look-back) (printf "look-back choice: ~a vs ~a : ~a > ~a~n" (choice-res-name look-back) (fail-type-name (res-msg old-res)) (when (choice-res-errors look-back) (fail-type-chance (choice-res-errors look-back))) (fail-type-chance (res-msg old-res)))) #;(when (pair? look-back) (printf "look-back is a pair~n")) #;(when (res? look-back) (printf "look-back res ~a : ~a vs ~a : ~a > ~a~n" (fail-type? (res-possible-error look-back)) (and (fail-type? (res-possible-error look-back)) (fail-type-name (res-possible-error look-back))) (fail-type-name (res-msg old-res)) (and (fail-type? (res-possible-error look-back)) (fail-type-chance (res-possible-error look-back))) (fail-type-chance (res-msg old-res)))) (let* ([seq-fail-maker (lambda (fail) (let-values ([(kind expected found) (get-fail-info fail)]) (make-sequence-fail (compute-chance len seen-len used alts (fail-type-may-use fail) (fail-type-chance fail)) (fail-type-src fail) name used (+ used (fail-type-may-use fail) next-used) id kind (reverse seen) expected found (and (res? prev) (res-a prev) (res-msg prev)) prev-name)))] [seq-fail (seq-fail-maker fail)] [pos-fail (and possible-fail (seq-fail-maker possible-fail))] [opt-fails (list seq-fail pos-fail)]) #;(printf "seq-fail ~a~n" seq-fail) #;(when pos-fail (printf "opt-fails ~a~n" opt-fails)) (if pos-fail (make-options-fail (rank-choice (map fail-type-chance opt-fails)) #f name (rank-choice (map fail-type-used opt-fails)) (rank-choice (map fail-type-may-use opt-fails)) opt-fails) seq-fail))))])))) (define (compute-chance expected-length seen-length used-toks num-alts may-use sub-chance) #;(when (zero? used-toks) (printf "compute-chance 0 case: ~a, ~a, ~a, ~a -> ~a~n" sub-chance expected-length num-alts may-use (* (/ 1 num-alts) sub-chance))) (if (and (zero? used-toks) (zero? may-use)) (* (/ 1 expected-length) (/ 1 num-alts) sub-chance) (let* ([revised-expectation (+ (- used-toks seen-length) expected-length)] [possible-expectation (+ revised-expectation (max 0 (sub1 may-use)))] [probability-with-sub (* (/ (+ may-use used-toks) possible-expectation) (/ 1 num-alts))] #;[probability-with-sub (* (/ (add1 used-toks) revised-expectation) (/ 1 num-alts))] [probability-without-sub (* (/ used-toks revised-expectation) (/ 1 num-alts))] [expected-sub probability-with-sub] [expected-no-sub probability-without-sub] [probability (/ (* expected-sub sub-chance) (+ (* expected-sub sub-chance) (* expected-no-sub (- 1 sub-chance))))]) #;(printf "compute-chance: args ~a ~a ~a ~a ~a ~a~n" expected-length seen-length used-toks num-alts may-use sub-chance) #;(printf "compute-chance: intermediate values: ~a ~a ~a ~a ~a ~a~n" revised-expectation possible-expectation probability-with-sub probability-without-sub expected-sub expected-no-sub) #;(printf "compute-chance answer ~a~n" probability) probability))) ;greedy-repeat: (list 'a) -> result -> (list 'a) -> result (define (repeat-greedy sub) (letrec ([repeat-name (string-append "any number of " (sub return-name))] [memo-table (make-hash-table 'weak)] [process-rest (lambda (curr-ans rest-ans) (cond [(repeat-res? rest-ans) (let ([a (res-a curr-ans)] [rest (repeat-res-a rest-ans)]) (make-repeat-res (cond [(res? rest) (make-res (append a (res-a rest)) (res-rest rest) repeat-name "" (+ (res-used curr-ans) (res-used rest)) (if (fail-type? (repeat-res-stop rest-ans)) (repeat-res-stop rest-ans) (res-possible-error rest)) (res-first-tok curr-ans))] [(and (pair? rest) (null? (cdr rest))) (make-res (append a (res-a (car rest))) (res-rest (car rest)) repeat-name "" (+ (res-used curr-ans) (res-used (car rest))) (res-possible-error (car rest)) (res-first-tok curr-ans))] [(pair? rest) (correct-list (map (lambda (rs) (make-res (append a (res-a rs)) (res-rest rs) repeat-name "" (+ (res-used curr-ans) (res-used rs)) (if (fail-type? (repeat-res-stop rest-ans)) (repeat-res-stop rest-ans) (res-possible-error rs)) (res-first-tok curr-ans))) rest))]) (repeat-res-stop rest-ans)))] [(pair? rest-ans) (map (lambda (r) (process-rest curr-ans r)) rest-ans)] [else (error 'here4)]))] [update-src (lambda (input prev-src) (cond [(null? input) prev-src] [src? (src-list (position-token-start-pos (car input)) (position-token-end-pos (car input)))] [else prev-src]))]) (opt-lambda (input [start-src (list 1 0 1 0)] [alts 1]) (cond [(eq? input return-name) repeat-name] [(hash-table-get memo-table input #f) (hash-table-get memo-table input)] [else (let ([ans (let loop ([curr-input input][curr-src start-src]) (cond [(null? curr-input) (make-repeat-res (make-res null null repeat-name "" 0 #f #f) 'out-of-input)] [else (let ([this-res (sub curr-input curr-src)]) #;(printf "Repeat of ~a called it's repeated entity: ~n" repeat-name #;this-res) (cond [(and (res? this-res) (res-a this-res)) #;(printf "loop again case for ~a~n" repeat-name) (process-rest this-res (loop (res-rest this-res) (update-src (res-rest this-res) curr-src)))] [(res? this-res) #;(printf "fail for error case of ~a: ~a ~a~n" repeat-name (cond [(choice-fail? (res-msg this-res)) 'choice] [(sequence-fail? (res-msg this-res)) 'seq] [(options-fail? (res-msg this-res)) 'options] [else 'terminal]) (fail-type-chance (res-msg this-res))) (make-repeat-res (make-res null curr-input repeat-name "" 0 #f #f) (res-msg this-res))] [(repeat-res? this-res) #;(printf "repeat-res case of ~a~n" repeat-name) (process-rest (repeat-res-a this-res) (res-rest (repeat-res-a this-res)))] [(or (choice-res? this-res) (pair? this-res)) #;(printf "repeat call of ~a, choice-res ~a~n" repeat-name (and (choice-res? this-res) (length (choice-res-matches this-res)))) (map (lambda (match) (process-rest match (loop (res-rest match) (update-src (res-rest match) curr-src)))) (if (choice-res? this-res) (choice-res-matches this-res) this-res))] [else (error 'here5)]))]))]) (hash-table-put! memo-table input ans) #;(!!! (printf "repeat of ~a ended with ans ~a~n" repeat-name ans)) ans)])))) ;choice: [list [[list 'a ] -> result]] name -> result (define (choice opt-list name) (let ([memo-table (make-hash-table 'weak)] [num-choices (length opt-list)] [choice-names (map (lambda (o) (o return-name)) opt-list)]) (opt-lambda (input [last-src (list 0 0 0 0)] [alts 1]) #;(!!! (printf "choice ~a~n" name)) #;(!!! (printf "possible options are ~a~n" choice-names)) (let ([sub-opts (sub1 (+ alts num-choices))]) (cond [(hash-table-get memo-table input #f) (hash-table-get memo-table input)] [(eq? input return-name) name] [else (let*-values ([(options) (map (lambda (term) (term input last-src sub-opts)) opt-list)] #;[a (!!! (printf "choice-options ~a ~n ~a ~n~n~n" choice-names options))] [(fails) (map (lambda (x) (if (res? x) (res-msg x) (error 'here-non-res))) options)] [(corrects errors) (split-list options)] [(fail-builder) (lambda (fails) (if (null? fails) #f (make-choice-fail (rank-choice (map fail-type-chance fails)) (if (or (null? input) (not (position-token? (car input)))) last-src (update-src-end last-src (position-token-end-pos (car input)))) name (rank-choice (map fail-type-used fails)) (rank-choice (map fail-type-may-use fails)) num-choices choice-names (null? input) fails)))] [(ans) (cond [(null? corrects) (fail-res input (fail-builder fails))] [else (make-choice-res name corrects (fail-builder errors))])]) #;(!!! (printf "choice ~a is returning options were ~a ~n" name choice-names)) (hash-table-put! memo-table input ans) ans)]))))) ;correct-list: (list result) -> (list result) (define (correct-list subs) (cond [(pair? subs) (cond [(and (res? (car subs)) (res-a (car subs))) (cons (car subs) (correct-list (cdr subs)))] [(choice-res? (car subs)) (append (choice-res-matches (car subs)) (correct-list (cdr subs)))] [(repeat-res? (car subs)) (correct-list (cons (repeat-res-a (car subs)) (cdr subs)))] [(pair? (car subs)) (apply append (cons (correct-list (car subs)) (correct-list (cdr subs))))] [else (correct-list (cdr subs))])] [(null? subs) null] [else (error 'parser-internal-error6 subs)])) (define (split-list subs) (let loop ([in subs] [correct null] [incorrect null]) (cond [(pair? in) (cond [(and (res? (car in)) (res-a (car in))) (loop (cdr in) (cons (car in) correct) incorrect)] [(choice-res? (car in)) (loop (cdr in) (append (choice-res-matches (car in)) correct) (if (choice-res-errors (car in)) (append (choice-fail-messages (choice-res-errors (car in))) incorrect) incorrect))] [(repeat-res? (car in)) (loop (cdr in) (cons (repeat-res-a (car in)) correct) incorrect)] [(pair? (car in)) (loop (append (car in) (cdr in)) correct incorrect)] [(res? (car in)) (loop (cdr in) correct (cons (res-msg (car in)) incorrect))] [else (error 'split-list (car in))])] [(null? in) (values correct incorrect)]))) (define (src-list src-s src-e) (list (position-line src-s) (position-col src-s) (position-offset src-s) (- (position-offset src-s) (position-offset src-e)))) (define (update-src-start src new-start) (list (position-line new-start) (position-col new-start) (position-offset new-start) (+ (- (!!! (third src)) (!!! (position-offset new-start))) (fourth src)))) (define (update-src-end src new-end) (when (null? src) (error 'update-src-end)) (list (max (first src) 1) (second src) (max (third src) 1) (- (position-offset new-end) (third src)))) (define (repeat op) (letrec ([name (string-append "any number of "(op return-name))] [r* (choice (list op (seq (list op r*) (lambda (list-args) list-args #;(cons (car list-args) (cadr list-args))) name) (seq null (lambda (x) null) return-name)) name)]) r*)) ) )