2. Write a PROLOG program that includes the following operations with lists: mem

Question

2. Write a PROLOG program that includes the following operations with lists: membership testing (is an element member of a list?) first element last element two adjacent elements three adjacent elements append listl to list2 producing list3 delete element from a list append element to a list insert element in a list compute the length of list reverse a list check whether a list is a palindrome display a list For each of these operations write your implementation of the operation and show an example of its use. If a predicate already exists (predefined in Prolog), modify its name (e.g. myappend or appendi) Lists to be processed can be created by an auxiliary program, defined as facts, or entered from the keyboard.

Explanation / Answer

(a)

two adjecent element:-

       adjacent(X0, X1, [E0,E1|Es]) :-

       adjacent_(Es, E0, E1, X0, X1).

       adjacent_([], E0, E1, E0, E1).

       adjacent_([E2|Es], E0, E1, X0, X1) :-

       if_(( E0 = X0, E1 = X1 ),

           true,

           adjacent_(Es, E1, E2, X0, X1))

(b)

last element:-

domains

list=symbol*

predicates

last(list)

clauses

last([X]):-

write(" Last element is : "),

write(X).

last([Y|Tail]):-

last(Tail).

(c)

first element:-

                  

   domains

list=symbol*

   predicates

last(list)

   clauses

first([X]):-

write(" Last element is : "),

write(X).

first([Y|Head]):-

last(Head).

(d)

append two list-

   concat([], List, List).

   concat([Head|[]], List, [Head|List]).

   concat([Head|Tail], List, Concat) :- concat(Tail, List, C), concat(Head, C, Concat).

         

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.