How to resolve the algorithm Palindrome detection step by step in the Prolog programming language

Published on 12 May 2024 09:40 PM
#Prolog

How to resolve the algorithm Palindrome detection step by step in the Prolog programming language

Table of Contents

Problem Statement

A palindrome is a phrase which reads the same backward and forward. Write a function or program that checks whether a given sequence of characters (or, if you prefer, bytes) is a palindrome. For extra credit:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Palindrome detection step by step in the Prolog programming language

Source code in the prolog programming language

palindrome(Word) :- name(Word,List), reverse(List,List).

pali(Str) :- sub_string(Str, 0, 1, _, X), string_concat(Str2, X, Str), string_concat(X, Mid, Str2), pali(Mid).
pali(Str) :- string_length(Str, Len), Len < 2.

pali(Str) :- sub_atom(Str, 0, 1, _, X), atom_concat(Str2, X, Str), atom_concat(X, Mid, Str2), pali(Mid).
pali(Str) :- atom_length(Str, Len), Len < 2.

You may also check:How to resolve the algorithm ABC problem step by step in the Ceylon programming language
You may also check:How to resolve the algorithm Polymorphism step by step in the Eiffel programming language
You may also check:How to resolve the algorithm Hostname step by step in the BaCon programming language
You may also check:How to resolve the algorithm Knuth shuffle step by step in the Oforth programming language
You may also check:How to resolve the algorithm Ackermann function step by step in the FutureBasic programming language