Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Convert this Scheme code to Prolog language (define (treemerge t1 t2) (cond ((null? t1) t2) ((null? t2) t1) ((and (list? (car t1))(list? (car t2))) (cons

Convert this Scheme code to Prolog language

(define (treemerge t1 t2) (cond ((null? t1) t2) ((null? t2) t1) ((and (list? (car t1))(list? (car t2))) (cons (treemerge (car t1)(car t2))(treemerge (cdr t1)(cdr t2)))) ((and (number? (car t1))(list? (car t2))) (cons (treemap (car t1)(car t2))(treemerge (cdr t1)(cdr t2)))) ((and (list? (car t1))(number? (car t2)))(cons (treemap (car t2)(car t1))(treemerge (cdr t1)(cdr t2)))) ((and (number? (car t1))(number? (car t2))) (cons (* (car t1)(car t2))(treemerge(cdr t1)(cdr t2)))))) (define (treemap c t) (cond ((null? t) '()) ((list? (car t))(cons (treemap c (car t))(treemap c (cdr t)))) (else (cons (* c (car t))(treemap c (cdr t))))))

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

The Structure Of The Relational Database Model

Authors: Jan Paredaens ,Paul De Bra ,Marc Gyssens ,Dirk Van Gucht

1st Edition

3642699588, 978-3642699580

More Books

Students also viewed these Databases questions