DownloadThe goal of this project is to provide a generator for lexical analyzers of maximum computational efficiency and maximum range of applications. This includes the support for Unicode (UTF8, UTF16, ...) and a large variety of other encodings directly and via nested converters such as ICU(tm) and IConv. Sophisticated buffer handling allows to operate on plain file streams, on sockets, or manually fed buffer content. 'Ready-to-build' examples explain related concepts and facilitate practical applications.
Features
- Support for Unicode and many other character encodings.
- Modes with inheritance relationships and transition rules.
- Sophisticated buffer management.
- Include stacks.
- Customized token classes.
- Template compression for code size reduction.
- Path compression for code size reduction.
- Possibility of indentation based lexical analysis, also called 'off-side rule' (INDENT, DEDENT, NODENT).
- Produces direct coded lexical analyzers.
- Adjustable implicit line and column number counting.
- Introduces DFA Algebra.
- Fuzzy-Matching/Edit Distance, Levenshtein and PseudoDamerau Automata.
- Support for DNA analysis (\RNA and \DNA).
Project Samples
License
MIT LicenseFollow Lexical Analyzer Generator Quex
You Might Also Like
BackBox seamlessly integrates with network monitoring and NetOps platforms and automates configuration backups, restores, and change detection. BackBox also provides before and after config diffs for change management, and automated remediation of discovered network security issues.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Lexical Analyzer Generator Quex!