DESCRIPTION
--------------------------------------------------------------------------------
-re2c is a tool for generating C-based recognizers from regular expressions.
-re2c-based scanners are efficient: for programming languages, given similar
-specifications, a re2c-based scanner is typically almost twice as fast as a
-flex-based scanner with little or no increase in size (possibly a decrease
-on cisc architectures). Indeed, re2c-based scanners are quite competitive with
-hand-crafted ones.
-
-Unlike flex, re2c does not generate complete scanners: the user must supply some
-interface code. While this code is not bulky (about 50-100 lines for a
-flex-like scanner; see the man page and examples in the distribution) careful
-coding is required for efficiency (and correctness). One advantage of this
-arrangement is that the generated code is not tied to any particular input
-model.
+re2c is a free and open-source lexer generator for C and C++.
+
+Its main goal is generating fast lexers: at least as fast as their reasonably
+optimized hand-coded counterparts. Instead of using traditional table-driven
+approach, re2c encodes the generated finite state automata directly in the form
+of conditional jumps and comparisons. The resulting programs are faster and
+often smaller than their table-driven analogues, and they are much easier to
+debug and understand. re2c applies quite a few optimizations in order to speed
+up and compress the generated code.
+
+Another distinctive feature is its flexible interface: instead of assuming a
+fixed program template, re2c lets the programmer write most of the interface
+code and adapt the generated lexer to any particular environment.
--------------------------------------------------------------------------------