Functional programmer for scheme
Budget: $30 – $250 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
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
Due tomorrow night (5-22-2022), please get back to me ASAP.
Related categories:
Scheme