tree-sitter-regex
Regex grammar for tree-sitter
Decision gist · record as of 2026-08-14
Yes, if you are building a tool that needs to parse or analyze regular expressions and are already using tree-sitter. The package is well-maintained within its scope, permissively licensed, and has no external runtime dependencies. However, it is a specialized grammar module—install it only if you have a specific need for tree-sitter-based regex parsing; it is not a general-purpose regex library.AI-flagged interpretation of the facts on this page — verify before relying
Before you install
- Requires Python 3.10 or later; tree-sitter core library and Python bindings must be installed separately to use this grammar.
- Medium install friction due to compiled wheels; prebuilt binaries available for common platforms (macOS x86_64/arm64, Linux x86_64/aarch64, Windows x86_64/arm64).
- Maintenance status is aging—last release was 335 days ago, though the repository remains active with a recent commit on 2025-09-13.
License · maintenance · safety
MIT (permissive) — MIT license is permissive; you can use, modify, and distribute this package freely with minimal restrictions, making it suitable for both open-source and proprietary projects.
last release 2025-09-13 (335 days) · last repo commit 2025-09-13 · 107 stars
0 known vulnerabilities (OSV.dev, 2026-08-14) · 1,987,444 downloads/mo, #3,384 on PyPI
Alternatives
Verify before relying
pip install tree-sitter-regex
import tree_sitter_regex
# Use with tree-sitter to parse regex patterns
# Requires tree-sitter library and language binding setup- Whether this package is typically used standalone or always as a dependency of another tree-sitter wrapper.
- Performance characteristics and typical parse times for regex patterns of varying complexity.
- Specific version compatibility with tree-sitter core and tree-sitter-py bindings.
What it is and what it does
tree-sitter-regex is a language grammar for tree-sitter that parses regular expressions according to PCRE2, POSIX, and JavaScript syntax standards. It enables incremental, syntax-aware parsing of regex patterns into an abstract syntax tree, which is useful for tools that need to analyze, validate, or transform regex code.
The package is a compiled extension (available as prebuilt wheels for multiple platforms) with no runtime dependencies beyond Python 3.10+. It's designed to be used as a grammar module within the tree-sitter ecosystem, typically loaded by tree-sitter bindings to provide regex parsing capabilities to higher-level applications.
Use it for
- Regex linting or validation tools that need to parse and analyze regex patterns for correctness.
- Code editors or IDEs that highlight regex syntax and provide autocomplete for regex literals.
- Static analysis tools that extract and analyze regex patterns from source code.
- Regex refactoring or transformation tools that need to understand regex AST structure.
Worth the install?
AI-flagged interpretation of the facts on this page. Verify before relying on it.
Yes, if you are building a tool that needs to parse or analyze regular expressions and are already using tree-sitter.
The package is well-maintained within its scope, permissively licensed, and has no external runtime dependencies. However, it is a specialized grammar module—install it only if you have a specific need for tree-sitter-based regex parsing; it is not a general-purpose regex library.
Install
tree-sitter-regex on PyPI
Before you install
Medium install friction due to compiled wheels; prebuilt binaries available for common platforms (macOS x86_64/arm64, Linux x86_64/aarch64, Windows x86_64/arm64). Maintenance status is aging—last release was 335 days ago, though the repository remains active with a recent commit on 2025-09-13.
Requires Python 3.10 or later; tree-sitter core library and Python bindings must be installed separately to use this grammar.
License in practice
MIT license is permissive; you can use, modify, and distribute this package freely with minimal restrictions, making it suitable for both open-source and proprietary projects.
Quickstart
pip install tree-sitter-regex
import tree_sitter_regex
# Use with tree-sitter to parse regex patterns
# Requires tree-sitter library and language binding setupVerify before relying
- Whether this package is typically used standalone or always as a dependency of another tree-sitter wrapper.
- Performance characteristics and typical parse times for regex patterns of varying complexity.
- Specific version compatibility with tree-sitter core and tree-sitter-py bindings.
Package facts
| License | MIT permissive |
| Python support | Supports the current Python release >=3.10 |
| Install friction | Medium. Platform-specific wheel |
| Runtime dependencies | None |
| Maintenance | Aging 335 days since the last release |
| Last repo commit | |
| First released | |
| Downloads | 1,987,444 / month, #3,384 on PyPI 30-day window, as of 2026-08-14 |
| Known vulnerabilities | None known OSV.dev, checked 2026-08-14 |
| Classifiers | Intended Audience :: DevelopersTopic :: Software Development :: CompilersTopic :: Text Processing :: LinguisticTyping :: Typed |
Evidence: tree_sitter_regex-0.25.0-cp310-abi3-macosx_10_9_x86_64.whl; tree_sitter_regex-0.25.0-cp310-abi3-macosx_11_0_arm64.whl; tree_sitter_regex-0.25.0-cp310-abi3-manylinux1_x86_64.manylinux_2_28_x86_64.manylinux_2_5_x86_64.whl; tree_sitter_regex-0.25.0-cp310-abi3-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl; tree_sitter_regex-0.25.0-cp310-abi3-musllinux_1_2_aarch64.whl; tree_sitter_regex-0.25.0-cp310-abi3-musllinux_1_2_x86_64.whl; tree_sitter_regex-0.25.0-cp310-abi3-win_amd64.whl; tree_sitter_regex-0.25.0-cp310-abi3-win_arm64.whl
Tags
Let your AI agent find packages like this
Example. Real query, live index.
You found this page by searching. An agent finds it by wishing: SkillFed indexes 14,416 PyPI packages by what they can do, searchable in plain language.
wish › “tree-sitter regex grammar”
- tree-sitter-regexProvides a tree-sitter grammar for parsing regular expressions in…
- tree-sitter-cProvides a C language grammar for tree-sitter, enabling incremental…
- tree-sitter-cppProvides a C++ language grammar for tree-sitter, enabling incremental…
Give your agent the search over MCP, or paste the wish link into any chat.
More Linguistic packages
Detects and normalizes text encoding from unknown or ambiguous sources, supporting all IANA character sets that Python's core library provides codecs for, with the ability to register custom codecs.
tiktoken is a fast BPE tokenizer that converts text into token sequences compatible with OpenAI models, supporting multiple encoding schemes including o200k_base and model-specific encodings.
Install it if you work with OpenAI APIs or need to understand token boundaries in GPT-family models.
Detects character encoding and language in byte sequences with high accuracy, supporting 99 encodings and returning confidence scores, language tags, and MIME types.
Install it if you need to detect character encoding or language in byte data; the rewrite makes it substantially faster and more accurate than its predecessors.
Converts Unicode text to ASCII by transliterating non-ASCII characters into their closest ASCII equivalents, with no runtime dependencies.
However, if transliteration quality or ongoing maintenance matters, consider unidecode instead despite its GPL-only license.
Lark is a parsing library that builds abstract syntax trees from context-free grammars, supporting multiple parsing algorithms (Earley, LALR(1), CYK) with automatic line and column tracking.
Python bindings to the tree-sitter parsing library, enabling incremental parsing and syntax tree analysis for source code.
See also tree-sitter-java · tree-sitter-python · tree-sitter-json · tree-sitter-html · tree-sitter-go · tree-sitter-css · tree-sitter-zig · tree-sitter-c · tree-sitter-javascript · outlines-core