# Changeset 4491 for docs/Working/icGrep

Ignore:
Timestamp:
Feb 10, 2015, 6:12:53 PM (4 years ago)
Message:

Minor edits

Location:
docs/Working/icGrep
Files:
2 edited

### Legend:

Unmodified
 r4490 \end{tabular} \end{center} \caption{Matching with Bitwise Data Parallelism}\label{fig:bitwisematch} \caption{Matching {\tt d[a-z]*ed} Using Bitwise Data Parallelism}\label{fig:bitwisematch} \end{figure} In the first step the character class stream {\tt [d]} is matched and the results shifted one position (Advance) to produce marker bitstream $M_1$. Four matches indicated by marker bits are now in play simultaneously. Five matches indicated by marker bits are now in play simultaneously. The next step applies the  MatchStar operation to find all the matches that may then be reached with the Kleene-* repetition is no need to consider these matches one at a time using lazy or greedy matching strategies. Rather, the full marker stream $M_3$ of remaining possibilites after matching {\tt [e]} is easily computed using a shift and bitwise and. The final step produces marker stream $M_4$ indicating that single position computed using bitwise logic and shift. The final step produces marker stream $M_4$ indicating the single position at which the entire regular expression is matched.