Simple Java homework help: stack to identify palindromes

I got roped into helping a friend finish some Java homework; unfortunately I don't have time to do it. So, I turn to Freelancer. PLEASE NOTE: I need this completed within 24 hours, so please only bid if you are available to start immediately. I will be available for questions anytime you like. ALSO - please use Eclipse as opposed to NetBeans or some other IDE, so I can easily use the project. The point of the project is to create GUI using Eclipse that decrypts an encoded message by identifying palindromes — words that are the same forward or backward. For example, "ada" is a palindrome, and so is "rotator". The user will enter an input file name (a .txt file) and then press a button to read and decode the file. The decoded message will then be displayed in a text area on the screen. The following rule is the key for which words are part of the actual message: Any palindrome in the input file indicates that there is a word following the palindrome that is part of the message. However, the word does not immediately follow the palindrome, it follows it by the length of the palindrome. For example, if the word "rotator" appears in the text, then the seventh word after "rotator" is part of the message. The program must use a Stack ([login to view URL]) and a Queue to determine if a word is a palindrome. Here is an example of the input and output: EXAMPLE INPUT: chicken bob without ocelot hello candy anna mistletoe mowing universe world cow nestled The output for this would be "hello world" — the third word following "bob" is "hello", and the fourth word following "anna" is "world". Also keep in mind it is possible to have multiple palindromes back to back, as shown below. EXAMPLE INPUT: chicken bob anna without pepperoni hello pizza namely mowing universe world cow nestled The output for this would be "pepperoni pizza" — the third word following "bob" is "pepperoni", and the fourth word following "anna" is "pizza". She's already got it started, so I'm attaching what I've got. I haven't honestly looked at it so I don't know how useful it is or isn't; you're welcome to start from scratch if that's easier. Please let me know if you have any questions.