re2c 3.1-1build1 source package in Ubuntu

Changelog

re2c (3.1-1build1) noble; urgency=high

  * No change rebuild for 64-bit time_t and frame pointers.

 -- Julian Andres Klode <email address hidden>  Mon, 08 Apr 2024 18:18:23 +0200

Upload details

Uploaded by:
Julian Andres Klode
Uploaded to:
Noble
Original maintainer:
Ubuntu Developers
Architectures:
any
Section:
devel
Urgency:
Very Urgent

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release main devel
Noble release main devel

Downloads

File Size SHA-256 Checksum
re2c_3.1.orig.tar.xz 1.4 MiB 0ac299ad359e3f512b06a99397d025cfff81d3be34464ded0656f8a96676c029
re2c_3.1-1build1.debian.tar.xz 9.1 KiB 9f5a0d44d17e2141f649265b6497e7acc377ad420d045a924563dd456aeca8dd
re2c_3.1-1build1.dsc 2.0 KiB 6172b172a92039eb76f0d751c855ea8ffb1e66202819350fb359f22dc3aae5aa

Available diffs

View changes file

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