Mercurial > hg > Applications > Grep
view c/dfaTobin/main.cc @ 100:804e51f19f17 impl-bitvector
implement allocateBitVectorList
author | Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp> |
---|---|
date | Tue, 17 Nov 2015 03:17:07 +0900 |
parents | 3d59066744d8 |
children |
line wrap: on
line source
#include <stdio.h> #include <stdlib.h> #include <string.h> const char *usr_help_str = "./dfa2bin -regex [regex]"; typedef struct dfa{ short int state : 1; }dfa,*dfaPtr; void checkAppearChar(unsigned char* regex, int regexLength){ int charTable[256]; for (int i = 0; i < regexLength; i++) { charTable[i] += 1; } for (int i = 0; i < 256; i++) { printf("charTable[%d] : %d\n",i,charTable[i]); } } void dfa2bin(unsigned char *regex){ int regexLength = strlen((char*)regex); char *regexCharTable = (char*)malloc(sizeof(char)*regexLength); dfaPtr dfa = (dfaPtr)malloc(sizeof(dfa)*(regexLength+1)); for (int i = 0; i < regexLength+1 ; i++) { dfa[i].state = 0; } dfa[0].state = 1; checkAppearChar(regex,regexLength); } int main(int argc, char *argv[]){ unsigned char *regex = 0; for (int i = 1; argv[i]; ++i) { if (strcmp(argv[i], "-regex") == 0){ regex = (unsigned char*)argv[i+1]; } } if (regex == 0){ puts(usr_help_str); exit(1); } dfa2bin(regex); printf("regex : %s\n",regex); return 0; }