Search Results

Need to see the hash function to know for sure, but I'll bet that the hash value that is returned is out of range for the table array. Try printing the value of x just before the line that's generatin …

That free statement only executes if the word is spelled wrong. If spelled correctly, the return true statement executes and the free() call is not executed. Two possible fixes. You could add a free …

Answered in comments. Please accept this answer to remove from unanswered question pool. The code posted works fine when I plug it into my file. No seg faults, no memory leaks, nothing. Is it possi …

There are a couple of issues here. First, this code assumes that the end of a word will have a null child pointer. Since one word can be the beginning of another word, as with cat and cater, this kind …

The problem is that the code in dictionary.c is a subset of the code needed to make speller. You can't compile dictionary.c into a runnable program. For starters, it has no main(). … Try creating speller instead of dictionary. It'll work a lot better. A review of the class material on building an executable from multiple source code files is also in order. …

The code reads a word from the input file into the variable word. Then it does a second file read, storing the next word in word_point. This is causing all sorts of problems. Assuming that you haven …

Took me a bit to remove all the extraneous printf statements and such, but if I read the code right, it won't always work correctly! (It'll work in some cases. I'll let you figure out when, if you wi …

The dictionary.h file contains the prototypes for functions that return bool types. In order to do this, it has to guarantee that the bool type is defined, so the stdbool.h library has to be included …

A for statement has three parts, the initialization, the test, and the incrementation. The second c = fgetc(file) is the incrementation. Remember, the initialization, the first call to fgetc, is only …

First of all, concentrate on keeping things simple. There are numerous problems. I'll point you in the right direction on some and let you work a little more on others. ;-) Let's look at load() to …

I'm going to make an educated guess here that the error you're getting is pointing back at the following line: node *n = malloc(sizeof(node)); The message doesn't mean that the error is on this l …

This is a common problem that usually shows up in the recover pset! ;-) The extra word is occurring because of the while loop logic in load. It checks for EOF, reads a word, processes it, and then lo …

Have you thoroughly tested your code? I found that when I ran it with a small dictionary, it produced a seg fault in the unload() function. There are issues in unload that need to be thought through. …

/speller texts/birdman.txt or just ./speller birdman.txt? There are other problems in the code, but you'll find them soon enough. Also, check the program requirements for size. …

Here's what I see. First, the seg fault is happening here: if (table[index] == NULL) The problem is the value of index. It's way too large. The cause is back in the hash function. Although it's a …