Hello Go community!
I am glad to announce the release of re2c-2.0 <https://re2c.org/releases/release_notes.html>, a lexer generator tool that now supports Go. It is an old project: the first release was in 1993. It has been used in the C world for many years, but the Go backend has been added only recently. The tool is a preprocessor for Go programs (to be used with `go generate`) that compiles declarative regular expression specifications to a deterministic finite automaton. It is well suited for all kinds of lexical analyzers starting from small string-processing routines and up to full-sized tokenizers for programming languages, etc. The key features of re2c are: - generating *fast* lexers that match or exceed the speed of hand-written code - flexible user interface that allows to use it in different environments and with different input models - fast submatch extraction based on the lookahead-TDFA algorithm <https://arxiv.org/abs/1907.08837> Resources: - official website: https://re2c.org - Go user manual: https://re2c.org/manual/manual_go.html - source code on Github: https://github.com/skvadrik/re2c - build instructions: https://re2c.org/install/install.html Feedback from the Go community is welcome! Ulya Trofimovich -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/golang-nuts/f1ae743d-c4dd-4168-92b4-a99d8b56f27bo%40googlegroups.com.
