Download
The 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
Other Useful Business Software
Full-stack observability with actually useful AI | Grafana Cloud
Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
Rate This Project
Login To Rate This Project
User Reviews
-
Excellent piece software! Cleverly written and easy to use once you understand the design, highly recommended!
-
very difficult. but it's cool. thanks quex
-
very good project
-
Thanks for great project! Simply the best!
-
Great project, great support!
