Generate LALR(1) and recursive-descent parsers from grammar specifications.
npx skills add https://github.com/rainoftime/pl-skills --skill parser-generator
Please help me install this Agent Skill. Skill: parser-generator Source: https://github.com/rainoftime/pl-skills/tree/main/parser-generator Command: npx skills add https://github.com/rainoftime/pl-skills --skill parser-generator
This Skill automates the creation of parsers, which are essential components for understanding and processing structured text, thereby reducing the manual effort and potential errors in compiler and DSL development.
Use the parser-generator skill to create a parser for a simple arithmetic expression grammar.
High-intent search queries and answers about installing and using this skill.
You can generate parsers supporting LALR(1) and recursive-descent algorithms using Python, OCaml, and Rust. These generated parsers convert source code into an Abstract Syntax Tree (AST) for further processing.
To resolve grammar ambiguities when building a compiler, you apply precedence and associativity rules within your grammar specification. This ensures the generated parser correctly interprets conflicting language structures.
The best way to automatically generate an Abstract Syntax Tree is to use a parser generator that processes your grammar specification. It handles AST generation directly, eliminating manual parsing logic for configuration files or DSLs.
Yes, you can use LALR(1) parser generation for OCaml and Rust projects. The tool supports generating parsers in Python, OCaml, and Rust, allowing you to process structured text across these environments.
You need a parser generator for processing configuration files when the structure requires complex parsing logic that exceeds simple regex. It automates converting structured text into an AST, reducing manual effort and errors.
pgplexParse PostgreSQL SQL and generate valid DDL in pgschema.
bobmatnycAutomate prompt optimization with a declarative DSL for LLM workflows.
spencerbeggsHarden recursive-descent parsers against stack exhaustion, complexity attacks, and prototype pollution.
mcclowesDefine and generate parsing expression grammars and parsers with Peggy.
