summaryrefslogtreecommitdiff
path: root/apps/gperf/README
diff options
context:
space:
mode:
Diffstat (limited to 'apps/gperf/README')
-rw-r--r--apps/gperf/README28
1 files changed, 0 insertions, 28 deletions
diff --git a/apps/gperf/README b/apps/gperf/README
deleted file mode 100644
index 956db3e570f..00000000000
--- a/apps/gperf/README
+++ /dev/null
@@ -1,28 +0,0 @@
-While teaching a data structures course at University of California,
-Irvine, I developed a program called GPERF that generates perfect hash
-functions for sets of key words. A perfect hash function is simply:
-
- A hash function and a data structure that allows
- recognition of a key word in a set of words using
- exactly 1 probe into the data structure.
-
-The gperf.texinfo file explains how the program works, the form of the
-input, what options are available, and hints on choosing the best
-options for particular key word sets. The texinfo file is readable
-both via the GNU emacs `info' command, and is also suitable for
-typesetting with TeX.
-
-The enclosed Makefile creates the executable program ``gperf'' and
-also runs some tests.
-
-Output from the GPERF program is used to recognize reserved words in
-the GNU C, GNU C++, and GNU Pascal compilers, as well as with the GNU
-indent program.
-
-For more information on GPERF, please see
-
-http://www.cs.wustl.edu/~schmidt/C++-USENIX-90.ps.gz
-
-Happy hacking!
-
-Douglas C. Schmidt