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
·

9 repositorios

Awesome GitHub RepositoriesParser Modules

Distributable packages containing parsing logic for custom or experimental language syntax.

Distinguishing note: Focuses on the packaging and distribution of parsing logic rather than the implementation of the parser.

Explore 9 awesome GitHub repositories matching development tools & productivity · Parser Modules. Refine with filters or upvote what's useful.

Awesome Parser Modules GitHub Repositories

Encuentra los mejores repositorios con IA.Buscaremos los repositorios que mejor coincidan usando IA.
  • eslint/eslintAvatar de eslint

    eslint/eslint

    27,349Ver en GitHub↗

    This project is a static analysis engine designed to identify patterns, enforce coding standards, and automate code quality improvements in software projects. By parsing source code into structured abstract syntax trees, it enables deep programmatic inspection and the automated remediation of identified programming issues. The engine functions as a pluggable linting framework, allowing developers to extend its core capabilities through a modular architecture. Users can inject custom rules, parsers, and processors to support non-standard file formats or domain-specific logic. This extensibilit

    Package parsing logic as a module for installation and reference in configuration files to enable analysis of custom or experimental language syntax.

    JavaScriptecmascripteslintjavascript
    Ver en GitHub↗27,349
  • nvim-treesitter/nvim-treesitterAvatar de nvim-treesitter

    nvim-treesitter/nvim-treesitter

    13,970Ver en GitHub↗

    This project provides an integration of Tree-sitter into the Neovim editor to enable structural code analysis. It serves as a framework for structural code navigation, context-aware syntax highlighting, and the management of language-specific parsers. The system distinguishes itself through a multi-language injection handler that identifies and parses embedded languages within a single document. It uses a dedicated parser manager to install, update, and remove grammar definitions and their associated query files. The tool covers several capability areas including incremental text selection,

    Downloads and compiles external grammar definitions into binary modules for the editor to execute.

    Tree-sitter Query
    Ver en GitHub↗13,970
  • samshadwell/trumpscriptAvatar de samshadwell

    samshadwell/TrumpScript

    7,587Ver en GitHub↗

    TrumpScript is a Python-based domain specific language and compiler extension that wraps the Python runtime to enforce custom grammar and vocabulary rules. It transforms a specialized, case-insensitive vocabulary and natural speech patterns into executable Python instructions. The implementation distinguishes itself through strict constraints on source code, including a variable name system that restricts identifiers to a predefined whitelist and a numeric parser that rejects any integer not exceeding one million. It further utilizes a token-filtering preprocessor to remove filler words and n

    Maps a specialized, spoken-style vocabulary into instructions compatible with the Python runtime.

    Python
    Ver en GitHub↗7,587
  • norvig/paip-lispAvatar de norvig

    norvig/paip-lisp

    7,465Ver en GitHub↗

    This project is a comprehensive Lisp AI implementation library that provides reference implementations for various artificial intelligence paradigms and symbolic algorithms. It functions as a multi-purpose toolkit containing a logic programming engine, a natural language processing suite, and a symbolic mathematics toolkit. The library is distinguished by its diverse architectural frameworks, including a Prolog-style execution engine that uses unification and goal-driven backtracking, and a system for simulating human decision-making through expert system shells and certainty factors. It also

    Translates high-level grammar rules into executable functions to eliminate runtime interpretation overhead.

    Common Lisp
    Ver en GitHub↗7,465
  • lark-parser/larkAvatar de lark-parser

    lark-parser/lark

    5,914Ver en GitHub↗

    Lark es un kit de herramientas de análisis sintáctico (parsing) para Python utilizado para definir gramáticas y convertir texto sin formato en árboles de análisis anotados. Sirve como un generador de árboles de sintaxis abstracta y un lenguaje de definición de gramática para especificar reglas de lenguaje a través de terminales y expresiones regulares. La biblioteca proporciona dos implementaciones principales de análisis: una biblioteca de análisis Earley capaz de manejar todos los lenguajes libres de contexto, incluidos aquellos con ambigüedad y recursión a la izquierda, y una biblioteca de análisis LALR de alto rendimiento diseñada para lenguajes deterministas con bajo consumo de memoria. Más allá del análisis central, el kit de herramientas incluye capacidades para la composición de gramáticas modulares, transformación de árboles basada en reglas y seguimiento de coordenadas para posiciones de origen. También admite la serialización de gramáticas LALR en módulos de análisis independientes.

    Provides the ability to import terminals and rules from multiple external grammar files to build complex parsing logic.

    Pythoncykearleygrammar
    Ver en GitHub↗5,914
  • 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.

    Transforms formal grammar definitions into optimized internal representations during the build process.

    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

    Transforms EBNF grammar definitions into executable JavaScript modules to process input text efficiently.

    JavaScript
    Ver en GitHub↗3,740
  • kach/nearleyAvatar de kach

    kach/nearley

    3,740Ver en GitHub↗

    Nearley is a JavaScript parser toolkit and context-free grammar compiler. It functions as an Earley parser generator that transforms BNF-like grammar definitions into executable code capable of analyzing text and generating abstract syntax trees. The project is distinguished by its ability to handle any context-free grammar, including those with left recursion and ambiguity, by maintaining multiple valid derivations for a single input. It further supports incremental parsing, allowing input strings to be processed in chunks to provide partial results and real-time feedback. Beyond core parsi

    Translates high-level grammar definitions into executable JavaScript functions for high-performance runtime parsing.

    JavaScript
    Ver en GitHub↗3,740
  • sbjson/sbjsonAvatar de SBJson

    SBJson/SBJson

    3,717Ver en GitHub↗

    SBJson is an Objective-C JSON parser and generator designed for the parsing and generation of JSON data. It functions as a strict JSON validator, enforcing rigid grammar rules to ensure input data adheres to formal specifications. The project features an incremental JSON stream parser that processes UTF8 data in chunks to extract documents without loading the entire payload into memory. It also serves as a JSON data serializer that transforms native data objects into formatted strings using deterministic key sorting. The system manages data serialization workflows and implements security mea

    Enforces rigid JSON grammar rules to reject any input that deviates from formal specifications.

    Objective-C
    Ver en GitHub↗3,717
  1. Home
  2. Development Tools & Productivity
  3. Parser Modules

Explorar subetiquetas

  • Dynamic Grammar Compilation2 sub-etiquetasAutomatically downloading and compiling language grammar definitions into binary modules at runtime. **Distinct from Parser Modules:** Focuses on the automated fetch-and-compile lifecycle rather than just distributing static parser packages.