Release RE2C 3.0 Free generator lexical analyzers for Languages C, C ++, GO and added in this release language Rust. To support Rust, it was necessary to use another model of code generation, where the final automaton is represented as a cycle and a state variable, and not in the form of marks and transitions (since there is no Goto in Rust, unlike C, C ++ and GO).
RE2C specializes in the generation of fast and easily embedded lexers. It differs from the more well-known analog of the FLEX flexible interface, generating optimized non-balm lexisters and capture support (Submatch Extraction) based on the deterministic finite machines with tags ( TDFA ). RE2C is used in projects where the speed of the lexer is important, for example, Ninja and PHP. The project site has a selection of examples , which are now ported including on Rust.