GitHub
Connect AI assistants to GitHub - manage repos, issues, PRs, and workflows through natural language.
제작자가 쓴 설명(영어 원문)
Extract regular expressions from code, each with a ReDoS safety verdict.
이 세 가지는 절대 하나의 점수로 합치지 않아요. 의견, 측정, 인기는 서로 다른 것이니까요.
이 서버는 아직 쉬운 말로 된 요약을 쓰지 못했어요. 아래는 레지스트리에서 읽어 온 사실이에요.
쓰고 있는 AI 앱을 고른 다음 설정을 복사하세요.
필요한 것
어떤 앱을 쓰세요?
위에서 앱을 고르세요. 기억해 두었다가 다음부터는 버튼에 “…에 설치”라고 표시해요.
Claude Desktop → Settings → Developer → Edit Config를 열고 claude_desktop_config.json에 이 내용을 붙여 넣으세요
{
"mcpServers": {
"regex-le": {
"command": "npx",
"args": [
"-y",
"regex-le-mcp"
]
}
}
}터미널에서 이 명령어를 실행하세요
claude mcp add regex-le -- npx -y regex-le-mcp프로젝트의 .cursor/mcp.json 또는 ~/.cursor/mcp.json에 붙여 넣으세요
{
"mcpServers": {
"regex-le": {
"command": "npx",
"args": [
"-y",
"regex-le-mcp"
]
}
}
}브라우저가 앱을 열지 물어본 다음, 앱이 설정을 보여 주고 확인을 요청해요. 키 값은 비워 두니 직접 입력하세요.
프로젝트의 .vscode/mcp.json에 붙여 넣으세요
{
"servers": {
"regex-le": {
"type": "stdio",
"command": "npx",
"args": [
"-y",
"regex-le-mcp"
]
}
}
}브라우저가 앱을 열지 물어본 다음, 앱이 설정을 보여 주고 확인을 요청해요. 키 값은 비워 두니 직접 입력하세요.
이 서버는 내 컴퓨터에서 실행되는데, ChatGPT는 인터넷에 있는 서버에만 연결할 수 있어요. 다른 앱을 고르세요.
선택한 앱은 이 기기의 쿠키에만 저장돼요. 계정은 필요 없어요.
이 설정은 제작자의 레지스트리 정보로 만들었어요. README와 다르면 README를 따르세요.
내 컴퓨터에서 실행돼요. 설치하면 AI 앱에 도구 목록이 나타나요.
누구나 볼 수 있는 정보를 점검했고, 코드는 읽지 않았어요. 해당하지 않는 항목은 개수에서 뺐어요. · 2026년 11월 7일 점검
레지스트리 이름이 GitHub 계정 nolindnaidoo 기준으로 확인되었고, 이 계정이 저장소를 소유하고 있어요
아직 GitHub에서 이 저장소를 읽어 오지 않았어요
아직 GitHub에서 이 저장소를 읽어 오지 않았어요
내 컴퓨터에서 실행되는 서버라 인터넷 엔드포인트가 없어요
내 컴퓨터에서 실행되며, 대신 로컬 설정을 사용해요
내 컴퓨터에서 실행돼요. 도구 목록은 인터넷 엔드포인트가 있는 서버에서만 읽을 수 있어요
레지스트리에서 이 카테고리의 활성 서버 전체와 비교했어요. 스타는 게시자가 저장소를 소유한 경우에만 세요.
해당하는 기본 점검 1개 중 1개를 통과했어요. 코드는 읽지 않았어요. 키나 토큰을 넣기 전에 서버가 어떤 권한을 요구하는지 확인하고, 꼭 필요한 권한만 있는 키를 쓰세요.
레지스트리에 필수 키가 나와 있지 않아요. 다만 처음 쓸 때 로그인을 요구하는 서버도 있어요.
내 컴퓨터에서 실행돼요. AI 앱이 필요할 때 실행하고, 데이터는 제작자의 서버를 거치지 않아요(서버 자체가 온라인 서비스를 호출하는 경우는 제외).
GitHub 저장소는 마지막으로 – 변경됐고, 최신 버전(2.6.0)은 31일 전 레지스트리에 올라왔어요.
Claude Desktop, Claude Code, Cursor, VS Code처럼 MCP를 지원하는 앱에서 쓸 수 있어요. 내 컴퓨터에 Node.js도 있어야 해요.
같은 카테고리에는: GitHub, Desktop Commander, Cloudflare MCP
같은 카테고리에서 다른 제작자가 만든 서버예요. 스타 순으로 정렬했어요.
카드 보는 법:★ GitHub 스타i세 기둥: 리뷰 · 점검 · 사용 정도i업데이트 = 최신 버전을 레지스트리에 공개한 날i
Connect AI assistants to GitHub - manage repos, issues, PRs, and workflows through natural language.
MCP server for terminal commands, file operations, and process management
Cloudflare MCP servers
제작자의 저장소에서 쓰인 그대로 가져왔어요. PopNx MCP가 검토하거나 보증한 내용이 아니에요. HTML, 이미지, 스크립트는 제거했어요. 링크를 누르면 이 사이트를 벗어나요.
Regex-LE: Zero Hassle Regex Extraction & Validation
Find, test, and validate the regex patterns in the current file
Literal patterns, RegExp constructors, ReDoS screening
Useful? A star or rating is how other developers find it —
★ GitHub ·
Open any file and run one of three commands. Extract lists every regex pattern found in the document. Test runs a found — or manually entered — pattern against the file content and reports matches with real line/column positions and capture groups (named groups included). Validate checks every found pattern for syntax errors and screens it for catastrophic backtracking, reporting the input that causes it. Works in VS Code and VS Code–based editors like Cursor and VSCodium (installable from Open VSX).
| Where | What you get | Install |
|---|---|---|
| VS Code | The lint *and* the tester, in your editor | Marketplace |
| Cursor, VSCodium, Windsurf | The same extension | Open VSX |
| A terminal or a CI step | The same run over a whole tree, with exit codes | cargo install regex-le · crates.io |
| A terminal, via Node | The same command line, held to the Rust one byte for byte | npx regex-le · npm |
| Any MCP agent, via Node | extract_patterns over stdio | npx regex-le-mcp · npm |
The same engine runs as an MCP server, so an agent can call it directly instead of you running a command.
| Editor | How |
|---|---|
| VS Code 1.101+ | Nothing to install — the extension registers extract_patterns with agent mode |
| Claude Code | claude mcp add regex-le -- npx -y regex-le-mcp |
| Cursor, Windsurf, anything else | point it at npx regex-le-mcp |
extract_patterns(content, format?, filename?, maxResults?)
Returns every pattern with its flags, 1-based position and a ReDoS verdict, so "are any of the regexes in this file dangerous?" is one call rather than two. A verdict that reports a blow-up carries the witness that caused it, so an agent can check the finding instead of trusting it.
The server takes content and returns data — it reads no files and makes no network requests of its own. Published as regex-le-mcp on npm and as io.github.nolindnaidoo/regex-le in the MCP registry.
Configuring it by hand — any host with an MCP config file
Most hosts read a JSON config. Add one entry:
{
"mcpServers": { "regex-le": { "command": "npx", "args": ["-y", "regex-le-mcp"] } } }
-y skips the install prompt on first run. Pin a version if you would rather not track releases — regex-le-mcp@2.6.0.
Prefer not to go through npx on every launch? Install it once and point at the binary instead:
npm install -g regex-le-mcp
{
"mcpServers": { "regex-le": { "command": "regex-le-mcp" } } }
It speaks MCP over stdio and needs no environment variables, no API key and no configuration of its own. To check it before wiring it into anything:
echo '{"jsonrpc":"2.0","id":1,"method":"tools/list"}' | npx -y regex-le-mcp
That prints the tool list and exits — if you see extract_patterns, the server works.
Extraction scans the whole document, so constructors split across lines are found too. The document's language chooses which spellings to look for:
| Language | Form | Example | |
|---|---|---|---|
| JavaScript, TypeScript, Ruby | Literal | /[a-z]+/gi | |
| JavaScript, TypeScript | Constructor | new RegExp('\\d{4}-\\d{2}', 'g') — including multiline | |
| JavaScript, TypeScript | Bare constructor call | `RegExp("x\ | y", "i")` |
| Python | re.compile and friends | re.compile(r'(a+)+') | |
| Rust | Regex::new, RegexBuilder::new | Regex::new(r"(a+)+") | |
| Go | regexp.MustCompile, regexp.Compile | regexp.MustCompile(`(a+)+`) | |
| Java | Pattern.compile, Pattern.matches | Pattern.compile("(a+)+") | |
| Ruby | Regexp.new | Regexp.new('(a+)+') | |
| PHP | preg_match and friends | preg_match('/(a+)+/i', $s) | |
| C# | new Regex(…), Regex.IsMatch and friends | new Regex(@"(a+)+") |
A language nothing recognises is not a refusal — every spelling above is looked for. Naming it buys precision: a Python file is not scanned for bare /…/, so #!/usr/bin/env python stops reading as a pattern.
What is deliberately not extracted:
a / b, 10/29/2025, /usr/local/bin): a / preceded by an identifier, number, ), ], ., or another / is not treated as a regex — after keywords like return, it is. That question is only asked where a bare /…/ is legal.re.compile(r'(?P \w+)+@') is reported as written, and still flagged.${…} substitution. String literals, static template literals and String.raw`…` are read.(?i) rather than a string argument.re.compile(r"(a+)+b") keeps its quoted argument while a docstring holding that whole line is prose. Only when the language is known: a document nothing recognises is scanned as written, because a comment rule guessed from the wrong grammar would drop real patterns instead of phantom ones.Duplicate pattern+flags pairs are listed once. This is lexing by heuristic, not a parser for nine languages: a slash inside a string can still be picked up when its context looks expression-like.
Validate (and Test, before running a risky pattern) reports a pattern only when an input was found that demonstrably drives it into catastrophic backtracking — and reports that input alongside it, as the witness.
Your pattern is never run. It is compiled to an automaton, and that automaton is walked the way a backtracking engine walks one — depth-first, every edge in order, a dead end unwound rather than remembered — while the steps are counted. An attack string is built, pumped at two lengths, and measured against a step budget. So a finding is falsifiable: run the witness and watch.
Nothing is reported on the strength of how a pattern is *shaped*. Shape is a poor predictor in both directions: ^[a-z0-9]+(?:-[a-z0-9]+)*$ looks dangerous and is not, because every iteration must eat a - the inner class cannot produce, while (.*a){20} looks bounded and is not. A separator forcing the split is a fact about strings, so no test on syntax settles it.
Silence is not a clearance. A pattern this cannot read — a backreference, lookaround, syntax it does not parse — comes back as not decided: , never as safe.
The reports also include a rough performance score based on execution time relative to input size — treat it as a hint, not a benchmark (memory is not measured).
Extract and Validate read the document you have open. Each has a form that reads many files from disk and gives one report.
Regex-LE: Extract Patterns from Workspace or Regex-LE: Validate Patterns in Workspace from the command palette.Extract Patterns from Folder or Validate Patterns in Folder. The same two commands in the palette ask for a folder.A project writes the same pattern in many places, so the report is the distinct patterns and where each one is, the most widely used first:
# Regex-LE workspace report
my-project · 3 file(s) read · 3 distinct pattern(s) in 3 file(s)
| Pattern | Files |
|---|---|
/\d+/g | 2 |
/\d+/ | 1 |
/^x$/ | 1 |
/\d+/g (2)src/a.ts · 1:11src/b.ts · 1:11/\d+/ (1)src/c.py · 2:5/^x$/ (1)src/a.ts · 2:11
Two patterns are the same when their text and flags are, so /\d+/g and /\d+/ are listed apart. A pattern is counted once per file, at the first place it is written there.
The report opens with a table of the files that hold something to look at, then lists the patterns that can hang:
# Regex-LE workspace report
my-project · 3 file(s) read · 5 pattern(s), 1 can hang, 1 not checked
| File | Patterns | Can hang | Not checked |
|---|---|---|---|
src/a.ts | 2 | 1 | 0 |
src/b.py | 2 | 0 | 1 |
1 other file(s) hold only patterns with no finding.
src/a.ts (1)/(a+)+$/ · can hang (high): exponential backtracking: 2000000 steps on 41 characters, against 229328 on 20 · complexity 0/100
Can hang means an input was found that drives the pattern into backtracking, the same search ReDoS screening describes. Not checked means the search could not answer for the pattern either way, because it uses a backreference or a lookaround. That is not a verdict on the pattern, and the report gives the reason.
A pattern written for another language's engine is read, not refused: a Python (?P \d{4}), an atomic group or a possessive quantifier is searched like any
앞부분만 보여 드려요. 나머지는 저장소에서 읽어 보세요