re2c 3.0-ok1 source package in openKylin
Changelog
re2c (3.0-ok1) yangtze; urgency=medium * Build for openkylin. -- sufang <email address hidden> Fri, 02 Sep 2022 09:42:32 +0800
re2c (3.0-ok1) yangtze; urgency=medium * Build for openkylin. -- sufang <email address hidden> Fri, 02 Sep 2022 09:42:32 +0800
Series | Published | Component | Section | |
---|---|---|---|---|
Yangtze V1.0 | release | main | devel | |
Yangtze V1.0 | proposed | main | devel |
File | Size | SHA-256 Checksum |
---|---|---|
re2c_3.0.orig.tar.gz | 4.0 MiB | 9cca99504991c4cd385cf6473772dab43c1c15d4ef61f10bf482cb84ddddc764 |
re2c_3.0-ok1.debian.tar.xz | 13.6 KiB | f79ee39207f5c819832dff19096f1bfce44ee278792325c696fb599a39e5c1f1 |
re2c_3.0-ok1.dsc | 1.7 KiB | 79998b8fbacc80a4db7be557f9fcec80c06a596427e0b418d0855fc7501af1be |
re2c's main goal is generating fast lexers: at least as fast as
their reasonably optimized hand-coded counterparts. Instead of using
a 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. Quite a few optimizations are applied 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.