Functional programmer for scheme -- 2
Budget: $250 – $750 USD
Create a Scheme function that can recursively remove extra negatives and parenthesis given a messed up one
ex: (define tt '((- ((- (- ((- ((((- ((- (#t)) ^ (- (#f)))))))) ^ (- ((- ((- (#t)) ^ (- ((- ((- (#t)) ^ (- (#f)))))))))))))))))
do not use any high order functions and primitives / loop / only use car , cdr, cons to attach and go through list
scheme func 2: given a tree/list of #f,#t,~,^. create a calculator function using the nots ~, and ^ and return a #t or #f in the end.
ex: (#f ^ - #t ) ^ (#f ^ (#f ^#t)) input return the equivalent #t or #f after computed
do not use any high order functions and primitives / loop / only use car , cdr, cons to attach and go through list
Due tomorrow night (5-22-2022), please get back to me ASAP.
ex: (define tt '((- ((- (- ((- ((((- ((- (#t)) ^ (- (#f)))))))) ^ (- ((- ((- (#t)) ^ (- ((- ((- (#t)) ^ (- (#f)))))))))))))))))
do not use any high order functions and primitives / loop / only use car , cdr, cons to attach and go through list
scheme func 2: given a tree/list of #f,#t,~,^. create a calculator function using the nots ~, and ^ and return a #t or #f in the end.
ex: (#f ^ - #t ) ^ (#f ^ (#f ^#t)) input return the equivalent #t or #f after computed
do not use any high order functions and primitives / loop / only use car , cdr, cons to attach and go through list
Due tomorrow night (5-22-2022), please get back to me ASAP.