Consider the following two variable bindings in Lisp: (setq x ‘(a b c d)) (setq y ‘(4 3 2 1)) Using only the variables x and y and the functions car, cdr and cons, provide Lisp S-expressions for generating the following: (d c b a) (4 c (b 2)) ((a b c d) . 1) (((a c) (1 2)) . a) ((a 1) (b 2) (c 3) (d 4))

Consider the following two variable bindings in Lisp: (setq x ‘(a b c d)) (setq y ‘(4 3 2 1)) Using only the variables x and y and the functions car, cdr and cons, provide Lisp S-expressions for generating the following: (d c b a) (4 c (b 2)) ((a b c d) . 1) (((a c) (1 2)) . a) ((a 1) (b 2) (c 3) (d 4))

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 7SA

See similar textbooks

Similar questions

Using the following variable bindings: (setq x ‘(a b c d)) (setq y ‘(1 2 3 4)) Using only variables x and y, car, cdr, and cons, provide Lisp S-expression to generate: (a 1) (b 2) (c 3) (d 4))
Using only the variables x and y and the functions cons, car, cdr, & reverse, provide Lisp ; S-expressions for generating the following: 2a create (1 2 c d) (print nil ) 2b create ((d c) (4 3)) (print nil ) (terpri) (terpri)
4. Apply B-reduction to the following A-expressions as much as possible (a) (Az.z) (Ay.y y) (Ar.x a) (b) (Az.z) (Az.z z) (Az.z y) (c) (Ar.Ay.r y y) (Aa.a) b (d) (Ar.Ay.r y y) (Ay.y) y
Giving the following LISP functions,find which lines of code are correct and incorrect and explain your answer. (defun f (l) (remove nil l) (apply #' + l)) (defun f (l) (remove nil l) (apply #' + l))
Evaluate the following lambda expressions using eager beta-reduction (use the standard interpretations for numbers and booleans wherever meeded). (a) ((Lx.x*x)5) (b) ((Ly.((Lx.x+y+z)3))2) (c) ( (Lv.(Lw.w)((Lx.x)(y(Lz.z)))) 14.3 Evaluate the following expressions. (you could use a Scheme interpreter) (a) (null ? ()) (b) (null ? '(a bede)) (c) (car '(a (b c) de)) (d) (cdr '(a (b c) de)) (e) (cadr '(a (bc) de))
Find the union , intersection and difference of two sets in lisp without using built-in function
Implement the following functions in Scheme using the functions map and/or foldl. DO NOT use recursive definition for this problem. Define a function leq, which takes two lists of numbers (x1,x2,…,xn),(y1,y2,…,yn) and returns \#t if and only if x i≤y if or all 1≤i≤n. You can assume that the two lists have the same length.
Giving the following LISP functions, find which lines of code are correct and incorrect and explain your answer. (defun f (l)) (delete nil l) (apply #' + l)) Computer science
In LISP, the function returns t if <object> is a CONS cell and nil otherwise: A. (cons <object>) B. (consp <object>) C. (eq <object>) D. (cous = <object>) E. None of the above
Translate the following Scheme function into oCaml/F# (define f (lambda (a b) (let ((c 5)) (lambda(d) (+ a b c d)) NOTE: It does not have to be an exact/literal translation, though the new function should have the same behavior; meaning for the same inputs the F# version should have the same outputs. Small hint: Using the above code, the statement (f 1 2) resolves to a new function and the statement ((f 1 2) 3) resolves to 11.
10-Draw the internal representation for the following lisp list(s). (cons '( (apple orange () (grape) banana)) '())
7) Draw the internal representation for the following lisp list(s). (cons '()(Green Blue)) '(Red (Yellow ()) Blue) )