Mercurial > hg > Applications > Grep
annotate regexParser/grepWalk.cc @ 317:fa590a7272ae
fix
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Sun, 08 May 2016 11:40:38 +0900 |
parents | c4d33b7c3ccd |
children | 7b8234c090f7 |
rev | line source |
---|---|
231 | 1 #include <stdio.h> |
299 | 2 #include <stdlib.h> |
316 | 3 #include <string.h> |
231 | 4 |
5 #include "grepWalk.h" | |
234
df4d04b3c34a
implement grepWalk (not confirm correct working)
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
232
diff
changeset
|
6 #include "subsetConstruction.h" |
308 | 7 #include "CharClass.h" |
299 | 8 #include "threadedSearch.h" |
234
df4d04b3c34a
implement grepWalk (not confirm correct working)
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
232
diff
changeset
|
9 |
299 | 10 StatePtr nextState(BitVector bi,TransitionGeneratorPtr tg) { |
11 // create tSearch in next state. | |
12 StatePtr state = tg->stateArray[bi.bitContainer]; | |
13 if (state == NULL) { | |
14 // on the fly subset construction. | |
15 state = createState(tg,bi); | |
16 determinize(state,tg); | |
17 tg->stateArray[bi.bitContainer] = state; | |
18 } | |
19 return state; | |
293
948428caf616
NFA maximum match worked
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
266
diff
changeset
|
20 } |
948428caf616
NFA maximum match worked
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
266
diff
changeset
|
21 |
299 | 22 void grepWalk(TransitionGeneratorPtr tg,Buffer buff) { |
23 TSValue tsv = createTSValue(tg,buff); | |
24 tg->stateStart = NEW(State); | |
25 *tg->stateStart = *tg->stateList; | |
26 tg->stateStart->accept = false; // Start state never accept | |
27 StatePtr state = tg->stateStart; | |
234
df4d04b3c34a
implement grepWalk (not confirm correct working)
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
232
diff
changeset
|
28 |
299 | 29 #if DEBUG |
30 TSValuePtr tsvp = &tsv; // make tsv visible in lldb | |
31 #endif | |
32 next: while (tsv.buff.buffptr < tsv.buff.buffend) { | |
33 if (state->accept) { | |
34 tsv = tg->stateMatch(tsv); | |
35 } | |
36 CharClassWalkerPtr ccw = createCharClassWalker(state->cc); | |
37 if (!hasNext(ccw)) { | |
38 // matched start again | |
39 state = tg->stateStart; | |
40 ccw = createCharClassWalker(state->cc); | |
235
4aab1e93a971
fix condition grepWalk.cc
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
234
diff
changeset
|
41 } |
299 | 42 unsigned char c = *tsv.buff.buffptr++; |
43 // printState(tsv.current->state); | |
44 while (hasNext(ccw)) { | |
45 CharClassPtr cc = getNext(ccw); | |
46 if (c<cc->cond.range.begin) { | |
47 state = tg->stateStart; | |
48 tsv = tg->stateSkip(tsv); | |
49 goto next; | |
50 } else if (c<=cc->cond.range.end) { | |
51 // range matched. | |
52 if (cc->cond.w.word) { | |
315 | 53 WordPtr w; |
316 | 54 for (w = &cc->cond.w;w;w = w->next) { |
315 | 55 // match the word. |
317 | 56 if (strncmp((const char *)w->word,(const char *)tsv.buff.buffptr-1,w->length)==0) break; |
315 | 57 } |
317 | 58 if (!w) continue; // if (not match) continue; |
316 | 59 tsv.buff.buffptr += w->length - 1; |
299 | 60 } |
61 state = nextState(cc->nextState,tg); | |
62 goto next; | |
63 } | |
64 } | |
65 state = tg->stateStart; | |
66 tsv = tg->stateSkip(tsv); | |
234
df4d04b3c34a
implement grepWalk (not confirm correct working)
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
232
diff
changeset
|
67 } |
299 | 68 #if DEBUG |
69 *tsvp = tsv; | |
70 #endif | |
234
df4d04b3c34a
implement grepWalk (not confirm correct working)
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
232
diff
changeset
|
71 } |
df4d04b3c34a
implement grepWalk (not confirm correct working)
Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
parents:
232
diff
changeset
|
72 |