1
0
mirror of https://git.savannah.gnu.org/git/gperf.git synced 2025-12-02 13:09:22 +00:00

* doc/gperf.texi (UPDATED): Correct to be today.

* doc: Regenerated by doing make in a configured tree.
	Requires makeinfo, texi2dvi, texi2pdf, and texi2html.
This commit is contained in:
Brendan Kehoe
2006-01-13 15:37:02 +00:00
parent 2f5b580a54
commit a35e3ca3f1
15 changed files with 590 additions and 522 deletions

View File

@@ -1,15 +1,16 @@
<HTML>
<HEAD>
<!-- Created by texi2html 1.56k from gperf.texi on 12 June 2003 -->
<!-- This HTML file has been created by texi2html 1.52
from gperf.texi on 13 January 2006 -->
<TITLE>Perfect Hash Function Generator - 1. Introduction</TITLE>
<TITLE>Perfect Hash Function Generator - 1 Introduction</TITLE>
</HEAD>
<BODY>
Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_2.html">previous</A>, <A HREF="gperf_4.html">next</A>, <A HREF="gperf_10.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>.
<P><HR><P>
<H1><A NAME="SEC5" HREF="gperf_toc.html#TOC5">1. Introduction</A></H1>
<H1><A NAME="SEC5" HREF="gperf_toc.html#TOC5">1 Introduction</A></H1>
<P>
<CODE>gperf</CODE> is a perfect hash function generator written in C++. It
@@ -22,7 +23,7 @@ pair of C functions. These functions determine whether a given
character string <VAR>s</VAR> occurs in <VAR>W</VAR>, using at most one probe into
the lookup table.
</P>
<P>
<CODE>gperf</CODE> currently generates the reserved keyword recognizer for
lexical analyzers in several production and research compilers and
@@ -33,7 +34,7 @@ A paper describing <CODE>gperf</CODE>'s design and implementation in greater
detail is available in the Second USENIX C++ Conference proceedings
or from <CODE>http://www.cs.wustl.edu/~schmidt/resume.html</CODE>.
</P>
<P><HR><P>
Go to the <A HREF="gperf_1.html">first</A>, <A HREF="gperf_2.html">previous</A>, <A HREF="gperf_4.html">next</A>, <A HREF="gperf_10.html">last</A> section, <A HREF="gperf_toc.html">table of contents</A>.
</BODY>