bool it_is_palindrome(string palindrome2)
int main()
{
string palindrome;
//prompt the user for a line of input
e.g.:
cout << "Enter now your word: ";
getline(cin, palindrome);
//now to test whether it is a palindrome you make a validation function... e.g. bool;
if (it_is_palindrome(palindrome))
cout << "It is a palindrome!";
else
cout << "Not a palindrome";
return 0;
}

for (int i=0; i<lengt_of_string; i++)
     letter[i]=(tolower(another_letter[i]);

#include <iostream>
#include <cstdlib> // For EXIT_FAILURE and EXIT_SUCCESS
#include <fstream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <cctype>
 
using namespace std;
 
#include "Queue.h"
#include "Stack.h"
 
 
/***************************MAIN******************************/
int main()
{
	Stack S;	// initialize stack
	Queue Q;	// initialize queue
	string s;
	int i=0;	// initialze int 'i'
	char string[MAX];  // initialize char string
	bool RESULT=false;  // initilize bool RESULT to false
 
 
	strcpy(string," ");
	cout << "Please enter a line of text: " << endl; 
	cin.getline (string,100);
 
for( int j = 0; j < s.size(); ++j)
	  {
	    if(s[j] >= 'A' && s[j] <= 'Z')
	      s += (s[j] | 32);
	    else
	      if(s[j] >= 'a' && s[j] <= 'z')
		s += (s[j] & (~32));
	      else
		s += s[j];
	  }
 
while(string[i]!=NULL)
	{
		S.push(string[i]);  // push chars individually from string to
		Q.addq(string[i]);		// stack and queue
		i++;      // next char
	}
	while(i>0)
	{
		if(S.topNpop()==Q.frontNremoveq())  // compare each element from
		{										// stack and queue
			RESULT=true;  // if same for all chars return true
		}
		else
		{
			RESULT=false;  // if not same for any char break and return false
			break;
		}
		i--;
	}	
 
 
if(RESULT==true)
	{
		cout<<string<<" \nThis is a palindrome\n";  // display if true
	}
	else
	{
		cout<<string<<" \nThis is not a palindrome\n"; // display if false
	}
 
	cout<<s<<s<<endl;
 
	return 0;
}

//your main_function here
//dont forget to use getline(cin, your_string_here);
//if (is_your_string_palindrome(your_string_here));
//cout << "Palindrome!";
//else
//cout << "not!";
//and one thing... dont forget your header string ok? #include <string> :cheesy: 
 
 
 
//heres the function that will remove all punctuation marks
 
string punctuation_erase (const string& your_string, const string& punctuation)
{
string no_punctuation; //this will create an empty string ok.
int your_string_length = your_string.length();
int punctuation_length = punctuation.length();
for (int i =0; i < your_string_length; i++)
{
 string report_char = your_string.substr(i, 1) //pick-up a one character
 int character_location = punctuation.find(report_char, 0);
   if (character_location < 0 || character_location >= punctuation_length)
     no_punctuation = no_punctuation + report_char // concatenates (+) strings that cannot be found in punctuation
}
return no_punctuation;
}
 
//the function that will determine whether the input line is a palindrome
 
bool is_your_string_palindrome(cons string& your_string)
{
string punctuation ("?,:;'!\" "); // theres a space ok.. you can add other punctuations here.
string string_here(your_string);
string_here = make_lower_letters(string_here);
string lowerstring_puncterase = punctuation_erase(string_here, punctuation);
return (lowerstring_puncterase==reverse(lowerstring_puncterase);
}
 
string make_lower_letters (const string& your_string)
{
string new_string(your_string);
for (int i=0; i < your_string.length(); i++)
        new_string[i] = tolower(your_string[i]);
return new_string;
}
 
string reverse(const string& your_string)
{
int first = 0;
int last = your_string.length();
string string_here(your_string);
while (first < last)
{
last--;
swap(string_here[first], string_here[last];
first++;
}
return string_here;
}
 
void swap_letters(char& letter1, char& letter2)
{
char letter_here = letter1;
letter1 = letter2;
letter2 = letter_here;
}