Removed claim that generated code runs nearly as fast as hand-coded parsers, as

this claim is not substantiated.

git-svn-id: http://svn.complang.org/ragel/trunk@159 052ea7fc-9027-0410-9066-f65837a77df0

diff --git a/doc/ragel-guide.tex b/doc/ragel-guide.tex
index 2d7c755..8104c19 100644 (file)
--- a/doc/ragel-guide.tex
+++ b/doc/ragel-guide.tex
@@ -134,9 +134,9 @@ In addition to building state machines from regular expressions, Ragel allows
 the programmer to directly specify state machines with state charts. These two
 notations may be freely combined. There are also facilities for controlling
 nondeterminism in the resulting machines and building scanners using patterns
-that themselves have embedded actions. Ragel can produce code that runs
-nearly as fast as manually constructed machines.  Ragel can handle
-integer-sized alphabets and can compile very large state machines.
+that themselves have embedded actions. Ragel can produce code that is small and
+runs very fast. Ragel can handle integer-sized alphabets and can compile very
+large state machines.
 
 \section{Motivation}