practice using dynamic memory allocation, c-string functions,

Question

Read a dictionary word file into an array of c-strings. You will need to dynamically allocate memory for each word in the dictionary. The word file contains 23,907 words.

Sort the dictionary.

Reading in a test file, one line at a time. Parse the line to get each individual word in the line. Search the dictionary word list (the array of c-strings) for each word in the line. If the word is not found, print a message. The search should be performed as a binary search.

Program Requirements

1. Use these files for your dictionary and the final spell check test.
2. Use an array of char pointers store your word file.  Allocate memory dynamically to store each word in a char array.  Store the dictionary words in lower case.
3. Use a temporary char array to hold each line in the test file. “Parse” each line into individual words for spell checking. not use the stringstream classes
4. Spell checking must ignore case. For example, “Hello” is the same as “hello”.
5. If the word ends in s, then you must also check the word with the s removed. For example, years is not misspelled because year is in the dictionary.

Program Output

Your output should looks quite similar to this:

Misspelled word, withering on line 4

Misspelled word, captivity on line 5

Misspelled word, dramatize on line 12

Misspelled word, nation's on line 13

Misspelled word, tranquilizing on line 28

Misspelled word, gradualism on line 29

Misspelled word, God's on line 31

Misspelled word, Negro's on line 35

Misspelled word, whirlwinds on line 41

There should be slightly more than 20 misspelled words.

1. For your dictionary sort, you can "swap pointers" since you are working with an array of pointers.
2. Use strtok() for the parsing of each line.

Answer 1

using namespace std;

#include <iostream>

#include <string.h>

#include <stdlib.h>

#include <ctype.h>

#define MAX_WORD_LEN (50)

#define MAX_NUM_WORDS (23907)

int StrCompare ( const void * rec1, const void * rec2)

{

char * str1 = (char *)rec1;

char * str2 = (char *)rec2;

return( strcmp(str1,str2));

}

char dictionary[MAX_NUM_WORDS][MAX_WORD_LEN];

void Lowercase ( char * str)

{

int n = strlen(str);

char ch;

for (int iLoop=0; iLoop<n; iLoop++)

{

ch = str[iLoop];

if (ch=='\n') { ch=0; }

str[iLoop] = tolower(ch);

}

}

int Dictionary( char dict[][MAX_WORD_LEN])

{

int i=0;

FILE * fptr = fopen("dictionary.dat","r");

for (int iLoop=0; iLoop<MAX_NUM_WORDS; iLoop++)

{

memset(dictionary[iLoop],0,MAX_WORD_LEN);

if (fgets(dictionary[iLoop],MAX_WORD_LEN,fptr) != NULL)

{

Lowercase(dictionary[iLoop]);

i++;

}

else

{

break;

}

}

fclose(fptr);

return(i);

}

int Go ( char dictionary[][MAX_WORD_LEN], int wordCount, char * filename)

{

FILE * fptr = fopen(filename,"r");

char inbuff[255];

char * token;

int lineNum=1;

while (fgets(inbuff,255,fptr)!=NULL)

{

token = strtok(inbuff," ");

while (token!=NULL)

{

Lowercase(token);

char * wordPtr= (char*)bsearch((void*)token,(void *)dictionary,wordCount,MAX_WORD_LEN,StrCompare);

if (wordPtr==NULL)

{

cout << token << " on line " << lineNum << endl;

}

token = strtok(NULL," ");

}

lineNum++;

}

fclose(fptr);

}

int main()

{

int wordcount = Dictionary(dictionary);

qsort(dictionary,wordcount,MAX_WORD_LEN,StrCompare);

//* for (int iLoop=0; iLoop<wordcount; iLoop++) { cout << dictionary[iLoop] << endl; }

Go(dictionary,wordcount,(char*) "input.dat");

}