wok-6.x diff re2c/description.txt @ rev 22668
mongodb: force 32 bits build
author | Pascal Bellard <pascal.bellard@slitaz.org> |
---|---|
date | Fri Jan 17 10:47:57 2020 +0100 (2020-01-17) |
parents | |
children |
line diff
1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/re2c/description.txt Fri Jan 17 10:47:57 2020 +0100 1.3 @@ -0,0 +1,19 @@ 1.4 +Re2c is a free and open-source lexer generator for C and C++. 1.5 +The main goal of the project is to generate very fast lexers that match or 1.6 +exceed the speed of carefully optimized hand-written code. Instead of using 1.7 +traditional table-driven approach, re2c encodes the underlying finite state 1.8 +automata directly in the form of conditional jumps and applies numerous 1.9 +optimizations to the generated code. The resulting programs are faster and 1.10 +often smaller than their table-driven counterparts, and they are much easier 1.11 +to debug and understand. 1.12 +Re2c has an unusual flexible user interface: instead of assuming a fixed 1.13 +program template, it leaves the definition of the interface code to the user 1.14 +and allows to configure almost every aspect of the generated code. This gives 1.15 +the users a lot of freedom in the way they bind the lexer to their particular 1.16 +environment and allows them to decide on the optimal input model. 1.17 +Re2c supports fast and lightweight submatch extraction which does not requre 1.18 +the overhead on full parsing — a feature that is rarely found in the wild. 1.19 +Re2c is used by many other projects (such as php, ninja, yasm, spamassassin, 1.20 +BRL-CAD and wake) and aims at being fully backward compatible. 1.21 +On the other hand, it is a research project and a playground for the 1.22 +development of new algorithms in the field of formal grammars and automata.