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