Question

Please Code in Java and follow the directions given

Thanks

Program required

Directions

.A palindrome is a string that reads the same forward and backward, i.e., the letters are the same whether you read them from right to left or from left to right. Examples: 3 a) radar à is a palindrome b)Able was I ere I saw Elba à is a palindrome e good à not a palindrome Write java program to read a line of text and tell if the line is a a palindrome. Usea stack to read each non-blank character on a stack. Treat both upper-case and lower-case version of the letter as being the same character - Provide these 5 sample outputs and tell if each is a palindrome or not Too bad--I hid a boot Some men interpret eight memos "Go Hang a Salami! I'm a Lasagna Hog" (title of a book on palindromes by Jon Agee, 1991) A man, a plan, a canal-Panama Gateman sees my name, garageman sees name tag Program #3 1, Show the LinkedtStackADT interface 2. Create a LinkedStackDS with the following methods: default constructor, overloaded constructor, copy constructor isEmptyStack, push, peek, pop 3. Create a private inner StackNode class with the following methods: default constructor, overloaded constructor, toString 3. Exception classes: StackException, StackUnderflowException, StackOverflowException 4. Create a PalindromeDemo class that instantiates a LinkedStackDS object. Execute a do-while loop that asks the user using dialog boxes to "Input a String for Palindrome Test:" Use the replaceAll method to remove all blanks and special characters from testStr. Output whether or not it is a palindrome in a dialog box. [Use the 5 inputs given on the other handout sheet for testing.]

Answer 1

LinkedStackADT.java

public interface LinkedStackADT<T>

{
boolean isEmptyStack();
void push(T val);
T peek() throws StackUnderflowException;
void pop() throws StackUnderflowException;
}



StackUnderflowException.java


public class StackUnderflowException extends Exception

{
public StackUnderflowException(){

}
public StackUnderflowException(String msg)
{
super(msg);
}
}


LinkedStackDS.java


public class LinkedStackDS<T> implements LinkedStackADT<T>

{
private class StackNode
{
T data;
StackNode next;
StackNode()
{
}
StackNode(T data, StackNode next)
{
this.data = data;
this.next = next;
}
public String toString()
{
return data.toString();
}
}
private StackNode top;
public LinkedStackDS()

{
}

public boolean isEmptyStack()

{
return top == null;
}
public void push(T val)

{
top = new StackNode(val, top);
}

public T peek() throws StackUnderflowException

{
if(isEmptyStack())
throw new StackUnderflowException("stack is empty");
return top.data;
}

public void pop() throws StackUnderflowException

{
if(isEmptyStack())
throw new StackUnderflowException("stack is empty");
top = top.next;
}
}



PalindromeDemo.java

import javax.swing.JOptionPane;
public class PalindromeDemo

{
private static boolean isPalindrome(String input)
{
LinkedStackDS<Character> stack1 = new LinkedStackDS<Character>();
LinkedStackDS<Character> stack2 = new LinkedStackDS<Character>();
input = input.replaceAll("[^a-zA-Z]", "").toLowerCase();
//put the chars into stack1
for(int i = 0; i < input.length(); i++)
{
stack1.push(input.charAt(i));
}

while(!stack1.isEmptyStack())
{
try

{
stack2.push(stack1.peek());
stack1.pop();
}

catch (StackUnderflowException e)

{
System.out.println(e.getMessage());
}
}
for(int i = 0; i < input.length(); i++)
{
stack1.push(input.charAt(i));
}

while(!stack1.isEmptyStack())
{
try

{
if(!stack1.peek().equals(stack2.peek()))
return false;
stack1.pop();
stack2.pop();
}

catch (StackUnderflowException e)

{
System.out.println(e.getMessage());
}
}
return true;
}
public static void main(String[] args)

{
String input;
do
{
input = JOptionPane.showInputDialog("Enter the input string: ");
if(input != null)
{
if(isPalindrome(input))
JOptionPane.showMessageDialog(null, input + " it is a palindrome");
else
JOptionPane.showMessageDialog(null, input + " it is NOT a palindrome");
}
}

while(input != null);
}
}

// u can directly copy paste this code and then compile