Mercurial > hg > Applications > Grep
annotate regexParser/generateSequentialSearch.cc @ 308:1188debbef10
separate CharClass
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Mon, 08 Feb 2016 12:45:45 +0900 |
parents | 63213964502a |
children | c9ac6f06e706 |
rev | line source |
---|---|
225
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1 #include <stdio.h> |
241
87ad91af8a15
turn initialization in charclasswalk
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
230
diff
changeset
|
2 #include <stdlib.h> |
225
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
3 |
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
4 #include "generateSequentialSearch.h" |
308 | 5 #include "CharClass.h" |
225
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
6 #include "subsetConstruction.h" |
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
7 |
298 | 8 void |
9 generateState1(StatePtr state,long stateNum, bool accept, FILE *fp, TransitionGeneratorPtr tg) { | |
10 fprintf(fp,"TSValue state%lx(TSValue tsv) {\n",stateNum); | |
11 if (accept && state->accept) { | |
12 fputs(" tsv=tsv.tg->stateMatch(tsv);\n",fp); | |
13 } | |
14 fputs(" if (tsv.buff.buffptr >= tsv.buff.buffend) return tsv;\n",fp); | |
15 CharClassWalkerPtr ccw = createCharClassWalker(state->cc); | |
16 if (hasNext(ccw)) fputs(" unsigned char c = *tsv.buff.buffptr++;\n",fp); | |
17 fputs(" if (0) ;\n",fp); | |
18 while (hasNext(ccw)) { | |
19 CharClassPtr cc = getNext(ccw); | |
20 unsigned long begin = cc->cond.range.begin; | |
21 unsigned long end = cc->cond.range.end; | |
22 BitVector bi = cc->nextState; | |
23 if (begin == end) { | |
24 fprintf(fp," else if (c=='%c') { return state%lx(tsv);}\n",(unsigned char)begin, bi.bitContainer); | |
25 } else { | |
26 fprintf(fp," else if (c<'%c') { tsv=tsv.tg->stateSkip(tsv);return state0(tsv);}\n",(unsigned char)begin); | |
27 fprintf(fp," else if (c<='%c') { return state%lx(tsv);} \n",(unsigned char)end, bi.bitContainer); | |
28 } | |
29 } | |
30 free(ccw); | |
31 fprintf(fp," else { tsv=tsv.tg->stateSkip(tsv); return state0(tsv);}\n"); | |
32 fputs("}\n\n",fp); | |
33 } | |
34 | |
35 void | |
36 exportState(TransitionGeneratorPtr tg) { | |
225
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
37 StatePtr state = tg->stateList; |
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
38 FILE *fp = fopen("state.cc","w"); |
241
87ad91af8a15
turn initialization in charclasswalk
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
230
diff
changeset
|
39 if (fp==NULL) { |
87ad91af8a15
turn initialization in charclasswalk
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
230
diff
changeset
|
40 perror(""); |
87ad91af8a15
turn initialization in charclasswalk
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
230
diff
changeset
|
41 fprintf(stderr,"cannot write state.cc\n"); |
87ad91af8a15
turn initialization in charclasswalk
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
230
diff
changeset
|
42 exit(1); |
87ad91af8a15
turn initialization in charclasswalk
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
230
diff
changeset
|
43 } |
225
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
44 for (;state;state = state->next) { |
298 | 45 fprintf(fp,"TSValue state%lx(TSValue tsv);\n",state->bitState.bitContainer); |
225
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
46 } |
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
47 fputs("\n",fp); |
298 | 48 // initial state must not accept empty string |
49 generateState1(tg->stateList,0L,false,fp,tg); | |
226
b4022ba23de5
add sequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
225
diff
changeset
|
50 for (state = tg->stateList;state;state = state->next) { |
298 | 51 generateState1(state,state->bitState.bitContainer,true,fp,tg); |
225
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
52 } |
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
53 fclose(fp); |
0c28ff35b4f0
add generateSequentialSearch
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
54 } |