summaryrefslogtreecommitdiff
path: root/doc/gperf_3.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/gperf_3.html')
-rw-r--r--doc/gperf_3.html11
1 files changed, 5 insertions, 6 deletions
diff --git a/doc/gperf_3.html b/doc/gperf_3.html
index dda84ab..75c03ad 100644
--- a/doc/gperf_3.html
+++ b/doc/gperf_3.html
@@ -1,16 +1,15 @@
<HTML>
<HEAD>
-<!-- This HTML file has been created by texi2html 1.51
- from gperf.texi on 7 May 2003 -->
+<!-- Created by texi2html 1.56k from gperf.texi on 12 June 2003 -->
-<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
@@ -23,7 +22,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
@@ -34,7 +33,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>