/**
 * 1.4 PalindromeTester
 *
 * @author Matthew Cheng
 * @version  9/6
 */

import java.util.Scanner;

public class PalindromeTester {
    public static void main (String [] args) {
        String input, reverse, another = "y";
        Scanner sc = new Scanner (System.in);

        while (another.equalsIgnoreCase("y")) {
            System.out.print("Please enter a potential palindrome: ");
            input = sc.nextLine();

            reverse = new StringBuilder(input).reverse().toString();
            reverse = input.replaceAll("[\\W]", "");

            System.out.println();

            if (boolean equals = input.equalsIgnoreCase(reverse)) {
                System.out.println("That string IS a palindrome.");
            } else {
                System.out.println("That string IS NOT a palindrome.");
            }

            System.out.println();
            System.out.print("Test another palindrome (y/n)? ");
            another = sc.nextLine();
        }
    }
}
@@ -516,21 +516,97 @@
 verse = 
-input
+reverse.replaceAll(%22%5B%5Ea-zA-Z %5D%22, %22%22).toLowerCase();%0A            reverse = reverse
 .replace
@@ -623,17 +623,17 @@
 %22, %22%22);%0A
-%0A
+ 
         
@@ -635,36 +635,123 @@
         
- System.out.println(
+input = input.replaceAll(%22%5B%5Ea-zA-Z %5D%22, %22%22).toLowerCase();%0A            input  = input.replaceAll(%22%5B%5C%5CW%5D%22, %22%22
 );%0A%0A    
@@ -762,12 +762,8 @@
     
-if (
 bool
@@ -806,16 +806,88 @@
 reverse)
+;%0A            %0A            System.out.println();%0A%0A            if (equals
 ) %7B%0A    

Update PalindromeTester.java Fixed logic.