Quantifier Bound Token Parser
Parse bounded regex repeat quantifier tokens {n}, {n,m} or {n,}; null maximum means unbounded, not zero.
Description
Parse bounded regex repeat quantifier tokens {n}, {n,m} or {n,}; null maximum means unbounded, not zero.
Quantifier token parsing distinguishes exact repetition, a finite range and an unbounded upper count.
When to use this tool
Parse bounded regex repeat quantifier tokens {n}, {n,m} or {n,}; null maximum means unbounded, not zero.
- Prepare the supplied token fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter token. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.minimum, result.maximum. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Accept exactly brace-enclosed digits with an optional comma and optional upper digits. Bound minimum and finite maximum to one million and require a finite maximum at least minimum; return null for an open upper bound.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| token | token. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.minimum | The minimum value under the stated formula or text convention. |
| result.maximum | Nullable maximum; the condition for absence is described above. |
{
"input": {
"token": "{2,}"
},
"output": {
"result": {
"minimum": 2,
"maximum": null
}
}
}Limitations and assumptions
- No surrounding pattern, whitespace, lazy suffix, star or plus abbreviation is parsed. This does not execute the quantifier.
- All declared input fields are required and unexpected top-level fields are rejected. Numbers must be finite; lists are limited to 128 entries and ordinary text fields to 8,192 UTF-16 code units, with tighter limits where stated.
- JSON text inputs must parse within bounded nesting and size limits. Numeric outputs outside the safe finite range are rejected; large exact integer results use decimal strings. Indexes and half-open spans are zero-based unless a rank is explicitly described as one-based.
Alternative or Complementary methods
Compile generated pattern sources with explicitly chosen flags and test them on bounded representative text. Pattern sources, replacement strings and JSON string spellings require different escaping conventions.
References
Similar or alternative tools
- Quantifier Bound Token Formatter
Format bounded repeat quantifier integers with an explicit unbounded flag; ignored maximum is still validated as a nonnegative integer.
- ASCII Character Class Parser
Parse bounded ASCII bracket classes with literal characters, ordered ranges and \xHH escapes only; complements are relative to 0–127.