re2c-generates-faster-lexers-than-flex

Summary

When building a parser or interpreter, the tool that turns your token patterns into runnable recognition code can be a bottleneck. This observation says that re2c, which writes the state machine as direct branching code, runs roughly two to three times faster than flex's table-lookup method, so it matters as a concrete speedup option if you are choosing a lexer generator for a performance-sensitive project.