rust-bakery/nom

Features

• Parser Combinator Frameworks - Provides a comprehensive framework for building complex parsers by combining small, reusable parsing functions in Rust.
• Parser Combinators - Implements a functional architectural pattern where complex grammars are built by combining small, reusable parsing functions.
• Combinator-Based Composition - Chains multiple parsers together to match sequences while discarding delimiters or assembling results into tuples.
• Streaming Data Processing - Processes data arriving in chunks and signals when more input is required for a result.
• Zero-Copy Array Slicing - Efficiently extracts sub-sections of input without duplicating the underlying data to minimize memory overhead.
• Zero-Copy Data Access - Parses large inputs by returning slices of the original data to avoid memory allocation.
• Zero-Copy Parsing - Minimizes memory overhead by returning slices of the original input instead of allocating new memory during parsing.
• Bit-Level Binary Parsers - Provides tools for extracting data from binary streams using bit-level logic and pattern recognition.
• Bitstream Processing Libraries - Treats byte slices as bit streams to extract values of arbitrary bit length.
• Streaming Input Parsers - Capable of processing partial data chunks and requesting more input when the buffer is exhausted.
• Binary Integer Extraction - Extracts signed and unsigned integers of various bit-widths using configurable big or little endianness.
• Parser Behavior Modification - Transforms output via mapping, adds conditional execution, or peeks at input without consuming it.
• Binary Data Parsers - Tool for extracting typed integers and floating-point numbers from byte slices with configurable endianness.
• Text Processing and Parsing - Handles UTF-8 strings, case-insensitive comparisons, and escaped characters for structured text formats.
• Custom Text Format Parsing - Defines rules to recognize and transform structured text, escaped characters, and specific character patterns.
• Length-Delimited Encodings - Provides binary encoding schemes that prefix data segments with length headers to facilitate efficient parsing.
• Recursive Descent Parsers - Implements top-down parsing by chaining functions that match patterns and backtrack upon failure.
• Delimited Data Parsers - Parses sequences of elements separated by a specific delimiter or enclosed within tags.
• Basic Element Matching - Recognizes low-level tokens such as specific characters, bytes, or case-insensitive strings based on set criteria.
• Escaped Text Parsing - Matches byte strings containing escaped characters and transforms them into a cleaned representation.
• Parser Output Transformation - Maps a parser result through a function to convert it into a different type or result.
• Source Code Abstract Syntax Trees - Builds abstract syntax trees from source code by defining grammar rules and handling operator precedence.
• Character Classifications - Identifies character sequences based on properties such as alphanumeric, numeric, hexadecimal, or whitespace.
• Input Type Abstractions - Uses traits to allow the same parsing logic to operate over different input types like byte slices or character streams.
• Abstract Syntax Tree Parsing - Constructs abstract syntax trees from source code using whitespace handling and error location tracking.
• Parse Error Reporters - Aggregates error codes and input pointers to pinpoint the exact location of parsing failures.
• Operator Precedence Management - Parses complex expressions based on a defined set of operator precedence rules.
• Parser State Tracking - Maintains internal state of the parser to track the remaining input slice and current position.
• Input Validation - Checks input against regular expressions or custom predicates to ensure it matches specific criteria.

Star history