Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- #include<string.h>
- #include"symtable.h"
- typedef struct node{
- char *key;
- int value;
- struct node *next;
- }node;
- struct Symtable {
- node *sym_head;
- };
- /*Iniatialize a new Symbol Table*/
- SymTable_T SymTable_new(void){
- SymTable_T symtable = NULL;
- symtable = malloc(sizeof( SymTable_T ) );
- if(symtable==NULL){
- printf("Memory allocation for---SYMTABLE---FAILED\n");
- exit(EXIT_FAILURE);
- }
- // symtable->sym_head = NULL;error: expected ‘:’, ‘,’, ‘;’, ‘}’ or ‘__attribute__’ before ‘=’ token
- // node sym_head = NULL;
- // ^
- symtable->sym_head= NULL;
- return symtable;
- }
- // int SymTable_put(SymTable_T oSymTable,const char *pcKey,const void *pvValue){
- // /*Checking if the given key is already in the Symbol Table*/
- // int exists=SymTable_contains(oSymTable,pcKey);
- // if(exists==1){
- // printf("This key is in the Symbol Tab,CANT INSERT AGAIN!!!\n");
- // return 0;
- // }
- // /* Check Runtime Errors */
- // assert(oSymTable != NULL);
- // assert(pcKey != NULL);
- // node *new_node;
- // node *list_head = oSymTable->head;
- // new_node = malloc(sizeof(node));
- // if(new_node==NULL){
- // printf("Memory allocation for ---NEW NODE---FAILED\n");
- // exit(EXIT_FAILURE);
- // }
- // /*first node to enter the list*/
- // if(oSymTable->head==NULL){
- // oSymTable->head=new_node;
- // new_node->key=pcKey;
- // new_node->value=pvValue;
- // new_node->next=NULL;
- // }else{
- // new_node->key=pcKey;
- // new_node->next=oSymTable->head;
- // new_node->value=pvValue;
- // oSymTable->head=new_node;
- // }
- // return 1;
- // }
- int main(){
- SymTable_T sym1 = NULL;
- sym1 = SymTable_new();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement