Assignment #7: Trimming Words
Due: Wednesday, October 17th by 9:00 pm.
Put a block comment at the beginning of the Java file that contains:
/*
   Your first and last name
   Your section leader’s name
   Your section #, day, and time
   Assignment 7 - Problem 1, CSc 127A, Fall 2012
   Short description of what your program does
*/
Include your partner’s name if you work with a partner on either or both programs. See the course syllabus for details on working with a partner. The partner’s name and section number are required to avoid an Academic Integrity violation.
Grading Notes:
Programs should compile without errors or warnings; those that do not compile will not receive a passing grade.
For full credit, programs should produce the output shown below.
Program: TrimmingWords
Name your program: TrimmingWords.java.
The program will ask the user for the name of a text file. The program will read the contents of the text file and print each of the words in the file, one word to a line. Saying the program should print words can be a tricky thing to do. The difficulty comes in removing characters that are not normally part of a word. Toward this goal, we are going to use the following rules about words:
•First: A word consists of what the next() method of the Scanner class will return. The next() method returns a String that consists of all the characters in the input up to, but not including, the next “whitespace character”, where blank spaces, tabs, and newline characters are the whitespace characters.
•Second: Look at the first character of the word. If this first character is a single-quotation mark, double-quotation mark, a dollar sign, or a period, remove it.
•Third: Look at the last character of the word. If this last character is a single-quotation mark, double-quotation mark, semi-colon, colon, period, comma, hyphen, exclamation point, or question mark remove it.
The second rule means you will remove at most one character from the front of the word.
The third rule means you will remove at most one character from the end of the word.
At the end of the output, print the number of times each character was removed. Finally, print the count of the number of words found.
It is possible that there will be no word left after removing the indicated first and/or last characters. In this case, do not print the word, and do not count it as a word.
You will find both while and do..while loops useful in this program.
Required switch:
You are required to use at least one switch statement in your solution. This one switch can be in either the code for checking the first character of the word or the code for checking the last character of the word. If you wish, it is okay to use switch statements in both places.
What not to use:
If you are familiar with for loops and/or arrays, do not use them on this program. They are not necessary, and the purpose is to gain practice using what has been covered in class to this point.
Examples:
There are (currently) nine test cases available on D2L. Two are shown below as examples. You are encouraged to look at all nine test cases. You are strongly encouraged to run all nine test cases and verify that your output agrees with the provided answers.
As an example, consider the following excerpt from the Gettysburg Address, available as words04.txt on D2L:
Four-score and seven years ago, our fathers brought forth on this
continent a new nation, conceived in liberty and dedicated to the
proposition that all men are created equal.
The next() method may return String’s that have a comma or period as the last character. The third rule above will cause the comma or period to be removed before the word is printed. The output for the example would be:
Enter the file name: words04.txt
Do you want the words printed? (y/n) y
Four-score
and
seven
years
ago
our
fathers
brought
forth
on
this
continent
a
new
nation
conceived
in
liberty
and
dedicated
to
the
proposition
that
all
men
are
created
equal

Double Quotes:       0
Single Quotes:       0
Semi-colons:         0
Colons:              0
Periods:             1
Commas:              2
Hyphens:             0
Exclamation Points:  0
Question Marks:      0
Dollar Signs:        0
Words found:         29
Another example, this time using the following paragraph from Tom Sawyer, available as words02.txt on D2L:
   "Bother! Well, go 'long with you. I'd made sure you'd played hookey and
been a-swimming. But I forgive ye, Tom. I reckon you're a kind of a singed
cat, as the saying is -- better'n you look. This time."
The answer:
Enter the file name: words02.txt
Do you want the words printed? (y/n) y
Bother
Well
go
long
with
you
I'd
made
sure
you'd
played
hookey
and
been
a-swimming
But
I
forgive
ye
Tom
I
reckon
you're
a
kind
of
a
singed
cat
as
the
saying
is
-
better'n
you
look
This
time.

Double Quotes:       2
Single Quotes:       1
Semi-colons:         0
Colons:              0
Periods:             4
Commas:              3
Hyphens:             1
Exclamation Points:  1
Question Marks:      0
Dollar Signs:        0
Words found:         39
Input files:
Your program will ask the user two questions:
•The first question will ask for the name of the text file.
•The second question will ask if the individual words found in the file should be printed. See the example above.
You can assume that the text file name entered is correct; we will not run tests that use an invalid file name.
For the words being printed or not, your program should check that the first letter of the user’s response is either ‘y’, ‘Y’, ‘n’ or ‘N’. If the user’s response does not start with one of these four letters, repeat the question and read the user's response. Continue until the user does enter a word that begins with one of the four letters.
Note that the user can type a single character, or can type a multi-letter word. If they type a word, it is the first letter of the word that determines whether words are printed or not. For example, the user can type any of
y, Yes, yea, yell, Yellow
and your program should then print the words.