awesome-repositories.com
Blog
awesome-repositories.com

Descubre los mejores repositorios open-source con nuestra búsqueda potenciada por IA.

ExplorarBúsquedas curadasAlternativas open-sourceSoftware autohospedableBlogMapa del sitio
ProyectoAcerca deCómo clasificamosPrensaServidor MCP
Aviso legalPrivacidadTérminos
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

11 repositorios

Awesome GitHub RepositoriesParser Generators

Tools for generating lexers and parsers from grammar definitions.

Explore 11 awesome GitHub repositories matching part of an awesome list · Parser Generators. Refine with filters or upvote what's useful.

Awesome Parser Generators GitHub Repositories

Encuentra los mejores repositorios con IA.Buscaremos los repositorios que mejor coincidan usando IA.
  • ocaml/ocamlAvatar de ocaml

    ocaml/ocaml

    6,514Ver en GitHub↗

    OCaml is a strongly typed functional language featuring a sophisticated type system and a focus on safety and expressiveness. It provides a comprehensive compiling toolchain that transforms source code into either portable bytecode or high-performance native binaries. The project is distinguished by a shared memory parallel runtime that executes computations across multiple processor cores using domains, and an algebraic effect system for managing side effects and control flow through execution context handlers. It also includes a dedicated parser generator to automatically create lexers and

    Ships a parser generator to automatically create lexers and parsers from defined grammar files.

    OCamlcompilerfunctional-languageocaml
    Ver en GitHub↗6,514
  • ohmjs/ohmAvatar de ohmjs

    ohmjs/ohm

    5,471Ver en GitHub↗

    Ohm is a formal grammar parser generator and domain-specific language framework. It provides a system for defining custom languages to parse, validate, and extract data from input text, transforming raw strings into hierarchical abstract syntax trees based on specified formal rules. The project utilizes an Earley parsing algorithm, which allows it to support all context-free grammars, including those with left recursion and ambiguity, without requiring predefined operator precedence. It also includes a dedicated debugging toolkit for tracing and visualizing the step-by-step state transitions

    Uses the Earley parsing algorithm to support all context-free grammars, including those with left recursion.

    JavaScriptcompilergrammarsjavascript
    Ver en GitHub↗5,471
  • pest-parser/pestAvatar de pest-parser

    pest-parser/pest

    5,355Ver en GitHub↗

    Pest es una librería de parsing en Rust y un generador automático de parsers que transforma definiciones de gramática formal en parsers funcionales. Se especializa en Parsing Expression Grammar (PEG) para reconocer y estructurar patrones de texto complejos, proporcionando un sistema para el parsing de gramáticas libres de contexto. La librería implementa tokenización de copia cero (zero-copy) y compilación estática de gramática para reducir la sobrecarga en tiempo de ejecución. Admite compatibilidad con runtime no-std, permitiendo que el parser sea compilado para entornos embebidos o bare-metal donde la librería estándar no está disponible. El proyecto cubre una gama de capacidades de parsing, incluyendo la extracción de pares de tokens anidados y validación de sintaxis automatizada. Se utiliza para implementar lenguajes específicos de dominio (DSL), parsing de lenguajes personalizados y evaluación de expresiones matemáticas. También proporciona informes de errores automatizados para identificar tokens inesperados o entradas faltantes.

    PEG parser generator for Rust.

    Rust
    Ver en GitHub↗5,355
  • hardmath123/nearleyAvatar de Hardmath123

    Hardmath123/nearley

    3,740Ver en GitHub↗

    Nearley is a JavaScript parser toolkit used to define context-free grammars and generate corresponding parsers. It features an EBNF grammar compiler that transforms language definitions written in extended Backus-Naur Form into executable JavaScript code, utilizing an Earley parser implementation to process any context-free grammar. The toolkit distinguishes itself by its ability to handle left-recursion and ambiguity without failing, allowing it to identify and return multiple valid derivations for a single input string. It also includes a grammar fuzzing generator to produce random strings

    Simple and fast parser toolkit for JavaScript.

    JavaScript
    Ver en GitHub↗3,740
  • kevinmehall/rust-pegAvatar de kevinmehall

    kevinmehall/rust-peg

    1,598Ver en GitHub↗

    Parsing Expression Grammar (PEG) parser generator for Rust

    PEG parser generator for Rust.

    Rustgrammarparser-generatorparsing
    Ver en GitHub↗1,598
  • philippesigaud/peggedAvatar de PhilippeSigaud

    PhilippeSigaud/Pegged

    547Ver en GitHub↗

    A Parsing Expression Grammar (PEG) module, using the D programming language.

    Parser generator for PEG grammars in D.

    D
    Ver en GitHub↗547
  • alex/rplyAvatar de alex

    alex/rply

    392Ver en GitHub↗

    An attempt to port David Beazley's PLY to RPython, and give it a cooler API.

    Port of a parsing tool to RPython.

    Python
    Ver en GitHub↗392
  • gerhobbelt/jisonAvatar de GerHobbelt

    GerHobbelt/jison

    126Ver en GitHub↗

    bison / YACC / LEX in JavaScript (LALR(1), SLR(1), etc. lexer/parser generator)

    Active fork of a JavaScript parser generator.

    JavaScript
    Ver en GitHub↗126
  • pwil3058/dunnartAvatar de pwil3058

    pwil3058/dunnart

    14Ver en GitHub↗

    LALR(1) Parser Generator for the D Programming Language

    LALR(1) parser generator for the D language.

    D
    Ver en GitHub↗14
  • uplinkcoder/fancypars-liteAvatar de UplinkCoder

    UplinkCoder/FancyPars-lite

    5Ver en GitHub↗

    FancyPars - a very fast parserGenerator

    Fast parser generator for D.

    D
    Ver en GitHub↗5
  • nikomatsakis/lalrpopAvatar de nikomatsakis

    nikomatsakis/lalrpop

    2Ver en GitHub↗

    LR(1) parser generator for Rust

    LR(1) parser generator for Rust.

    Rust
    Ver en GitHub↗2
  1. Home
  2. Part of an Awesome List
  3. Developer Tools
  4. Parser Generators

Explorar subetiquetas

  • EarleyParser generators based on the Earley algorithm, supporting all context-free grammars. **Distinct from Parser Generators:** Specializes Parser Generators [f5_mt2] by specifically implementing the Earley parsing algorithm to handle ambiguity and left recursion.