ohmjs/ohm

Features

• Grammar Rule Specification - Provides a high-level syntax for specifying the rules and structure of custom formal grammars.
• Domain Specific Languages - Acts as a comprehensive framework for creating custom domain-specific languages through syntactic rules and semantic value extraction.
• Rule-Based Text Parsers - Uses predefined linguistic grammars to tokenize, tag, and map text into structured data.
• Language Development - Provides utilities for building new programming or configuration languages using formal grammar rules.
• Earley - Uses the Earley parsing algorithm to support all context-free grammars, including those with left recursion.
• Parsing and Grammars - Implements libraries for lexical analysis, parsing, and formal grammar definition to convert raw text into structured data.
• Text Processing and Parsing - Provides libraries for matching input text against a grammar to produce a data structure.
• Data Parsing and Extraction - Identifies, isolates, and converts raw input into structured, schema-validated formats.
• Abstract Syntax Tree Generators - Transforms raw input strings into hierarchical abstract syntax trees based on a defined formal grammar.
• Context-Free Grammar Frameworks - Provides a framework for specifying language rules that support left recursion and ambiguous grammars.
• Domain Specific Languages - Implements specialized parsing for languages designed for particular application domains.
• String Parsing - Converts textual representations into structured data types and validates they match defined rules.
• Abstract Syntax Tree Parsing - Converts source code or template strings into a structured tree representation for analysis.
• String Format Specification - Validates that string content conforms to specific formal grammar patterns.
• Formal Grammar Parser Generators - Provides a tool for defining custom languages using formal grammars to parse, validate, and extract data.
• Grammar-Based Parsers - Creates hierarchical syntax trees based on specialized formal grammar rules.
• Earley Parser Implementations - Uses a non-deterministic Earley parsing engine to handle complex context-free grammars including left recursion.
• Earley Parsers - Implements an Earley parser to support all context-free grammars including those with left recursion and ambiguity.
• Grammar Validation Tools - Provides tools for validating that input strings conform to specific formal grammar definitions.
• Parser Execution Tracing - Records state transitions and rule applications to visualize the decision process of the parsing engine.
• Grammar Debugging Tools - Traces the decision process of a parser to identify and fix errors in a formal language definition.
• Parser Decision Visualizations - Generates text traces or graphical visualizations of the steps and decisions a parser takes.
• Semantic Value Extraction - Walks the generated parse tree using semantic operations to retrieve specific data from matched nodes.
• Text Extraction - Isolates and retrieves specific meaningful segments of data from larger raw text inputs.
• Parser Debugging Tools - Provides a dedicated toolkit for tracing and visualizing the step-by-step decisions the parser makes when processing input.
• Parsing Debugging Toolkits - Includes a dedicated toolkit for tracing and visualizing the step-by-step state transitions of the parsing engine.
• Language Definition Frameworks - Provides a framework for specifying the rules and structure of custom domain-specific languages.
• Non-Deterministic Parsing State Tracking - Tracks multiple parallel parsing hypotheses to handle ambiguous grammar rules without predefined operator precedence.
• Parser State Recording - Logs every rule application and state transition to visualize the internal decision process during parsing.

Star history