parser.c

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "parser.h"
#include "tokenizer.h"

#define BUFFSIZE 1024
#define NULLTER '\0'
#define FALSE 0
#define TRUE 1

int search_for_space(char* string){
  /*return the index of the occurrance of spce*/
  /*if space does not occur, return -1*/
  int len = strlen(string);
  for(int i = 0; i < len; i++){
    if(string[i] == ' '){
      return i;
    }
  }
  return -1;
}

parse_output* init_parser() {
  parse_output* result = (parse_output*)malloc(sizeof(parse_output));
  result->num = 0;
  result->tasks = NULL;
  return result;
}

parse_output* parse_input(char* input, char* delim){
  if (!input){
    return NULL;
  }
  int delete_space = FALSE;
  if(search_for_space(delim)>=0){
    delete_space = TRUE;
  }
  parse_output* parse_result = init_parser();
  parse_result->tasks =(char**) malloc(sizeof(char)*BUFFSIZE);
  tokenizer* t = init_tokenizer(input, delim);
  char * cur = input;
  int original_length = 0;
  int new_length = 0;
  int count_token = 0;
  int occupy = count_token;
  while(cur){
    original_length = strlen(cur);
    char* next_cur = get_next_token(t);
    if (next_cur){
      new_length = strlen(next_cur);
    }else{
      new_length = 0;
    }
    /*the length of the token*/
    int copy_length = original_length-new_length;
    if (!next_cur || strcmp(cur, next_cur)!=0){
      parse_result->tasks[count_token] = (char*)malloc(sizeof(char)*(copy_length+1));
      strncpy(parse_result->tasks[count_token], cur, copy_length);
      /*add a 0 to the end*/
      parse_result->tasks[count_token][copy_length] = NULLTER;
      /*check if the tasks is running out of size*/
      if (occupy >= BUFFSIZE){
        parse_result->tasks= (char**)realloc(parse_result->tasks, sizeof(char*) * (BUFFSIZE+count_token));
        occupy -= BUFFSIZE;
      }
      /*if (delete_space){
        int index = search_for_space(parse_result->tasks[count_token]);
	printf("in here after? \n");
        parse_result->tasks[count_token][index] = 0;
	printf("whatatata \n");
	}*/

      count_token ++;
      occupy ++;
    }
    if (next_cur){
      for(int i=0; i<strlen(delim); i++){
        if(*next_cur == *(delim+i)){
          char new_token[2];
          new_token[0] = delim[i];
          new_token[1] = NULLTER;
          next_cur ++;
          t->pos ++;
          cur = next_cur;
          /*check if the jobs is running out of size*/
          if (occupy >= BUFFSIZE){
            parse_result->tasks = (char**)realloc(parse_result->tasks, sizeof(char*) * (BUFFSIZE+count_token));
            occupy -= BUFFSIZE;
          }
          /*string copy*/
          if(!(delete_space && strcmp((char*)new_token, " ") == 0)){
            parse_result->tasks[count_token] = (char*)malloc(sizeof(char)*(strlen(new_token) + 1));
            strcpy(parse_result->tasks[count_token], new_token);
            count_token ++;
            occupy ++;
          }
        }
      }
    }
    cur = next_cur;
    if (next_cur && *next_cur ==NULLTER){
      next_cur = NULL;
      cur = NULL;
    }
  }
  parse_result->num = count_token;
  parse_result->tasks[count_token] = NULLTER;
  free_tokenizer(t);
  return parse_result;
}

void free_parse_output(parse_output* p){
  for(int i=0; i<p->num; i++){
    free(p->tasks[i]);
  }
  free(p->tasks);
  free(p);
}