Ignore:
Timestamp:
Jun 25, 2014, 4:27:33 PM (5 years ago)
Author:
cameron
Message:

Clean-ups

File:
1 edited

Legend:

Unmodified
Added
Removed
  • docs/Working/re/pact051-cameron.tex

    r3894 r3896  
    214214different way: representing all possible current NFA states
    215215as a bit vector and performing parallel transitions to a new
    216 set of states using table lookups and bitwise logic.    Whereas
    217 our approach can match multiple characters per step, bit-parallel
     216set of states using table lookups and bitwise logic.   
     217Whereas our approach can match multiple characters per step, bit-parallel
    218218NFA algorithms proceed through the input one byte at a time.
    219 Nevertheless, the agrep \cite{wu1992agrep} and
    220 nrgrep \cite{navarro2000} programs implemented using these techniques remain
     219Nevertheless, with the BNDM extensions, the
     220nrgrep \cite{navarro2000} program remains
    221221among the strongest competitors in regular expression matching
    222 performance, so we include them in our comparative evaluation.
     222performance, so we include it in our comparative evaluation.
    223223
    224224The remainder of this paper is organized as follows.
Note: See TracChangeset for help on using the changeset viewer.