This is the Linux app named RE/flex lexical analyzer generator whose latest release can be downloaded as reflex-1.5.8.zip. It can be run online in the free hosting provider OnWorks for workstations.
Download and run online this app named RE/flex lexical analyzer generator with OnWorks for free.
Follow these instructions in order to run this app:
- 1. Downloaded this application in your PC.
- 2. Enter in our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.
- 3. Upload this application in such filemanager.
- 4. Start the OnWorks Linux online or Windows online emulator or MACOS online emulator from this website.
- 5. From the OnWorks Linux OS you have just started, goto our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.
- 6. Download the application, install it and run it.
SCREENSHOTS
Ad
RE/flex lexical analyzer generator
DESCRIPTION
RE/flex is the fast lexical analyzer generator (faster than Flex) with full Unicode support, indent/nodent/dedent anchors, lazy quantifiers, and many other modern features. Accepts Flex lexer specification syntax and is compatible with Bison/Yacc parsers. Generates reusable source code that is easy to understand. Supports fast scanning of UTF-8/16/32 files, strings, and streams. The reflex scanner generator tool generates clean lexer class code that is thread-safe. Generates Graphviz files to visualize state machine DFAs. RE/flex works seamlessly with Bison.Language: C++
License: BSD-3
Code quality: A+ https://lgtm.com/projects/g/Genivia/RE-flex/context:cpp
Documentation: https://www.genivia.com/doc/reflex/html/index.html
Repository: https://github.com/Genivia/RE-flex
Changelog: see SF-README.md
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 tokenizer for C/C++ code, a tokenizer for Python code, a tokenizer for Java code, 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 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
Audience
Developers
User interface
Command-line
Programming Language
C++
This is an application that can also be fetched from https://sourceforge.net/projects/re-flex/. It has been hosted in OnWorks in order to be run online in an easiest way from one of our free Operative Systems.
