re2c 3.0-2 source package in Ubuntu
Changelog
re2c (3.0-2) unstable; urgency=medium * Watch: switch to github api. * Control: bump std-ver to 4.6.1 (from 4.6.0; no changes). -- Jeroen Ploemen <email address hidden> Sun, 04 Dec 2022 21:44:51 +0000
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Lunar | release | main | devel |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| re2c_3.0-2.dsc | 1.9 KiB | 154890a23bd0ea0dcccc75f75adb0ff6cb74ca526aa8c406ef09d71a65cfee6d |
| re2c_3.0.orig.tar.xz | 1.4 MiB | b3babbbb1461e13fe22c630a40c43885efcfbbbb585830c6f4c0d791cf82ba0b |
| re2c_3.0-2.debian.tar.xz | 8.7 KiB | bc5bff02bd1987187e230ee675c49faa87ba93160216b93f02b87c982ff90918 |
Available diffs
- diff from 3.0-1 to 3.0-2 (677 bytes)
No changes file available.
Binary packages built by this source
- re2c: lexer generator for C, C++, Go and Rust
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.
- re2c-dbgsym: debug symbols for re2c
