Member Avatar for andrew.mendonca.967

CSCI-15 Assignment #2, String processing. (60 points) Due 9/23/13

You MAY NOT use C++ string objects for anything in this program.

Write a C++ program that reads lines of text from a file using the ifstream getline() method, tokenizes the lines into words ("tokens") using strtok(), and keeps statistics on the data in the file. Your input and output file names will be supplied to your program on the command line, which you will access using argc and argv[].

You need to count the total number of words, the number of unique words, the count of each individual word, and the number of lines. Also, remember and print the longest and shortest words in the file. If there is a tie for longest or shortest word, you may resolve the tie in any consistent manner (e.g., use either the first one or the last one found, but use the same method for both longest and shortest). You may assume the lines comprise words (contiguous lower-case letters [a-z]) separated by spaces, terminated with a period. You may ignore the possibility of other punctuation marks, including possessives or contractions, like in "Jim's house". Lines before the last one in the file will have a newline ('\n') after the period. In your data files, omit the '\n' on the last line. You may assume that the lines will be no longer than 100 characters, the individual words will be no longer than 15 letters and there will be no more than 100 unique words in the file.

Read the lines from the input file, and echo-print them to the output file. After reaching end-of-file on the input file (or reading a line of length zero, which you should treat as the end of the input data), print the words with their occurrence counts, one word/count pair per line, and the collected statistics to the output file. You will also need to create other test files of your own. Also, your program must work correctly with an EMPTY input file – which has NO statistics.

Test file looks like this (exactly 4 lines, with NO NEWLINE on the last line):

the quick brown fox jumps over the lazy dog.
now is the time for all good men to come to the aid of their party.
all i want for christmas is my two front teeth.
the quick brown fox jumps over a lazy dog.

Copy and paste this into a small file for one of your tests.


Use a 2-dimensional array of char, 100 rows by 16 columns (why not 15?), to hold the unique words, and a 1-dimensional array of ints with 100 elements to hold the associated counts. For each word, scan through the occupied lines in the array for a match (use strcmp()), and if you find a match, increment the associated count, otherwise (you got past the last word), add the word to the table and set its count to 1.

The separate longest word and the shortest word need to be saved off in their own C-strings. (Why can't you just keep a pointer to them in the tokenized data?)

Remember – put NO NEWLINE at the end of the last line, or your test for end-of-file might not work correctly. (This may cause the program to read a zero-length line before seeing end-of-file.)

This is not a long program – no more than about 2 pages of code.

Here is my code:

using namespace std;

int main(int argc, char *argv[])
    ifstream inputFile;
    ofstream outputFile;
    string line;
    char *token;
    char inFile[12] = "string1.txt";
    char outFile[16] = "word result.txt";
    char words[100][16]; // Hods the unique words.
    int counter[100]; // Holds associated counts.
    char *longest[16]; // Holds longest words.
    char *shortest[16]; // Holds shortest words.
    int totalCount = 0; // Counts the total number of words.
    int lineCount = 0; // Counts the number of lines.

    token = strtok(NULL, "."); // Removes period.

    // Get the name of the file from the user.
    cout << "Enter the name of the file: ";
    cin >> inFile;

    // Open the input file.;

    // If successfully opened, process the data.
            lineCount++; // Increment each line.
            // If there is a match, increment the associated count.
            if(strcmp(words, token) == 0)
                totalCount++; // Increment the total number of words;
                token = strtok(NULL, " "); // Removes the whitespace.
                // If there is a tie for longest word, get the first or last word found.
                if(strcmp(words, longest) == 0)
                    longest[16] = "";
                // If there is a tie for shortest word, get the first or last word found.
                else if(strcmp(words, shortest) == 0)
                    shortest[16] = "";
            // Otherwise, add the word to the table and increment by 1.
                words[100][16] += 1;
        // Close the file.
    // Otherwise, print error message.
        cout << "Cannot open the file" << endl;

    // Open the output file.;
    // Print the table to the output file.
    outputFile << "List of words: " << endl;
    outputFile << "---------------------" << endl;

    // Print each word/count pair per line.
    for(int i = 0; i < words[100][16]; i++)
        outputFile << setw(10) << words[i][16];
        outputFile << setw(10) << words[100][i] << endl;
    outputFile << endl;
    // Print the stats to the output file.
    outputFile << "Number of Lines: " << lineCount << endl;
    outputFile << "Total number of Words: " << totalCount << endl;
    outputFile << "Number of Unique Words: " << words[100][16] << endl;
    outputFile << "Longest words: " << longest[16] << endl;
    outputFile << "Shortest words: " << shortest[16] << endl;

    // Close the output file.

    return 0;

Error: Cannot convert char[][16] to const char for argument 1 to int strcmp(const char, const char)

This is occurring on lines 42, 48, and 53. How can I get rid of this error?

Your variable words is of data type char** while longest and shortest are of data type char*. So, in words you ned to specify the index of word(char*) in order to compare with shortest or longest.
In line 56, you are trying to access words[100][16] which is out of bounds. As you might know indexing of array starts from 0, you can access words[99][15] but not words[100][15] and words[99][16].
PS: access here means access without unexpected results.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.