Thread: getword and linked lists

so i have a funtion to read words and put thm all in lowercas leteering.how do i insert the wordsv into a link list ?i have declared the link list and wrote a function to add the words in place.i jus cant figure out how to link the two so when the word is "lower cased" i need to add it in place into a link list

//code for gettin word from file

Code:

int getword(FILE*in,char string[]){
                     char ch;
                     int n=0;
                     //read over blank space
                   while(!isalpha(ch=getc(in)) && ch!='\0')
                     if(ch==EOF) return 0;
                     string[n++]=tolower(ch);
                     while(isalpha(ch=getc(in)) && ch!='\0')
                     if(n<20)string[n++]=tolower(ch);
                     string[n]='\0';
                     return 1;
                     }

and this is myaddinplace functions which supposed to add wordsread into a link list in ascending order.

Code:

Nodeptr addinplace(Nodeptr top,char string[]){
        
        Nodeptr str,curr,prev,makenode(char[]);
     
        
        
        str=makenode(string);
        prev=NULL;
        curr=top;
while(curr!=NULL && strcmp(curr->word,string)<0){
        prev=curr;
        curr=curr->next;
        }
if(prev==NULL){
               str->next=top;
               return str;
               }
         str->next=curr;
         prev->next=str;
         return top;
         }

im not sure how to implement them

The word's inserted into a struct element whose size is fixed or dynamic. Dealing with variable length words means it's best to go with a dynamically sized struct member.

i use dynamic storage maloc
i have a function that created the node

Code:

Nodeptr makenode(char string[]){
      
        Nodeptr str=(Nodeptr)malloc(sizeof(Node));
        strcpy(str->word,string);
        str->next=NULL;
        return str;
        }

the problem is how to store the words into the linklist?

i was thinkin of using this call to the functions in main i declaredstart as a pointer to my structure

Code:

typedef struct node{
                    char word[20];
                    int count;
                    struct node *next;
                    }Node,*Nodeptr;
                    
main...

Nodeptr start;

 while(getword(in,wod)!=0){
                              addinplace(start,wod);
                              }

i have a tested working fn that prints lists ,but when i call it with start as the arument it doesnt print anything.it seems as though start wasnt touched in the addinplace fn so im wondering if i am using it properly.

Allocate the very first node of the list, its *next points to NULL.
Next node malloc()'ed is placed at the head of the list, its *next points to the first node, so on and so forth.

i understand all that but what i dont get it how to put the words into the linked list
i know this is a bit cubersome but here it is.it runs and compiles but there is nothing in my start list.i dont know where i am going wrong

Code:

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<ctype.h>

FILE*in;


typedef struct node{
                    char word[20];
                    int count;
                    struct node *next;
                    }Node,*Nodeptr;
                    
                    
//FUNCTIONS=======================================================================================================
                    
 Nodeptr addinplace(Nodeptr ,char[] ); 
 Nodeptr makenode(char[] );                  
 void printlist(Nodeptr );

int getword(FILE*,char[]);
 Nodeptr search(Nodeptr,char[] );
 
//================================================================================================================
int main(){
    in=fopen("shims.txt","r");
    if(in==NULL){
                 printf("Filenot found!! \n");-
                 system("pause");
                 exit(1);
                 }
    char wod[20],string[20];
    int cmp,x=1;
    Nodeptr start=NULL,srch;
  
  
    while(getword(in,wod)!=0){
                            
                            addinplace(start,wod);  
   
 printf("%s ",wod);
    
    
}
     
    
    printf("!\n");
    printlist(start);            
   printf("5");
    printf("\n");
    fclose(in);                    
    system("pause");
    return 0;
}
//making a node to hold the word
Nodeptr makenode(char string[]){
      
        Nodeptr str=(Nodeptr)malloc(sizeof(Node));
        strcpy(str->word,string);
        str->next=NULL;
        return str;
        }
 //adds words inorder into th3 list       
 
Nodeptr addinplace(Nodeptr top,char string[]){
        
        Nodeptr str,curr,prev,makenode(char[]);
     
        
        
        str=makenode(string);
        prev=NULL;
        curr=top;
while(curr!=NULL && strcmp(curr->word,string)<0){
        prev=curr;
        curr=curr->next;
        }
if(prev==NULL){
               str->next=top;
               return str;
               }
         str->next=curr;
         prev->next=str;
         return top;
         }
         
         
 //prints linked structures                         
void printlist(Nodeptr top){
     while(top!=NULL){
                      printf("%s\n",top->word);
                      top=top->next;
                      }
                      }


                 
                                 
 
    
//stores the next word if any,in wrd;word is converted to lowercase 
//return 1 if  found  0 otherwise.  
int getword(FILE*in,char string[]){
                     char ch;
                     int n=0;
                     //read over blank space
                   while(!isalpha(ch=getc(in)) && ch!='\0')
                     if(ch==EOF) return 0;
                     string[n++]=tolower(ch);
                     while(isalpha(ch=getc(in)) && ch!='\0')
                     if(n<20)string[n++]=tolower(ch);
                     string[n]='\0';
                     return 1;
                     }
                      
  //searches through the list 
  
 Nodeptr search(Nodeptr top,char string[]){
         while(top!=NULL && (strcmp(top->word,string)!=0))
         top=top->next;
         return top;
         }

Format and indent your code before posting as it's impossible to make out what it's doing the way it's now.

yeah ithink i got it.thnx guys!