Take the 2-minute tour ×

I'm trying to modify a list by search and replace, was wondering how do I search through a list with the search term as a list as well?

Lets say I have a list [1,2,3,4] I want to single out the 2 and 3 and replace it with 5,6 so ideally I could have a predicate:

search_and_replace(Search_Term, Replace_Term, Target_List, Result_List).


search_and_replace([2,3], [5,6], [1,2,3,4], Result_List), write(Result_List).
share|improve this question
add comment

2 Answers

up vote 2 down vote accepted

You can use append/2 as follows :

replace(ToReplace, ToInsert, List, Result) :-
    once(append([Left, ToReplace, Right], List)),
    append([Left, ToInsert, Right], Result).

With or without use of once/1 depending on if you want all the possibilies or not.

To replace all the occurences I'd go with something like :

replace(ToReplace, ToInsert, List, Result) :-
    replace(ToReplace, ToInsert, List, [], Result).
replace(ToReplace, ToInsert, List, Acc, Result) :-
    append([Left, ToReplace, Right], List),
    append([Acc, Left, ToInsert], NewAcc),
    replace(ToReplace, ToInsert, Right, NewAcc, Result).
replace(_ToReplace, _ToInsert, [], Acc, Acc).
share|improve this answer
Hmm.. I noticed that the predicate only searches and replace one, how do you apply to all terms globally? –  chutsu Dec 1 '11 at 18:23
@chutsu I edited. –  m09 Dec 1 '11 at 19:27
Thank you very much :) –  chutsu Dec 2 '11 at 16:34
add comment

Let me assume that you want to replace a subsequence substring within a list by another list.

Here is a general way how to do this. You might want to insert further conditions into the program.

replacement(A, B,  Ag, Bg) :-
   phrase((seq(S1),seq(A),seq(S2)), Ag),
   phrase((seq(S1),seq(B),seq(S2)), Bg).

seq([]) --> [].
seq([E|Es]) --> [E], seq(Es).

And, yes this can be optimized a bit - even its termination property would profit. But conceptual clarity is a quite precious value...

Edit: Your example query:

?- replacement([2,3], [5,6], [1,2,3,4], Xs).
Xs = [1, 5, 6, 4] ;
share|improve this answer
Very nice, DCG is pretty new to me but it seems like an elegant solution. –  chutsu Dec 1 '11 at 18:22
add comment

Your Answer


