re2c 3.1-1 source package in Ubuntu
Changelog
re2c (3.1-1) unstable; urgency=medium
* New upstream version 3.1
* Control: bump Standards-Version to 4.6.2 (from 4.6.1; no further
changes).
* Patches: expand 02 to fix more typos.
* Clean: add manpages for re2{go,rust}.
* Control: add build-dep on jdupes.
* Rules: call jdupes to deal with some duplicate files in examples.
-- Jeroen Ploemen <email address hidden> Tue, 08 Aug 2023 11:36:36 +0000
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Mantic | release | main | devel |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| re2c_3.1-1.dsc | 1.9 KiB | 0fc977fd26f2f64109552fd9ae3c802294191837e347f206bae9d8006a8bb398 |
| re2c_3.1.orig.tar.xz | 1.4 MiB | 0ac299ad359e3f512b06a99397d025cfff81d3be34464ded0656f8a96676c029 |
| re2c_3.1-1.debian.tar.xz | 9.0 KiB | ddd6c4b7fdc37c72f010eb956fb02a124ce1f55f2130862e04a8dbddc1b91d48 |
Available diffs
- diff from 3.0-2 to 3.1-1 (2.1 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
