L11a

Due by the end of this meeting

Starter Files:

• BalanceChecker.java

Stacks

Activity

Create a program named PalindromeChecker based on the program BalanceChecker (provided).

A string is a palindrome if its letters read the same forwards or backwards. For example, the letters of "Race car" are RACECAR, and if you reverse those letters it comes out the same (RACECAR), so it is a palindrome. On the other hand, "Fred Nerf" has the letters FREDNERF, which reverse to FRENDERF, which is not the same. Thus "Fred Nerf" is not a palindrome.

One way to check if a String is a palindrome is to put all its letters into a stack. Then go thru the String again, and for each letter check whether it matches the one you pop off the stack. If you ever get a mismatch, the String is not a palindrome. If you get all the way thru without a mismatch, the String is a palindrome.

Use the code

Character.isLetter(nextLetter)

to check if nextCharacter is a letter.

Test your code on the following palindromes:

• "race car"
• "Madam, I'm Adam."
• "Able was I, ere I saw Elba!"
• "A man, a plan, a canal: Panama."

Also check the following non-palindromes:

• "Fred Nerf"
• "Ready, dear?"
• "Palindrome"

• 0 points: code does not compile; or the activity is not close to complete and correct; or it uses methods or controls other than those required.
• 1 point: the code is mostly complete and correct; or the activity is complete and correct but the program style is incorrect.
• 2 points: the activity is complete and correct, and the program uses correct style.

Submit this/these files:

• PalindromeChecker.java