Re2c is a free and open-source lexer generator for C/C++, Go, and Rust. Its focus is on generating fast code by compiling regular expression specifications to deterministic finite automata. This approach encodes them in the form of conditional jumps in the target language, which is generally faster than table-based lexers. Re2c offers a flexible user interface that allows one to adapt the generated lexer to a particular environment and input model. It is based on the Lookahead TDFA algorithm allowing it to perform fast and lightweight submatch extraction. Re2c is available for download on GitHub, and many Linux distributions and other systems provide their packages. Bugs, patches, and other feedback can be sent via GitHub issue tracker or email. The project is community-driven, and contributing guidelines can be found on the re2c GitHub repository. The current maintainer is Ulya Trofimovich.

don't have tea/gui yet? download here

Copy the tea one-liner above into your terminal to install tea will interpret the documentation and take care of any dependencies.