Tool for generating C-based recognizers from regular expressions
re2c is a tool for writing fast and flexible lexers. Unlike other such
tools, it concentrates solely on generating efficient code for matching
regular expressions. This makes it suitable for a wide variety of
applications. The generated scanners approach hand-crafted ones in
terms of size and speed.
- Developed at devel:tools:compiler
- Sources inherited from project openSUSE:Factory
-
4
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory:Rebuild/re2c && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| re2c-1.1.1.tar.gz | 0005907416 5.63 MB | |
| re2c-nogenerationdatedefault.patch | 0000000507 507 Bytes | |
| re2c.changes | 0000008310 8.12 KB | |
| re2c.spec | 0000001763 1.72 KB |
Revision 35 (latest revision is 43)
Dominique Leuenberger (dimstar_suse)
accepted
request 683726
from
Tomáš Chvátal (scarabeus_iv)
(revision 35)
- Update re2c to 1.1.1 * Fixed bug #211 re2c '-V' throws 'std::out_of_range' (version to vernum conversion). * Replaced Kuklewicz POSIX disambiguation algorithm with Okui algorithm. * Optimized GOR1 algorithm (computation of tagged epsilon-closure). * Added option "--conditions" (an alias for "-c" and "--start-conditions"). * Fixed bug #201 Bugs with option: 're2c:flags:no-debug-info'. * Reworked first part of TDFA paper.
Comments 0