Xref: utzoo gnu.gcc.bug:1542 gnu.g++.bug:986
Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!uwm.edu!gem.mps.ohio-state.edu!usc!orion.oac.uci.edu!uci-ics!news
From: schmidt@glacier.ics.uci.edu (Doug Schmidt)
Newsgroups: gnu.gcc.bug,gnu.g++.bug
Subject: GPERF 1.9
Message-ID: <1989Oct13.023312.11156@paris.ics.uci.edu>
Date: 13 Oct 89 02:33:12 GMT
Sender: news@paris.ics.uci.edu (Network News)
Reply-To: schmidt@glacier.ics.uci.edu (Doug Schmidt)
Distribution: gnu
Organization: University of California, Irvine - Dept of ICS
Lines: 37

The new K&R C version of gperf (the GNU perfect hash function
generator program) is now available for anonymous ftp from ics.uci.edu
(128.195.1.1) in the ~ftp/pub directory as:

cperf-1.9.tar.Z

The new version fixes some minor bugs, adds a new feature that
automatically declares the generated lookup tables `readonly' (i.e.,
`const'), and creates much smaller C output for input keyword sets
processed with the -S (C switch) option.

Incidentally, I'm currently writing a paper about gperf, and would be
interested to know if anyone has found it useful for applications
other than generating compiler reserved word lookup tables.

Here's a partial list of known applications:

1. Used to generate keyword recognition routines for the GNU C, GNU C++,
   GNU Pascal, and GNU Modula 3 compilers (the latter two are experimental
   and not generally available yet).
   
2. Used in GNU indent (where it sped up the program by around 10%).

3. Used to generate assembly language opcode recognizers for 
   Intel 80x86, Z8000, and Motorola 680x0.

If anyone has employed gperf in addition applications please
let me know!

  thanks,
  
    Doug
--
Master Swordsman speak of humility;             | schmidt@ics.uci.edu (ARPA)
Philosophers speak of truth;                    | office: (714) 856-4034
Saints and wisemen speak of the Tao of no doubt;
The moon, sun, and sea speaks for itself. -- Hiroshi Hamada