RE/flex lexical analyzer generator

Features

• RE/flex is fast: faster than Flex, see Wiki for performance comparisons
• Generates reusable source code that is easy to understand
• Compatible with Flex and Bison to eliminate a learning curve
• Extensive documentation in the online manual
• Adds Unicode support, property matching \p{C} and C++11, Java, C#, and Python Unicode properties for identifier name matching
• Adds indent/nodent/dedent anchors to match rules on text with indentation
• Adds lazy quantifiers to the POSIX regular expression syntax
• Adds word boundaries to the POSIX regular expression syntax
• Works with Bison and supports reentrant, bison-bridge, bison-locations, bison-complete
• Includes many examples, such as a mini C compiler, a tokenizer for C/C++ code, a tokenizer for C/C++, a tokenizer Python, a tokenizer Java, and more
• Generates clean thread-safe C++ lexer classes
• Fast and adaptive buffering of input files (UTF-8/16/32, ASCII, ISO-8859-1, EBCDIC), C++ streams, and (wide) strings
• Generates Graphviz files to visualize DFAs with the Graphviz dot tool
• Configurable Lexer class generation to customize the interface for various parsers, including Yacc and Bison
• %class and %init to customize the generated Lexer classes
• %include to modularize lex specifications
• RE/flex generates lex.yy.cpp files while Flex generates lex.yy.cc files (C++ with option -+)
• Adds an extensible hierarchy of pattern matcher engines, with a choice of regex engines, such as PCRE2, Boost.Regex, and RE/flex regex
• The RE/flex regex library makes C++11 std::regex and Boost.Regex much easier to use in plain C++ code for pattern matching on (wide) strings, files, and streams of potentially unlimited length

Follow RE/flex lexical analyzer generator

RE/flex lexical analyzer generator Web Site