From 4905595bd59b6792552aee954a376c5e6f78bc04 Mon Sep 17 00:00:00 2001 From: schmidt Date: Fri, 21 Aug 1998 17:24:43 +0000 Subject: *** empty log message *** --- apps/gperf/README | 11 ++++++----- 1 file changed, 6 insertions(+), 5 deletions(-) (limited to 'apps') diff --git a/apps/gperf/README b/apps/gperf/README index 956db3e570f..11768b81f94 100644 --- a/apps/gperf/README +++ b/apps/gperf/README @@ -1,6 +1,6 @@ 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: +functions for sets of key words. A perfect hash function is: A hash function and a data structure that allows recognition of a key word in a set of words using @@ -9,15 +9,15 @@ functions for sets of key words. A perfect hash function is simply: 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 +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. +also runs the regression 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. +the GNU C, GNU C++, and GNU Pascal compilers. In addition, it is used +by TAO'd IDL compiler to generate operation dispatching tables. For more information on GPERF, please see @@ -26,3 +26,4 @@ http://www.cs.wustl.edu/~schmidt/C++-USENIX-90.ps.gz Happy hacking! Douglas C. Schmidt +schmidt@cs.wustl.edu -- cgit v1.2.1