re2c 3.0-1 source package in Ubuntu
Changelog
re2c (3.0-1) unstable; urgency=medium * New upstream version 3.0 * Tests: also symlink re2go, re2rust in upstream-runtests. * Patches: refresh 02 (mostly merged upstream). * Rules: also remove __run_all script from rust examples. * Lintian: add override to ignore long lines in test data. * Control: update short description to mention Rust support. -- Jeroen Ploemen <email address hidden> Thu, 03 Feb 2022 12:01:46 +0000
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Kinetic | release | main | devel | |
| Jammy | release | main | devel |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| re2c_3.0-1.dsc | 1.9 KiB | 704f349777e1b023e50449b80c672d436c34efc7c920916abe71a31951bc17f2 |
| re2c_3.0.orig.tar.xz | 1.4 MiB | b3babbbb1461e13fe22c630a40c43885efcfbbbb585830c6f4c0d791cf82ba0b |
| re2c_3.0-1.debian.tar.xz | 8.6 KiB | 867ffec17d2a8f54f7c461940b6565f676c3178c86f271a4047de1daf8bf5493 |
Available diffs
- diff from 2.2-1 to 3.0-1 (2.4 MiB)
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
