This program will expand upon Part B from Homework 1. As before, read all of the files specified on the command line. You are to save every word. This time, a word is defined as a sequence of letters, numbers, and aposotrophes only. Any other punctuation should be removed.
When the files have all been read, you are to print out five sets of words - words beginning with a capital letter, words beginning with a lowercase letter (or number), words containing apostrophes, words containing multiple adjacent vowels, and words containing adjacent duplicate characters (obviously, there will be some overlap).
Each list of words should be printed out in order of decreasing size (ie, larger words come before smaller words). Words in the same set with the same number of characters should be printed in reverse ASCIIbetical order.
With each word, print out the number of times that word appeared in all of the input files combined. (as you did for HW1 Part B)
| open each file: | 5 |
| Eliminate punctuation, and store each word: | 10 |
| All lists sorted first by length | 5 |
| Words of equal length sorted in reverse ASCIIbetcial order | 10 |
| Words starting with a Capital letter | 10 |
| Words starting with a lowercase letter | 5 |
| Words containing an apostrophe | 5 |
| Words containing multiple consecutive vowels | 15 |
| Words containing duplicate consecutive characters | 15 |
| Compilation | 5 |
| Code Style | 5 |
| Output Style | 5 |
| Error Checking & Reporting | 5 |
~lallip/public/submit.pl. I must
ask you to use only one submission method (ie, if you submit once with
the RCS program, do not re-submit with the CGI program). If you find
that you must choose the other option, please email me to let me know
this has happened.
rcs-sun1.rpi.edu and is due
on Tuesday, October 1st at 11:59:59pm EDT.