/** CIS 22B: Homework 4C Structures and Strings Project: Text Analyzer: Word Count NAME: */ #include #include using namespace std;

const bool DE_BUG = true; // when done debugging change the DE_BUG flag to false const int ARY_SIZE = 100;

/* Define a struct named Word with the following fields: 1. word, a string 2. cnt, an integer */

/* Define a struct named WordStats with the following fields: 1. list, an array of ARY_SIZE Word structures defined above 2. noWords, an integer, for the number of distinct words 3. maxLength, an integer, for the longest word's length 4. highFreq, an integer, for the highest frequency */

// Function prototypes void printWelcome(void); void readWords(string inFilename, WordStats *stats); void insertionSort(Word ary[], int size); void printHigestFreq( const WordStats *stats); void writeFile( string outFilename, const WordStats *stats); void printEnd(void);

int main() { string inFilename[] = {"song_row.txt", "song_ten.txt", "test.txt", ""}; string outFilename = ""; // use the following data for testing // insertionSort, writeFile, and printprintHigestFreq functions WordStats stats = { { {"a", 9}, {"boat", 21}, {"dream", 125}, {"merrily", 44}, {"row", 125}, {"stream", 5}} , 6, 7, 125 }; printWelcome(); for (int i = 0; inFilename[i] != ""; i++) { cout

/************************************************** */ void insertionSort(Word ary[], int size) { if (DE_BUG) cout

/************************************************** */ void printHigestFreq( const WordStats *stats) { if (DE_BUG) cout

/************************************************** */ void writeFile( string outFilename, const WordStats *stats) { if (DE_BUG) cout

/************************************************** This function displays a welcome message and briefly explains the purpuse of this program. */ void printWelcome(void) { if (DE_BUG) cout

/************************************************** This function displays an end of the program message */ void printEnd(void) { if (DE_BUG) cout CIS 22B Intermediate Programming Methodologies in C++ Programming Assignments Homework 4 100 Points Structures and Strings 22B H4A Str_Move.epp (c-stri 22B H4B Ptr Sort.cpp (find and fix errors) 22B_H4C_Wordcount. cpp Project: Text Analyzer: Word Count (See next pages) Grading Program 4A Program 4B Program 4C 15 15 (index notation) Display welcome/farewell messages 2. 1. Read words from file 15 15 15 -15 3. Insertion Sort 4. Write report to file 5. Self Assessment Report Display words with the highest frequency Run the program as required and save the output at the end of the source file as a comment. Compress the source file, input and output files (if any), and upload the compressed file: 22B LastName FirstName H4.zip CIS 22B Intermediate Programming Methodologies in C++ Project: Text Analyzer: Word Count Write a program that parses a text file into words and counts the number of occurrences of each word. As you are reading the words, keep track of the number of distinct words, maximum length, and highest frequency. Read word then search for it: if found, add one to the counter, if not found, add the new word at the end of the list and initialize its counter to 1 (see a detailed example on the last page). Sort the array in alphabetical order (from 'a to 'z') using the insertion sort algorithm. Save the sorted list of words to a file as shown below: 6 words Maximum length:7 Highest frequency: 125 9 a 21 boat 125 dream 44 merrily 125 row 5 stream Display a list of high-frequency words as shown below: 125 dream 125 row There are 2 high-frequency words You may assume that the text does not contain more than 100 words (ie. declare an array of MAX_SIZE 100) and that the frequency is not greater than 999 (for output formatting). Assume that the text files contain only letters, spaces and punctuation characters and that only the first letter in some words could be in upper case. Run the program once using the following input files: song row.txt, song ten.txt, and test.txt(see below). Create the input file song row. txt, with the following data Row, row, row your boat, Gently down the stream Merrily,merrily, merrily, merrily, Life is but a dream Create the input file song ten.txt, with the following data: Ten green bottles hanging on the wall, Ten green bottles hanging on the wal1, And if one green bottle should accidentally fall, There will be nine green bottles hanging on the wall Create the input file test.txt, with the following data The one two three waltz: one two three one two three step two three step two three one two three one two three waltz waltz waltz waltz waltz waltz. The end. Next Page CIS 22B Intermediate Programming Methodologies in C++ Programming Assignments The program will generate names for the output files by appending "OUT" at the end of the input file name, as shown below: song_row OUT.txt, song ten OUT.txt, and test OUT.txt Example: How to read data from file into an array of structures and keep track of the longest word's length and highest frequency Row, row, row your boat, Gently down the stream Merrily, merrily, merrily, merrily, Life is but a dream 1. Read "Row,", convert it to "row", then insert it into the array: frOW,1)/array has one item, highest frequency is 1, longest word is 3 Read "row,", convert it to "row", since it is found in the array add 1 to its counter characters 2. , 2) l/ array has 1 item, highest frequency is 2, longest word has 3 3. Read "row", since it is found in the array add 1 to its counter { {"row". )) // array has l item, highest frequency is 3, longest word has 3 characters. 4. Read "your", since it is not found, add it at the end of the array ow", 3), your", array has 2 items, highest frequency is 3, longest word has 4 characters. 5. Read "boat,", convert it to "boat" then add it at the end of the array o, 3), "your", 1), f"boaf",1array has 3 items, highest frequency is 3, longest word has 4 characters. 6. Read "Gently", converted to "gently", then add it at the end of the array ow", 3), your", 1), "boat",1), ("gently", 1) ) // array has 4 items, highest frequency is 3, longest word has 6 characters. 7. Read "down", then add it at the end of the array row", 3), "your", 1), "boat",1), "gently",1,), "down", 1) has 5 items, highest frequency is 3, longest word has 6 characters. //array 8. Read "the", then add it at the end of the array w", 3), your",1), "boat", 1), f"gently", 1), ("down", 1),(te,) // array has 6 items, highest frequency is 3, longest word has 6 characters. and so on. Next Page CIS 22B Intermediate Programming Methodologies in C++ Pseudo-code for the readWords function: open input file (with validation) set highest frequency to O set number of words t set length of the longest word to 0 loop (not end of the file) read one word process word as needed if (word is not found in the list) add the new word at the end of the list set the counter of the new word to 1 add 1 to the number of words update the longest length if needed else / found add 1 to its counter update the highest frequency if needed end if end loop close tile