Skip to content

Repository files navigation

Regrets

Use Z3 or Brzozowski derivatives to generate strings that match multiple regex!

The plural of regex is regrets

To generate #1 albums, 'jay --help' recommends the -z flag.

WARNING: regrets is still in development! If you have any feedback or suggestions to improve it, let me know!

Setup

To use regrets, you need to

  • Clone this repository
  • Install Poetry
  • Run poetry install to install all dependencies
  • Run regrets via poetry run regrets (or poetry run python main.py)

How to use

regrets ships two engines as subcommands:

  • z3 — SMT-based, supports partial matching
  • brzozowski — derivative-based, fast, also exposes the DFA and step-through derivation

Run --help on any subcommand to see its options.

Z3

Generate strings that match a regex:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}"
AnP

Multiple --matching intersect:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --matching "abcd[0-9]+"
abcd4

Add --not-matching to exclude full matches, or --not-partial-matching to exclude substrings:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --not-partial-matching "[a-z]"
0KX

Brzozowski

Same generation style:

$ python main.py brzozowski generate --matching "[a-z]+z.*" -N 3 --max-len 4
az
bz
cz

Plus a few extras only this engine offers:

show flattens intersections and complements into a single regex (no more & / ~):

$ python main.py brzozowski show --matching "[a-z]+" --matching ".*z.*"
(z|[a-y]+z)([a-z]*)

dfa prints the derivative DFA:

$ python main.py brzozowski dfa --matching "abc"
States (4):
0 [start]: abc
1: bc
2: c
3 [accept]: ε
Transitions:
0 --a--> 1
1 --b--> 2
2 --c--> 3

derive steps through one character at a time, showing the residual regex:

$ python main.py brzozowski derive --matching "abc"
start [partial]: abc
> ab
'a' [partial]: bc
'b' [partial]: c
ab> c
'c' [MATCH]: ε

Full vs partial matching — --matching is anchored (the whole string must match the regex); --partial-matching only requires the string to contain a match (equivalent to wrapping with .*...*):

$ python main.py brzozowski generate --matching "[a-z]{3}" --partial-matching "b" -N 3
aba
abb
abc

--not-partial-matching excludes strings that contain the pattern anywhere. --partial-matching-file / --not-partial-matching-file take patterns-per-line files like their full-match counterparts.

PCRE constructs

The Brzozowski engine accepts a subset of PCRE:

  • (?=X) / (?!X) — lookaheads (the rest of the regex is AND'd / NOT'd with X)
  • (?<=x) / (?<!x) — lookbehinds, fixed-width 1 (single char or character class)
  • \b / \B — word boundary / non-boundary
  • (?i) / (?i:...) — case-insensitive mode (global at the start of the pattern, or scoped to a group)

show flattens these like any other regex:

$ python main.py brzozowski show --matching "\bword\b"
word

Pattern files

Pass many regex at once with --matching-file / --not-matching-file (one regex per line, # comments and blank lines ignored):

$ cat patterns.txt
# must be lowercase
[a-z].*
# must contain a digit
.*\d.*
$ python main.py brzozowski generate --matching-file patterns.txt -N 3 --min-len 2 --max-len 4
a0
a1
a2

Current Limitations

  • The Brzozowski engine handles lookaheads, variable-width lookbehinds, word boundaries, and the (?i) case-insensitive flag — other inline modifiers and backreferences are not supported yet
  • The Z3 regex parser (credits to Andrew Helwer for the original code) does not support all regex constructs at the moment (e.g., lazy quantifiers such as *?, +?, and ??). PRs are welcome!
  • Z3 is very powerful, but it can sometimes be VERY (and I mean VERY) slow if the regex is very complex. Be patient :D
  • Multiple runs of regrets with the same parameters will yield the same results. This is due to the deterministic nature of Z3. If you want different results, simply run regrets with a high -N parameter (an update that excludes previously seen strings is coming soon)

How to Contribute

PRs for missing features and overcoming limitations are always welcome!

But also, any feedback regarding usability or performance of regrets would be great!

Also, if you're using (and possibly enjoying) regrets in your projects, let me know your use case!

About

Generate strings that match multiple regex | "The plural of regex is regrets"

Resources

Stars

28 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
GitHub - AvalZ/regrets: Generate strings that match multiple regex | "The plural of regex is regrets" · GitHub
Skip to content

Repository files navigation

Regrets

Use Z3 or Brzozowski derivatives to generate strings that match multiple regex!

The plural of regex is regrets

To generate #1 albums, 'jay --help' recommends the -z flag.

WARNING: regrets is still in development! If you have any feedback or suggestions to improve it, let me know!

Setup

To use regrets, you need to

  • Clone this repository
  • Install Poetry
  • Run poetry install to install all dependencies
  • Run regrets via poetry run regrets (or poetry run python main.py)

How to use

regrets ships two engines as subcommands:

  • z3 — SMT-based, supports partial matching
  • brzozowski — derivative-based, fast, also exposes the DFA and step-through derivation

Run --help on any subcommand to see its options.

Z3

Generate strings that match a regex:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}"
AnP

Multiple --matching intersect:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --matching "abcd[0-9]+"
abcd4

Add --not-matching to exclude full matches, or --not-partial-matching to exclude substrings:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --not-partial-matching "[a-z]"
0KX

Brzozowski

Same generation style:

$ python main.py brzozowski generate --matching "[a-z]+z.*" -N 3 --max-len 4
az
bz
cz

Plus a few extras only this engine offers:

show flattens intersections and complements into a single regex (no more & / ~):

$ python main.py brzozowski show --matching "[a-z]+" --matching ".*z.*"
(z|[a-y]+z)([a-z]*)

dfa prints the derivative DFA:

$ python main.py brzozowski dfa --matching "abc"
States (4):
0 [start]: abc
1: bc
2: c
3 [accept]: ε
Transitions:
0 --a--> 1
1 --b--> 2
2 --c--> 3

derive steps through one character at a time, showing the residual regex:

$ python main.py brzozowski derive --matching "abc"
start [partial]: abc
> ab
'a' [partial]: bc
'b' [partial]: c
ab> c
'c' [MATCH]: ε

Full vs partial matching — --matching is anchored (the whole string must match the regex); --partial-matching only requires the string to contain a match (equivalent to wrapping with .*...*):

$ python main.py brzozowski generate --matching "[a-z]{3}" --partial-matching "b" -N 3
aba
abb
abc

--not-partial-matching excludes strings that contain the pattern anywhere. --partial-matching-file / --not-partial-matching-file take patterns-per-line files like their full-match counterparts.

PCRE constructs

The Brzozowski engine accepts a subset of PCRE:

  • (?=X) / (?!X) — lookaheads (the rest of the regex is AND'd / NOT'd with X)
  • (?<=x) / (?<!x) — lookbehinds, fixed-width 1 (single char or character class)
  • \b / \B — word boundary / non-boundary
  • (?i) / (?i:...) — case-insensitive mode (global at the start of the pattern, or scoped to a group)

show flattens these like any other regex:

$ python main.py brzozowski show --matching "\bword\b"
word

Pattern files

Pass many regex at once with --matching-file / --not-matching-file (one regex per line, # comments and blank lines ignored):

$ cat patterns.txt
# must be lowercase
[a-z].*
# must contain a digit
.*\d.*
$ python main.py brzozowski generate --matching-file patterns.txt -N 3 --min-len 2 --max-len 4
a0
a1
a2

Current Limitations

  • The Brzozowski engine handles lookaheads, variable-width lookbehinds, word boundaries, and the (?i) case-insensitive flag — other inline modifiers and backreferences are not supported yet
  • The Z3 regex parser (credits to Andrew Helwer for the original code) does not support all regex constructs at the moment (e.g., lazy quantifiers such as *?, +?, and ??). PRs are welcome!
  • Z3 is very powerful, but it can sometimes be VERY (and I mean VERY) slow if the regex is very complex. Be patient :D
  • Multiple runs of regrets with the same parameters will yield the same results. This is due to the deterministic nature of Z3. If you want different results, simply run regrets with a high -N parameter (an update that excludes previously seen strings is coming soon)

How to Contribute

PRs for missing features and overcoming limitations are always welcome!

But also, any feedback regarding usability or performance of regrets would be great!

Also, if you're using (and possibly enjoying) regrets in your projects, let me know your use case!

About

Generate strings that match multiple regex | "The plural of regex is regrets"

Resources

Stars

28 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Force GitHub README to respect dark mode (function() { var style = document.createElement('style'); style.textContent = ' .markdown-body { color-scheme: dark light; } .markdown-body pre { background: #161b22 !important; } .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; } .markdown-body table th, .markdown-body table td { border-color: #30363d !important; } .markdown-body img { background: #0d1117; } .markdown-body blockquote { border-left-color: #8b949e; } .markdown-body hr { border-color: #30363d; } '; document.head.appendChild(style); })(); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - AvalZ/regrets: Generate strings that match multiple regex | "The plural of regex is regrets" · GitHub
Skip to content

Repository files navigation

Regrets

Use Z3 or Brzozowski derivatives to generate strings that match multiple regex!

The plural of regex is regrets

To generate #1 albums, 'jay --help' recommends the -z flag.

WARNING: regrets is still in development! If you have any feedback or suggestions to improve it, let me know!

Setup

To use regrets, you need to

  • Clone this repository
  • Install Poetry
  • Run poetry install to install all dependencies
  • Run regrets via poetry run regrets (or poetry run python main.py)

How to use

regrets ships two engines as subcommands:

  • z3 — SMT-based, supports partial matching
  • brzozowski — derivative-based, fast, also exposes the DFA and step-through derivation

Run --help on any subcommand to see its options.

Z3

Generate strings that match a regex:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}"
AnP

Multiple --matching intersect:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --matching "abcd[0-9]+"
abcd4

Add --not-matching to exclude full matches, or --not-partial-matching to exclude substrings:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --not-partial-matching "[a-z]"
0KX

Brzozowski

Same generation style:

$ python main.py brzozowski generate --matching "[a-z]+z.*" -N 3 --max-len 4
az
bz
cz

Plus a few extras only this engine offers:

show flattens intersections and complements into a single regex (no more & / ~):

$ python main.py brzozowski show --matching "[a-z]+" --matching ".*z.*"
(z|[a-y]+z)([a-z]*)

dfa prints the derivative DFA:

$ python main.py brzozowski dfa --matching "abc"
States (4):
0 [start]: abc
1: bc
2: c
3 [accept]: ε
Transitions:
0 --a--> 1
1 --b--> 2
2 --c--> 3

derive steps through one character at a time, showing the residual regex:

$ python main.py brzozowski derive --matching "abc"
start [partial]: abc
> ab
'a' [partial]: bc
'b' [partial]: c
ab> c
'c' [MATCH]: ε

Full vs partial matching — --matching is anchored (the whole string must match the regex); --partial-matching only requires the string to contain a match (equivalent to wrapping with .*...*):

$ python main.py brzozowski generate --matching "[a-z]{3}" --partial-matching "b" -N 3
aba
abb
abc

--not-partial-matching excludes strings that contain the pattern anywhere. --partial-matching-file / --not-partial-matching-file take patterns-per-line files like their full-match counterparts.

PCRE constructs

The Brzozowski engine accepts a subset of PCRE:

  • (?=X) / (?!X) — lookaheads (the rest of the regex is AND'd / NOT'd with X)
  • (?<=x) / (?<!x) — lookbehinds, fixed-width 1 (single char or character class)
  • \b / \B — word boundary / non-boundary
  • (?i) / (?i:...) — case-insensitive mode (global at the start of the pattern, or scoped to a group)

show flattens these like any other regex:

$ python main.py brzozowski show --matching "\bword\b"
word

Pattern files

Pass many regex at once with --matching-file / --not-matching-file (one regex per line, # comments and blank lines ignored):

$ cat patterns.txt
# must be lowercase
[a-z].*
# must contain a digit
.*\d.*
$ python main.py brzozowski generate --matching-file patterns.txt -N 3 --min-len 2 --max-len 4
a0
a1
a2

Current Limitations

  • The Brzozowski engine handles lookaheads, variable-width lookbehinds, word boundaries, and the (?i) case-insensitive flag — other inline modifiers and backreferences are not supported yet
  • The Z3 regex parser (credits to Andrew Helwer for the original code) does not support all regex constructs at the moment (e.g., lazy quantifiers such as *?, +?, and ??). PRs are welcome!
  • Z3 is very powerful, but it can sometimes be VERY (and I mean VERY) slow if the regex is very complex. Be patient :D
  • Multiple runs of regrets with the same parameters will yield the same results. This is due to the deterministic nature of Z3. If you want different results, simply run regrets with a high -N parameter (an update that excludes previously seen strings is coming soon)

How to Contribute

PRs for missing features and overcoming limitations are always welcome!

But also, any feedback regarding usability or performance of regrets would be great!

Also, if you're using (and possibly enjoying) regrets in your projects, let me know your use case!

About

Generate strings that match multiple regex | "The plural of regex is regrets"

Resources

Stars

28 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Highlight search terms from Google/DuckDuckGo/Bing referrer (function() { var ref = document.referrer; var terms = []; if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) { var url = new URL(ref); var q = url.searchParams.get('q') || url.searchParams.get('p'); if (q) { terms = q.split(/\s+/).filter(function(t) { return t.length > 2; }); } } if (terms.length === 0) return; var style = document.createElement('style'); style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }'; document.head.appendChild(style); function highlight(node) { if (node.nodeType === 3) { // text node var text = node.textContent; var found = false; terms.forEach(function(term) { var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - AvalZ/regrets: Generate strings that match multiple regex | "The plural of regex is regrets" · GitHub
Skip to content

Repository files navigation

Regrets

Use Z3 or Brzozowski derivatives to generate strings that match multiple regex!

The plural of regex is regrets

To generate #1 albums, 'jay --help' recommends the -z flag.

WARNING: regrets is still in development! If you have any feedback or suggestions to improve it, let me know!

Setup

To use regrets, you need to

  • Clone this repository
  • Install Poetry
  • Run poetry install to install all dependencies
  • Run regrets via poetry run regrets (or poetry run python main.py)

How to use

regrets ships two engines as subcommands:

  • z3 — SMT-based, supports partial matching
  • brzozowski — derivative-based, fast, also exposes the DFA and step-through derivation

Run --help on any subcommand to see its options.

Z3

Generate strings that match a regex:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}"
AnP

Multiple --matching intersect:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --matching "abcd[0-9]+"
abcd4

Add --not-matching to exclude full matches, or --not-partial-matching to exclude substrings:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --not-partial-matching "[a-z]"
0KX

Brzozowski

Same generation style:

$ python main.py brzozowski generate --matching "[a-z]+z.*" -N 3 --max-len 4
az
bz
cz

Plus a few extras only this engine offers:

show flattens intersections and complements into a single regex (no more & / ~):

$ python main.py brzozowski show --matching "[a-z]+" --matching ".*z.*"
(z|[a-y]+z)([a-z]*)

dfa prints the derivative DFA:

$ python main.py brzozowski dfa --matching "abc"
States (4):
0 [start]: abc
1: bc
2: c
3 [accept]: ε
Transitions:
0 --a--> 1
1 --b--> 2
2 --c--> 3

derive steps through one character at a time, showing the residual regex:

$ python main.py brzozowski derive --matching "abc"
start [partial]: abc
> ab
'a' [partial]: bc
'b' [partial]: c
ab> c
'c' [MATCH]: ε

Full vs partial matching — --matching is anchored (the whole string must match the regex); --partial-matching only requires the string to contain a match (equivalent to wrapping with .*...*):

$ python main.py brzozowski generate --matching "[a-z]{3}" --partial-matching "b" -N 3
aba
abb
abc

--not-partial-matching excludes strings that contain the pattern anywhere. --partial-matching-file / --not-partial-matching-file take patterns-per-line files like their full-match counterparts.

PCRE constructs

The Brzozowski engine accepts a subset of PCRE:

  • (?=X) / (?!X) — lookaheads (the rest of the regex is AND'd / NOT'd with X)
  • (?<=x) / (?<!x) — lookbehinds, fixed-width 1 (single char or character class)
  • \b / \B — word boundary / non-boundary
  • (?i) / (?i:...) — case-insensitive mode (global at the start of the pattern, or scoped to a group)

show flattens these like any other regex:

$ python main.py brzozowski show --matching "\bword\b"
word

Pattern files

Pass many regex at once with --matching-file / --not-matching-file (one regex per line, # comments and blank lines ignored):

$ cat patterns.txt
# must be lowercase
[a-z].*
# must contain a digit
.*\d.*
$ python main.py brzozowski generate --matching-file patterns.txt -N 3 --min-len 2 --max-len 4
a0
a1
a2

Current Limitations

  • The Brzozowski engine handles lookaheads, variable-width lookbehinds, word boundaries, and the (?i) case-insensitive flag — other inline modifiers and backreferences are not supported yet
  • The Z3 regex parser (credits to Andrew Helwer for the original code) does not support all regex constructs at the moment (e.g., lazy quantifiers such as *?, +?, and ??). PRs are welcome!
  • Z3 is very powerful, but it can sometimes be VERY (and I mean VERY) slow if the regex is very complex. Be patient :D
  • Multiple runs of regrets with the same parameters will yield the same results. This is due to the deterministic nature of Z3. If you want different results, simply run regrets with a high -N parameter (an update that excludes previously seen strings is coming soon)

How to Contribute

PRs for missing features and overcoming limitations are always welcome!

But also, any feedback regarding usability or performance of regrets would be great!

Also, if you're using (and possibly enjoying) regrets in your projects, let me know your use case!

About

Generate strings that match multiple regex | "The plural of regex is regrets"

Resources

Stars

28 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + ' GitHub - AvalZ/regrets: Generate strings that match multiple regex | "The plural of regex is regrets" · GitHub
Skip to content

Repository files navigation

Regrets

Use Z3 or Brzozowski derivatives to generate strings that match multiple regex!

The plural of regex is regrets

To generate #1 albums, 'jay --help' recommends the -z flag.

WARNING: regrets is still in development! If you have any feedback or suggestions to improve it, let me know!

Setup

To use regrets, you need to

  • Clone this repository
  • Install Poetry
  • Run poetry install to install all dependencies
  • Run regrets via poetry run regrets (or poetry run python main.py)

How to use

regrets ships two engines as subcommands:

  • z3 — SMT-based, supports partial matching
  • brzozowski — derivative-based, fast, also exposes the DFA and step-through derivation

Run --help on any subcommand to see its options.

Z3

Generate strings that match a regex:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}"
AnP

Multiple --matching intersect:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --matching "abcd[0-9]+"
abcd4

Add --not-matching to exclude full matches, or --not-partial-matching to exclude substrings:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --not-partial-matching "[a-z]"
0KX

Brzozowski

Same generation style:

$ python main.py brzozowski generate --matching "[a-z]+z.*" -N 3 --max-len 4
az
bz
cz

Plus a few extras only this engine offers:

show flattens intersections and complements into a single regex (no more & / ~):

$ python main.py brzozowski show --matching "[a-z]+" --matching ".*z.*"
(z|[a-y]+z)([a-z]*)

dfa prints the derivative DFA:

$ python main.py brzozowski dfa --matching "abc"
States (4):
0 [start]: abc
1: bc
2: c
3 [accept]: ε
Transitions:
0 --a--> 1
1 --b--> 2
2 --c--> 3

derive steps through one character at a time, showing the residual regex:

$ python main.py brzozowski derive --matching "abc"
start [partial]: abc
> ab
'a' [partial]: bc
'b' [partial]: c
ab> c
'c' [MATCH]: ε

Full vs partial matching — --matching is anchored (the whole string must match the regex); --partial-matching only requires the string to contain a match (equivalent to wrapping with .*...*):

$ python main.py brzozowski generate --matching "[a-z]{3}" --partial-matching "b" -N 3
aba
abb
abc

--not-partial-matching excludes strings that contain the pattern anywhere. --partial-matching-file / --not-partial-matching-file take patterns-per-line files like their full-match counterparts.

PCRE constructs

The Brzozowski engine accepts a subset of PCRE:

  • (?=X) / (?!X) — lookaheads (the rest of the regex is AND'd / NOT'd with X)
  • (?<=x) / (?<!x) — lookbehinds, fixed-width 1 (single char or character class)
  • \b / \B — word boundary / non-boundary
  • (?i) / (?i:...) — case-insensitive mode (global at the start of the pattern, or scoped to a group)

show flattens these like any other regex:

$ python main.py brzozowski show --matching "\bword\b"
word

Pattern files

Pass many regex at once with --matching-file / --not-matching-file (one regex per line, # comments and blank lines ignored):

$ cat patterns.txt
# must be lowercase
[a-z].*
# must contain a digit
.*\d.*
$ python main.py brzozowski generate --matching-file patterns.txt -N 3 --min-len 2 --max-len 4
a0
a1
a2

Current Limitations

  • The Brzozowski engine handles lookaheads, variable-width lookbehinds, word boundaries, and the (?i) case-insensitive flag — other inline modifiers and backreferences are not supported yet
  • The Z3 regex parser (credits to Andrew Helwer for the original code) does not support all regex constructs at the moment (e.g., lazy quantifiers such as *?, +?, and ??). PRs are welcome!
  • Z3 is very powerful, but it can sometimes be VERY (and I mean VERY) slow if the regex is very complex. Be patient :D
  • Multiple runs of regrets with the same parameters will yield the same results. This is due to the deterministic nature of Z3. If you want different results, simply run regrets with a high -N parameter (an update that excludes previously seen strings is coming soon)

How to Contribute

PRs for missing features and overcoming limitations are always welcome!

But also, any feedback regarding usability or performance of regrets would be great!

Also, if you're using (and possibly enjoying) regrets in your projects, let me know your use case!

About

Generate strings that match multiple regex | "The plural of regex is regrets"

Resources

Stars

28 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - AvalZ/regrets: Generate strings that match multiple regex | "The plural of regex is regrets" · GitHub
Skip to content

Repository files navigation

Regrets

Use Z3 or Brzozowski derivatives to generate strings that match multiple regex!

The plural of regex is regrets

To generate #1 albums, 'jay --help' recommends the -z flag.

WARNING: regrets is still in development! If you have any feedback or suggestions to improve it, let me know!

Setup

To use regrets, you need to

  • Clone this repository
  • Install Poetry
  • Run poetry install to install all dependencies
  • Run regrets via poetry run regrets (or poetry run python main.py)

How to use

regrets ships two engines as subcommands:

  • z3 — SMT-based, supports partial matching
  • brzozowski — derivative-based, fast, also exposes the DFA and step-through derivation

Run --help on any subcommand to see its options.

Z3

Generate strings that match a regex:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}"
AnP

Multiple --matching intersect:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --matching "abcd[0-9]+"
abcd4

Add --not-matching to exclude full matches, or --not-partial-matching to exclude substrings:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --not-partial-matching "[a-z]"
0KX

Brzozowski

Same generation style:

$ python main.py brzozowski generate --matching "[a-z]+z.*" -N 3 --max-len 4
az
bz
cz

Plus a few extras only this engine offers:

show flattens intersections and complements into a single regex (no more & / ~):

$ python main.py brzozowski show --matching "[a-z]+" --matching ".*z.*"
(z|[a-y]+z)([a-z]*)

dfa prints the derivative DFA:

$ python main.py brzozowski dfa --matching "abc"
States (4):
0 [start]: abc
1: bc
2: c
3 [accept]: ε
Transitions:
0 --a--> 1
1 --b--> 2
2 --c--> 3

derive steps through one character at a time, showing the residual regex:

$ python main.py brzozowski derive --matching "abc"
start [partial]: abc
> ab
'a' [partial]: bc
'b' [partial]: c
ab> c
'c' [MATCH]: ε

Full vs partial matching — --matching is anchored (the whole string must match the regex); --partial-matching only requires the string to contain a match (equivalent to wrapping with .*...*):

$ python main.py brzozowski generate --matching "[a-z]{3}" --partial-matching "b" -N 3
aba
abb
abc

--not-partial-matching excludes strings that contain the pattern anywhere. --partial-matching-file / --not-partial-matching-file take patterns-per-line files like their full-match counterparts.

PCRE constructs

The Brzozowski engine accepts a subset of PCRE:

  • (?=X) / (?!X) — lookaheads (the rest of the regex is AND'd / NOT'd with X)
  • (?<=x) / (?<!x) — lookbehinds, fixed-width 1 (single char or character class)
  • \b / \B — word boundary / non-boundary
  • (?i) / (?i:...) — case-insensitive mode (global at the start of the pattern, or scoped to a group)

show flattens these like any other regex:

$ python main.py brzozowski show --matching "\bword\b"
word

Pattern files

Pass many regex at once with --matching-file / --not-matching-file (one regex per line, # comments and blank lines ignored):

$ cat patterns.txt
# must be lowercase
[a-z].*
# must contain a digit
.*\d.*
$ python main.py brzozowski generate --matching-file patterns.txt -N 3 --min-len 2 --max-len 4
a0
a1
a2

Current Limitations

  • The Brzozowski engine handles lookaheads, variable-width lookbehinds, word boundaries, and the (?i) case-insensitive flag — other inline modifiers and backreferences are not supported yet
  • The Z3 regex parser (credits to Andrew Helwer for the original code) does not support all regex constructs at the moment (e.g., lazy quantifiers such as *?, +?, and ??). PRs are welcome!
  • Z3 is very powerful, but it can sometimes be VERY (and I mean VERY) slow if the regex is very complex. Be patient :D
  • Multiple runs of regrets with the same parameters will yield the same results. This is due to the deterministic nature of Z3. If you want different results, simply run regrets with a high -N parameter (an update that excludes previously seen strings is coming soon)

How to Contribute

PRs for missing features and overcoming limitations are always welcome!

But also, any feedback regarding usability or performance of regrets would be great!

Also, if you're using (and possibly enjoying) regrets in your projects, let me know your use case!

About

Generate strings that match multiple regex | "The plural of regex is regrets"

Resources

Stars

28 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - AvalZ/regrets: Generate strings that match multiple regex | "The plural of regex is regrets" · GitHub
Skip to content

Repository files navigation

Regrets

Use Z3 or Brzozowski derivatives to generate strings that match multiple regex!

The plural of regex is regrets

To generate #1 albums, 'jay --help' recommends the -z flag.

WARNING: regrets is still in development! If you have any feedback or suggestions to improve it, let me know!

Setup

To use regrets, you need to

  • Clone this repository
  • Install Poetry
  • Run poetry install to install all dependencies
  • Run regrets via poetry run regrets (or poetry run python main.py)

How to use

regrets ships two engines as subcommands:

  • z3 — SMT-based, supports partial matching
  • brzozowski — derivative-based, fast, also exposes the DFA and step-through derivation

Run --help on any subcommand to see its options.

Z3

Generate strings that match a regex:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}"
AnP

Multiple --matching intersect:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --matching "abcd[0-9]+"
abcd4

Add --not-matching to exclude full matches, or --not-partial-matching to exclude substrings:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --not-partial-matching "[a-z]"
0KX

Brzozowski

Same generation style:

$ python main.py brzozowski generate --matching "[a-z]+z.*" -N 3 --max-len 4
az
bz
cz

Plus a few extras only this engine offers:

show flattens intersections and complements into a single regex (no more & / ~):

$ python main.py brzozowski show --matching "[a-z]+" --matching ".*z.*"
(z|[a-y]+z)([a-z]*)

dfa prints the derivative DFA:

$ python main.py brzozowski dfa --matching "abc"
States (4):
0 [start]: abc
1: bc
2: c
3 [accept]: ε
Transitions:
0 --a--> 1
1 --b--> 2
2 --c--> 3

derive steps through one character at a time, showing the residual regex:

$ python main.py brzozowski derive --matching "abc"
start [partial]: abc
> ab
'a' [partial]: bc
'b' [partial]: c
ab> c
'c' [MATCH]: ε

Full vs partial matching — --matching is anchored (the whole string must match the regex); --partial-matching only requires the string to contain a match (equivalent to wrapping with .*...*):

$ python main.py brzozowski generate --matching "[a-z]{3}" --partial-matching "b" -N 3
aba
abb
abc

--not-partial-matching excludes strings that contain the pattern anywhere. --partial-matching-file / --not-partial-matching-file take patterns-per-line files like their full-match counterparts.

PCRE constructs

The Brzozowski engine accepts a subset of PCRE:

  • (?=X) / (?!X) — lookaheads (the rest of the regex is AND'd / NOT'd with X)
  • (?<=x) / (?<!x) — lookbehinds, fixed-width 1 (single char or character class)
  • \b / \B — word boundary / non-boundary
  • (?i) / (?i:...) — case-insensitive mode (global at the start of the pattern, or scoped to a group)

show flattens these like any other regex:

$ python main.py brzozowski show --matching "\bword\b"
word

Pattern files

Pass many regex at once with --matching-file / --not-matching-file (one regex per line, # comments and blank lines ignored):

$ cat patterns.txt
# must be lowercase
[a-z].*
# must contain a digit
.*\d.*
$ python main.py brzozowski generate --matching-file patterns.txt -N 3 --min-len 2 --max-len 4
a0
a1
a2

Current Limitations

  • The Brzozowski engine handles lookaheads, variable-width lookbehinds, word boundaries, and the (?i) case-insensitive flag — other inline modifiers and backreferences are not supported yet
  • The Z3 regex parser (credits to Andrew Helwer for the original code) does not support all regex constructs at the moment (e.g., lazy quantifiers such as *?, +?, and ??). PRs are welcome!
  • Z3 is very powerful, but it can sometimes be VERY (and I mean VERY) slow if the regex is very complex. Be patient :D
  • Multiple runs of regrets with the same parameters will yield the same results. This is due to the deterministic nature of Z3. If you want different results, simply run regrets with a high -N parameter (an update that excludes previously seen strings is coming soon)

How to Contribute

PRs for missing features and overcoming limitations are always welcome!

But also, any feedback regarding usability or performance of regrets would be great!

Also, if you're using (and possibly enjoying) regrets in your projects, let me know your use case!

About

Generate strings that match multiple regex | "The plural of regex is regrets"

Resources

Stars

28 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Universal Dark Mode - works on any site (function() { var enabled = true; function applyDarkMode() { if (!enabled) return; // Create style element if it doesn't exist var style = document.getElementById('universal-dark-mode-style'); if (!style) { style = document.createElement('style'); style.id = 'universal-dark-mode-style'; document.head.appendChild(style); } // Dark mode CSS - inverts colors but preserves images/video style.textContent = ' /* Invert everything except media */ html { filter: invert(1) hue-rotate(180deg) !important; background: #1a1a2e !important; } /* Restore images, videos, iframes, canvas */ img, video, iframe, canvas, svg, picture, [style*="background-image"] { filter: invert(1) hue-rotate(180deg) !important; } /* Preserve specific elements that should not be inverted */ .no-dark-mode, .no-dark-mode *, [data-theme="light"], [data-theme="light"], .ace_editor, .ace_editor *, .CodeMirror, .CodeMirror *, .monaco-editor, .monaco-editor *, .markdown-body pre, .markdown-body pre *, .highlight, .highlight *, pre code, pre code * { filter: none !important; } /* Fix common UI elements */ .modal, .popup, .dropdown-menu, .tooltip, .popover { filter: invert(1) hue-rotate(180deg) !important; background: #2d2d44 !important; border-color: #444 !important; } /* Scrollbars */ ::-webkit-scrollbar { background: #1a1a2e !important; } ::-webkit-scrollbar-thumb { background: #444 !important; } ::-webkit-scrollbar-thumb:hover { background: #555 !important; } /* Selection */ ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; } ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; } '; } function removeDarkMode() { var style = document.getElementById('universal-dark-mode-style'); if (style) style.remove(); } // Toggle with Alt+Shift+D document.addEventListener('keydown', function(e) { if (e.altKey && e.shiftKey && e.key === 'D') { e.preventDefault(); enabled = !enabled; if (enabled) { applyDarkMode(); console.log('[Universal Dark Mode] Enabled'); } else { removeDarkMode(); console.log('[Universal Dark Mode] Disabled'); } } }); // Apply on load applyDarkMode(); // Re-apply on dynamic content var observer = new MutationObserver(function(mutations) { if (enabled && !document.getElementById('universal-dark-mode-style')) { applyDarkMode(); } }); observer.observe(document.head, { childList: true }); console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle'); })(); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })(); GitHub - AvalZ/regrets: Generate strings that match multiple regex | "The plural of regex is regrets" · GitHub
Skip to content

Repository files navigation

Regrets

Use Z3 or Brzozowski derivatives to generate strings that match multiple regex!

The plural of regex is regrets

To generate #1 albums, 'jay --help' recommends the -z flag.

WARNING: regrets is still in development! If you have any feedback or suggestions to improve it, let me know!

Setup

To use regrets, you need to

  • Clone this repository
  • Install Poetry
  • Run poetry install to install all dependencies
  • Run regrets via poetry run regrets (or poetry run python main.py)

How to use

regrets ships two engines as subcommands:

  • z3 — SMT-based, supports partial matching
  • brzozowski — derivative-based, fast, also exposes the DFA and step-through derivation

Run --help on any subcommand to see its options.

Z3

Generate strings that match a regex:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}"
AnP

Multiple --matching intersect:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --matching "abcd[0-9]+"
abcd4

Add --not-matching to exclude full matches, or --not-partial-matching to exclude substrings:

$ python main.py z3 generate --matching "[A-Za-z0-9]{3,10}" --not-partial-matching "[a-z]"
0KX

Brzozowski

Same generation style:

$ python main.py brzozowski generate --matching "[a-z]+z.*" -N 3 --max-len 4
az
bz
cz

Plus a few extras only this engine offers:

show flattens intersections and complements into a single regex (no more & / ~):

$ python main.py brzozowski show --matching "[a-z]+" --matching ".*z.*"
(z|[a-y]+z)([a-z]*)

dfa prints the derivative DFA:

$ python main.py brzozowski dfa --matching "abc"
States (4):
0 [start]: abc
1: bc
2: c
3 [accept]: ε
Transitions:
0 --a--> 1
1 --b--> 2
2 --c--> 3

derive steps through one character at a time, showing the residual regex:

$ python main.py brzozowski derive --matching "abc"
start [partial]: abc
> ab
'a' [partial]: bc
'b' [partial]: c
ab> c
'c' [MATCH]: ε

Full vs partial matching — --matching is anchored (the whole string must match the regex); --partial-matching only requires the string to contain a match (equivalent to wrapping with .*...*):

$ python main.py brzozowski generate --matching "[a-z]{3}" --partial-matching "b" -N 3
aba
abb
abc

--not-partial-matching excludes strings that contain the pattern anywhere. --partial-matching-file / --not-partial-matching-file take patterns-per-line files like their full-match counterparts.

PCRE constructs

The Brzozowski engine accepts a subset of PCRE:

  • (?=X) / (?!X) — lookaheads (the rest of the regex is AND'd / NOT'd with X)
  • (?<=x) / (?<!x) — lookbehinds, fixed-width 1 (single char or character class)
  • \b / \B — word boundary / non-boundary
  • (?i) / (?i:...) — case-insensitive mode (global at the start of the pattern, or scoped to a group)

show flattens these like any other regex:

$ python main.py brzozowski show --matching "\bword\b"
word

Pattern files

Pass many regex at once with --matching-file / --not-matching-file (one regex per line, # comments and blank lines ignored):

$ cat patterns.txt
# must be lowercase
[a-z].*
# must contain a digit
.*\d.*
$ python main.py brzozowski generate --matching-file patterns.txt -N 3 --min-len 2 --max-len 4
a0
a1
a2

Current Limitations

  • The Brzozowski engine handles lookaheads, variable-width lookbehinds, word boundaries, and the (?i) case-insensitive flag — other inline modifiers and backreferences are not supported yet
  • The Z3 regex parser (credits to Andrew Helwer for the original code) does not support all regex constructs at the moment (e.g., lazy quantifiers such as *?, +?, and ??). PRs are welcome!
  • Z3 is very powerful, but it can sometimes be VERY (and I mean VERY) slow if the regex is very complex. Be patient :D
  • Multiple runs of regrets with the same parameters will yield the same results. This is due to the deterministic nature of Z3. If you want different results, simply run regrets with a high -N parameter (an update that excludes previously seen strings is coming soon)

How to Contribute

PRs for missing features and overcoming limitations are always welcome!

But also, any feedback regarding usability or performance of regrets would be great!

Also, if you're using (and possibly enjoying) regrets in your projects, let me know your use case!

About

Generate strings that match multiple regex | "The plural of regex is regrets"

Resources

Stars

28 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages