Hardmath123/nearley

Features

• Context-Free Grammar Frameworks - Implements a framework for specifying language rules that supports complex context-free grammar features like left recursion.
• Earley Parsers - Provides a complete Earley parsing engine capable of handling all context-free grammars, including those with left-recursion.
• Left-Recursive Grammar Parsing - Handles grammars with direct left recursion and right recursion without infinite loops.
• Grammar Compilation - Transforms EBNF grammar definitions into executable JavaScript modules to process input text efficiently.
• Ambiguous Parse Resolution - Identifies and returns all possible valid interpretations for a single input string when multiple valid paths exist.
• Domain Specific Language Parsers - Provides tools to analyze and interpret domain-specific languages to generate structured data.
• Language Definition Frameworks - Offers a toolkit for specifying the syntax and structure of custom programming or data languages.
• Input String Parsing - Analyzes text strings using a compiled grammar to produce structured parse trees.
• JavaScript Parser Toolkits - Provides a complete toolkit for defining context-free grammars and generating parsers for JavaScript environments.
• Parse Tree Construction - Transforms sequences of tokens into structured derivations or parse trees based on defined production rules.
• Abstract Syntax Tree Parsing - Converts raw parse trees into structured abstract syntax trees using custom post-parse transformation functions.
• Incremental Parsing - Processes input via a streaming interface to provide partial results for real-time user interfaces.
• Grammar Debugging Tools - Includes tools for inspecting parse tables and failure points to identify and resolve grammar conflicts.
• Ambiguity Management - Handles input strings with left-recursive and ambiguous structures without failing using a chart-parsing algorithm.
• Ambiguity Detection - Identifies when a single input string results in multiple valid parse trees to highlight grammar conflicts.
• Parser Debugging Tools - Allows developers to inspect internal parse tables and test input strings to debug grammar rules.
• Grammar Compositions - Supports importing and combining separate grammar definitions into a single integrated parser.
• Visual Grammar Representations - Converts technical grammar rules into visual SVG railroad diagrams for better readability.
• Tree Simplification - Reduces the complexity of parse trees by removing redundant data and whitespace to produce abstract syntax trees.
• Logic Injection - Allows embedding of arbitrary code within grammar definitions to support complex post-processing or helper functions.
• Incremental Stream Processing - Processes input incrementally as a stream to avoid loading entire datasets into memory.
• Incremental Parsing Streams - Processes input through a streaming interface to provide partial parse results for real-time applications.
• Grammatical Ambiguity Resolution - Implements strategies to identify and return multiple valid structural interpretations of a single input string.
• Incremental Parsing Streams - Provides the ability to access partial parse results during incremental input processing for responsive interfaces.
• Post-Parse Transformation - Runs custom functions after a rule match to convert raw arrays into structured objects or filtered data.
• Grammar Macros - Uses macros to define reusable rule patterns that accept arguments and expand during compilation.
• Railroad Diagram Generation - Converts grammar definitions into SVG railroad diagrams to provide a visual representation of language structure.
• Parse Error Reporters - Identifies the exact location and cause of parsing failures to simplify the grammar debugging process.
• Syntax Diagram Generators - Generates visual SVG railroad diagrams from formal grammar definitions for documentation.
• Fuzz Testing - Generates random valid strings based on grammar definitions to find edge cases and bugs through fuzzing.
• Grammar-Based Fuzzing - Produces automated tests and fuzzers from grammar definitions to ensure robust handling of diverse inputs.
• Grammar-Based Generation - Produces synthetic input strings that strictly adhere to a defined grammar for parser stress testing.
• Fuzzing Input Generators - Generates randomized data sequences specifically designed to trigger crashes and edge cases in the parser.
• Incremental Parse Feedback - Parses input streams in real time to provide immediate feedback or predictive results in a UI.
• Parser Generators - Simple and fast parser toolkit for JavaScript.

Star history