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-0.16.tar.gz | 0004892417 4.67 MB | |
| re2c-nogenerationdatedefault.patch | 0000000449 449 Bytes | |
| re2c.changes | 0000005550 5.42 KB | |
| re2c.spec | 0000001862 1.82 KB |
Revision 31 (latest revision is 43)
Dominique Leuenberger (dimstar_suse)
accepted
request 356877
from
Martin Pluskal (pluskalm)
(revision 31)
- Update to 0.16
* Fixed bug #127 "code generation error with wide chars and
bitmaps (omitted 'goto' statement)"
* Added DFA minimization and option '--dfa-minimization
<table | moore>'
* Fixed bug #128 "very slow DFA construction (resulting in a very
large DFA)"
* Fixed bug #132 "test failure on big endian archs with 0.15.3"
- Make building more verbose
Comments 0