openKylin re2c package

re2c 3.1-ok1 source package in openKylin

re2c (3.1-ok1) nile; urgency=high

  * Build for openKylin.

 -- openKylinBot <email address hidden>  Tue, 07 May 2024 09:35:01 +0800

Series	Pocket	Published	Component	Section
Huanghe V3.0	proposed	on 2024-10-15	main	devel
Huanghe V3.0	release	on 2024-10-15	main	devel
Nile V2.0	release	on 2024-06-06	main	devel
Nile V2.0	proposed	on 2024-05-07	main	devel

File	Size	SHA-256 Checksum
re2c_3.1.orig.tar.xz	1.4 MiB	0ac299ad359e3f512b06a99397d025cfff81d3be34464ded0656f8a96676c029
re2c_3.1-ok1.debian.tar.xz	5.9 KiB	6b9755cc3183c396d2de38ea5aea5af9dfb2513baf0239ac06e5f81b8c6a0abd
re2c_3.1-ok1.dsc	1.8 KiB	189342b50441a96574d2f1f42611ed9b7e96b2cfe45f9b2f70bf858a6c69736f

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.