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