zesterer/chumskyArchived
Chumsky
Chumsky is a parser combinator library used to build high-performance parsers by composing small parsing functions into complex grammars. It provides multiple parsing engines, including recursive descent and precedence-climbing implementations for resolving the order of operations in mathematical and logical expressions.
The library is distinguished by its zero-copy text parsing, which minimizes memory allocations to increase throughput, and its ability to run without a standard library for use in embedded or resource-constrained environments. It also features an error-recovering parser that identifies malformed input and resumes processing to report multiple syntax errors in a single pass.
The framework covers a broad range of capabilities, including context-sensitive state management, recursive grammar support, and the integration of regular expression patterns. It includes tools for parser structure analysis, node inspection, and result caching to support backtracking and left recursion.
The library supports the development of custom languages, data format parsing, and programming language tooling.
Features
- Parser Combinators - Provides a functional parser combinator library for building complex grammars by composing small, reusable parsing functions.
- Recursive Descent Parsers - Provides a recursive descent parsing engine that translates source code into syntax trees using recursive function calls.
- Zero-Copy Parsing - Implements zero-copy parsing by returning slices of the original input buffer instead of allocating new memory for extracted text.
- Environment Support Managers - Provides environment support that enables the library to run without a standard library in restricted systems.
- No-Std Environment Adapters - Offers compatibility for environments without a standard library, enabling high-performance parsing in restricted or embedded systems.
- Expression Order Resolution - Utilizes a precedence-climbing approach to resolve the order of operations in complex expressions.
- Parsing Error Recovery - Provides mechanisms to recover from syntax errors by skipping invalid tokens and continuing to parse the input.
- Data Formats and Parsing - Provides tools for parsing various structured data formats by combining regular expressions and logic-based combinators.
- High-Performance Text Processing - Enables high-performance text processing optimized for low memory and high throughput in resource-constrained environments.
- Token-Based Stream Parsing - Converts character-based input streams into typed tokens using specialized stream extensions.
- Programming Language Development - Serves as a framework for programming language development, supporting the creation of compilers and interpreters.
- Regex-Combinator Integrations - Combines regular expression patterns with combinators to recognize flexible text patterns within a larger grammar.
- Memoization Caches - Utilizes memoization caches to store previous parsing results, eliminating redundant computations and supporting left-recursive grammars.
- Operator Precedence Management - Implements operator precedence management to resolve the correct order of operations in complex mathematical and logical expressions.
- Parser Result Memoization - Stores expensive lookup results to speed up backtracking and support the processing of left-recursive grammars.
- Parsing Contexts - Supports context-sensitive parsing by tracking external state, enabling the handling of syntaxes like semantic indentation.
- Error-Resilient Parsers - Implements an error-resilient parsing engine that maintains structural integrity when encountering malformed input.
- Custom Parser Development - Supports the development of custom parsers by defining formal grammars to derive structured representations of text.
