The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

GNU grep

GNU grep is based on a fast lazy-state deterministic matcher (about twice as fast as the standard Unix grep) hybridized with a Boyer-Moore-Gosper search for a fixed string that eliminates impossible text from being considered by the full regexp match without having to look at every character; the result is usually many times faster that UNIX 'grep' or 'egrep.'
  • Download Files (local site)
  • Offical Site

    Problem Links
    String Matching (10)


    This page last modified on 2008-07-10 .
    www.algorist.com