From: Ulya Trofimovich Date: Mon, 4 Mar 2019 17:32:50 +0000 (+0000) Subject: Moved LICENSE, README, NO_WARRANTY and CHANGELOG to the root directory. X-Git-Tag: 1.2~124 X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=a6462025af44b0463564b4763e83403ba0852a00;p=re2c Moved LICENSE, README, NO_WARRANTY and CHANGELOG to the root directory. --- diff --git a/re2c/CHANGELOG b/CHANGELOG similarity index 100% rename from re2c/CHANGELOG rename to CHANGELOG diff --git a/re2c/LICENSE b/LICENSE similarity index 100% rename from re2c/LICENSE rename to LICENSE diff --git a/NO_WARRANTY b/NO_WARRANTY new file mode 100644 index 00000000..dfe4520e --- /dev/null +++ b/NO_WARRANTY @@ -0,0 +1,2 @@ +re2c is distributed with no warranty whatever. The author and any other +contributors take no responsibility for the consequences of its use. diff --git a/re2c/README b/README similarity index 82% rename from re2c/README rename to README index aa440a29..2fcc5777 100644 --- a/re2c/README +++ b/README @@ -4,19 +4,19 @@ re2c 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. -------------------------------------------------------------------------------- diff --git a/re2c/NO_WARRANTY b/re2c/NO_WARRANTY deleted file mode 100644 index 885a13d0..00000000 --- a/re2c/NO_WARRANTY +++ /dev/null @@ -1,2 +0,0 @@ -re2c is distributed with no warranty whatever. The author and any other -contributors take no responsibility for the consequences of its use.