a free and open-source lexer generator that supports C/C++, D, Go, Haskell, Java, JavaScript, OCaml, Python, Rust, V, Zig, and can be extended to other languages by implementing a single syntax file.
it compiles regular expressions to deterministic finite automata and translates them into direct-coded lexers in the target language (such lexers are generally faster and easier to debug than their table-driven analogues).
re2c is based on a special kind of deterministic finite automata: lookahead TDFA (tagged deterministic finite automata).
На текущий момент проект поддерживается (русскоговорящей):
The current maintainer is Ulya Trofimovich skvadrik@gmail.com
https://ru.wikipedia.org/wiki/Re2c
re2c используется в yasm:
https://yasm.tortall.net/
==========================================================================================
Ранее по теме:
Lex и кириллица в кодировке UTF-8. Возможно ли?
Отредактировано Лис (2024-12-04 08:21:51)