Quantifier Bound Token Formatter
Format bounded repeat quantifier integers with an explicit unbounded flag; ignored maximum is still validated as a nonnegative integer.
Description
Format bounded repeat quantifier integers with an explicit unbounded flag; ignored maximum is still validated as a nonnegative integer.
A repetition quantifier describes a minimum and either a maximum or an unbounded tail. Its token can be formatted independently of a pattern.
When to use this tool
Format bounded repeat quantifier integers with an explicit unbounded flag; ignored maximum is still validated as a nonnegative integer.
- Prepare the supplied minimum, maximum, unbounded 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 minimum, maximum, unbounded. 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.token. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Validate minimum and maximum from 0 to one million. When unbounded emit the open-ended minimum token; otherwise require maximum at least minimum and emit exact-count or bounded-range syntax.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| minimum | minimum. | Integer from 0 to 1e6 inclusive |
| maximum | maximum. | Integer from 0 to 1e6 inclusive |
| unbounded | Explicit choice for unbounded; supply a boolean rather than a text label. | true or false |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.token | The token value under the stated formula or text convention. |
{
"input": {
"minimum": 2,
"maximum": 0,
"unbounded": true
},
"output": {
"result": {
"token": "{2,}"
}
}
}Limitations and assumptions
- maximum remains a required input even when unbounded makes it unused. No atom, laziness suffix, flags or engine resource budget is included.
- 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 Parser
Parse bounded regex repeat quantifier tokens {n}, {n,m} or {n,}; null maximum means unbounded, not zero.
- ASCII Character Class Formatter
Format a positive ASCII character class using explicit two-digit hexadecimal escapes, avoiding metacharacter ambiguity.