Description
Construct nested text regions from caller-reviewed language tags with explicit inheritance and override keys; lexical tag-shape acceptance does not validate language-registry membership.
A protocol fixture is local test data representing headers, messages, identifiers, or request decisions. Serialization and parsing can be checked without contacting a server, while authentication, delivery, and actual client behavior require separate tests.
Construct nested text regions from caller-reviewed language tags with explicit inheritance and override keys; lexical tag-shape acceptance does not validate language-registry membership.
When to use this tool
Use this generator to create reproducible language attribute nesting fixture cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.
How to use the tool and how it works
- Supply tags, texts, nodeCount in the field shapes below. Set seed when you need an explicit replay.
- Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
- Read nodes, html. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Construct a bounded-depth span tree, giving the root an explicit supplied language and later nodes either an explicit language or inheritance. Return each effective language and escaped nested markup with parsed opening tags.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| tags | Tags | Required. Array of Text; minimum UTF-16 length 2; maximum UTF-16 length 63.; minimum items 1; maximum items 16. |
| texts | Texts | Required. Array of Text; maximum UTF-16 length 256.; minimum items 1; maximum items 16. |
| nodeCount | Node Count | Required. Safe integer; minimum 1; maximum 16. |
| seed | Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed. | Optional. Safe integer. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| nodes | Nodes | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| nodes[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 32. |
| nodes[].parentId | Parent Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 32. or Null. |
| nodes[].text | Text | Required. Text; maximum UTF-16 length 256. |
| nodes[].explicitLanguage | Explicit Language | Required. Text; minimum UTF-16 length 2; maximum UTF-16 length 63. or Null. |
| nodes[].effectiveLanguage | Effective Language | Required. Text; minimum UTF-16 length 2; maximum UTF-16 length 63. |
| nodes[].parsed | Parsed | Required. Object; no unknown keys. |
| nodes[].parsed.name | Name | Required. Text; maximum UTF-16 length 256. |
| nodes[].parsed.attributes | Attributes | Required. Array of Object; no unknown keys.; minimum items 0; maximum items 16. |
| nodes[].parsed.attributes[].name | Name | Required. Text; maximum UTF-16 length 256. |
| nodes[].parsed.attributes[].value | Value | Required. Text; maximum UTF-16 length 2048. |
| html | Html | Required. Text; maximum UTF-16 length 131072. |
| randomness | Replay metadata: source is seed or context; seed is the normalized 32-bit seed or null for a context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional numeric replay seed; normalization and precedence are explained below. | Required. Safe integer. or Null. |
| randomness.source | Source | Required. Text; one of "context", "seed". |
An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.
{
"input": {
"tags": [
"en",
"fr"
],
"texts": [
"Bonjour",
"Salut"
],
"nodeCount": 2,
"seed": 42
},
"output": {
"nodes": [
{
"id": "language-0",
"parentId": null,
"text": "Bonjour",
"explicitLanguage": "fr",
"effectiveLanguage": "fr",
"parsed": {
"name": "span",
"attributes": [
{
"name": "id",
"value": "language-0"
},
{
"name": "lang",
"value": "fr"
}
]
}
},
{
"id": "language-1",
"parentId": "language-0",
"text": "Bonjour",
"explicitLanguage": null,
"effectiveLanguage": "fr",
"parsed": {
"name": "span",
"attributes": [
{
"name": "id",
"value": "language-1"
}
]
}
}
],
"html": "<span id=\"language-0\" lang=\"fr\">Bonjour<span id=\"language-1\">Bonjour</span></span>",
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- Language tags are supplied identifiers, not language detection or a full BCP 47 validity assessment. Inheritance models the generated tree and does not predict pronunciation or assistive-technology behavior.
- A replay requires the same complete input and implementation. Randomized construction does not guarantee uniform coverage of every feasible output; finite samples can repeat unless a distinct-selection rule is explicitly stated.
- The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.
Alternative or Complementary methods
For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.
References
Similar or alternative tools
- Random HTML Attribute Quoting Corpus Generator
Compose bounded benign start-tag source with caller text, delegated five-character entity escaping, feasible double/single/unquoted/Boolean attribute forms, and duplicate attributes; retain the lexical parser's raw character references and first-duplicate rule, not DOM-decoded values, sanitization, or HTML conformance certification.
- Random HTML Boolean Attribute Fixture Generator
Construct supported Boolean-attribute spellings with lexical parser outputs, separate presence-based interpretation and author-spelling keys, including the nonconforming false-value control.