summaryrefslogtreecommitdiff
path: root/README
diff options
context:
space:
mode:
authorPaul Eggert <eggert@cs.ucla.edu>2021-08-14 14:18:45 -0700
committerPaul Eggert <eggert@cs.ucla.edu>2021-08-14 14:19:55 -0700
commite87ccc7038d4f44f4601b3e8775fef09b1420dff (patch)
tree4141e7ffa83f803c9e1e44f71a3b22d037644d30 /README
parent8b2c31b646d92b7b8757f67aa68d0f2174766b74 (diff)
downloadgrep-e87ccc7038d4f44f4601b3e8775fef09b1420dff.tar.gz
doc: update cites and authors
Diffstat (limited to 'README')
-rw-r--r--README14
1 files changed, 7 insertions, 7 deletions
diff --git a/README b/README
index 7991358e..706c0bf2 100644
--- a/README
+++ b/README
@@ -12,13 +12,13 @@ GNU grep is provided "as is" with no warranty. The exact terms
under which you may use and (re)distribute this program are detailed
in the GNU General Public License, in the file COPYING.
-GNU grep is based on a fast lazy-state deterministic matcher (about
-twice as fast as stock Unix egrep) hybridized with a Boyer-Moore-Gosper
-search for a fixed string that eliminates impossible text from being
-considered by the full regexp matcher without necessarily having to
-look at every character. The result is typically many times faster
-than Unix grep or egrep. (Regular expressions containing back-references
-will run more slowly, however.)
+GNU grep is based on a fast lazy-state deterministic matcher
+hybridized with Boyer-Moore and Aho-Corasick searches for fixed
+strings that eliminate impossible text from being considered by the
+full regexp matcher without necessarily having to look at every
+character. The result is typically many times faster than traditional
+implementations. (Regular expressions containing back-references will
+run more slowly, however.)
See the files AUTHORS and THANKS for a list of authors and other contributors.