math-expression-parser

Translate a TypeScript math expression parser into native implementations across languages.

1|1|Updated Jan 30, 2026

Search Tags:#typescript #translation #reference #expression #code-generation #multilanguage #parse

Ready to run

npx skills add https://github.com/caryden/special --skill math-expression-parser

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: math-expression-parser
Source: https://github.com/caryden/special/tree/main/skills/math-expression-parser
Command: npx skills add https://github.com/caryden/special --skill math-expression-parser

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Automatically translate a verified TypeScript reference for a math expression parser into native implementations across languages.

Core Features & Use Cases

Tokenizer, parser, and evaluator components with a clear node graph.
Subset extraction rules to generate only the needed parts (e.g., full pipeline or individual nodes).
Language-translation hints and tests from the reference to ensure correct behavior across languages.
Provenance header in generated code for traceability.

Quick Start

Provide the nodes you want to translate and the target language to generate a native implementation from the verified TypeScript reference.

Frequently Asked Questions about math-expression-parser

High-intent search queries and answers about installing and using this skill.

FAQPage Schema

How do I translate a math expression parser from TypeScript to another language?▼

To translate a math expression parser from TypeScript, you provide the target language and desired parser nodes. The Skill generates a native implementation using language-specific translation hints and reference tests as a behavioral contract.

Can I generate only the tokenizer instead of the full math expression parser pipeline?▼

Yes, you can generate selective node subsets of the math expression parser instead of the full pipeline. Subset extraction rules map individual components like the tokenizer, parser, or evaluator directly from the verified TypeScript reference.

What is the best way to ensure a multi-language math expression parser behaves consistently?▼

The best way to ensure consistent multi-language math expression parser behavior is using the accompanying tests from the TypeScript reference as a behavioral contract. Generated native implementations must pass these tests to enforce correct translation.

Does the generated native math expression parser code include dependency information?▼

Yes, the generated native math expression parser code includes explicit dependencies and a provenance header. This ensures traceability back to the verified TypeScript reference and clarifies all required external libraries.

How does cross-language code generation work for math expression evaluators?▼

Cross-language code generation for math expression evaluators works by leveraging language hints in to-<lang>.md files. These hints guide the translation of the verified TypeScript node graph into native implementations.

Why do I need a reference implementation to generate a math expression parser in a new language?▼

A reference implementation is needed to generate a math expression parser because it provides the verified node graph and test suite. This serves as the behavioral contract and structural blueprint for accurate native code generation.