awesome-repositories.com
المدونة
awesome-repositories.com

اكتشف أفضل مستودعات المصادر المفتوحة باستخدام بحث مدعوم بالذكاء الاصطناعي.

استكشفعمليات بحث منسقةبدائل مفتوحة المصدربرمجيات ذاتية الاستضافةالمدونةخريطة الموقع
المشروعحولكيفية ترتيب النتائجالصحافةخادم MCP
قانونيالخصوصيةالشروط
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

8 مستودعات

Awesome GitHub RepositoriesDynamic Grammar Compilation

Automatically 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.

Explore 8 awesome GitHub repositories matching development tools & productivity · Dynamic Grammar Compilation. Refine with filters or upvote what's useful.

Awesome Dynamic Grammar Compilation GitHub Repositories

اعثر على أفضل المستودعات باستخدام الذكاء الاصطناعي.سنبحث عن أفضل المستودعات المطابقة باستخدام الذكاء الاصطناعي.
  • nvim-treesitter/nvim-treesitterالصورة الرمزية لـ nvim-treesitter

    nvim-treesitter/nvim-treesitter

    13,970عرض على 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
    عرض على GitHub↗13,970
  • samshadwell/trumpscriptالصورة الرمزية لـ samshadwell

    samshadwell/TrumpScript

    7,587عرض على 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
    عرض على GitHub↗7,587
  • norvig/paip-lispالصورة الرمزية لـ norvig

    norvig/paip-lisp

    7,465عرض على 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
    عرض على GitHub↗7,465
  • lark-parser/larkالصورة الرمزية لـ lark-parser

    lark-parser/lark

    5,914عرض على GitHub↗

    Lark هي مجموعة أدوات تحليل لـ Python تُستخدم لتعريف القواعد النحوية وتحويل النص الخام إلى أشجار تحليل مشروحة. تعمل كمولد لشجرة بناء الجملة المجردة ولغة تعريف قواعد نحوية لتحديد قواعد اللغة من خلال الرموز الطرفية والتعبيرات النمطية. توفر المكتبة تنفيذين أساسيين للتحليل: مكتبة تحليل Earley قادرة على التعامل مع جميع اللغات الخالية من السياق، بما في ذلك تلك التي تحتوي على غموض وعودية يسارية، ومكتبة تحليل LALR عالية الأداء مصممة للغات الحتمية ذات النفقات العامة المنخفضة للذاكرة. بعيداً عن التحليل الأساسي، تتضمن مجموعة الأدوات قدرات لتكوين القواعد النحوية المعيارية، وتحويل الشجرة القائم على القواعد، وتتبع الإحداثيات لمواقع المصدر. كما تدعم تسلسل قواعد LALR النحوية في وحدات محلل مستقلة.

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

    Pythoncykearleygrammar
    عرض على GitHub↗5,914
  • pest-parser/pestالصورة الرمزية لـ pest-parser

    pest-parser/pest

    5,355عرض على GitHub↗

    Pest is a Rust parsing library and automatic parser generator that transforms formal grammar definitions into functional parsers. It specializes in Parsing Expression Grammar to recognize and structure complex text patterns, providing a system for context-free grammar parsing. The library implements zero-copy tokenization and static grammar compilation to reduce runtime overhead. It supports no-std runtime compatibility, allowing the parser to be compiled for embedded or bare-metal environments where a standard library is unavailable. The project covers a range of parsing capabilities, inclu

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

    Rust
    عرض على GitHub↗5,355
  • hardmath123/nearleyالصورة الرمزية لـ Hardmath123

    Hardmath123/nearley

    3,740عرض على 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
    عرض على GitHub↗3,740
  • kach/nearleyالصورة الرمزية لـ kach

    kach/nearley

    3,740عرض على 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
    عرض على GitHub↗3,740
  • sbjson/sbjsonالصورة الرمزية لـ SBJson

    SBJson/SBJson

    3,717عرض على 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
    عرض على GitHub↗3,717
  1. Home
  2. Development Tools & Productivity
  3. Parser Modules
  4. Dynamic Grammar Compilation

استكشف الوسوم الفرعية

  • Grammar Compilation3 وسوم فرعيةTranslating high-level grammar rules into executable functions to improve parsing speed. **Distinct from Dynamic Grammar Compilation:** Focuses on the translation of grammar rules to functions, even if not 'dynamically' downloaded at runtime.
  • Grammar CompositionsMechanisms for importing and combining separate grammar definitions into a single integrated parser. **Distinct from Grammar Compilation:** Distinct from Grammar Compilation: focuses on the structural combination of rules rather than the translation of rules into executable code.