Skip to content

Main content

Random Robots Rule Matching Exercise Generator

Construct caller-supplied robots rule exercises and delegate winning-rule answers without fetching websites or granting scraping permission.

Loading tool…

Description

Construct caller-supplied robots rule exercises and delegate winning-rule answers without fetching websites or granting scraping permission.

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 caller-supplied robots rule exercises and delegate winning-rule answers without fetching websites or granting scraping permission.

When to use this tool

Use this generator to create reproducible robots rule matching exercise 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

  1. Supply productToken, rules, paths, count in the field shapes below. Set seed when you need an explicit replay.
  2. 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.
  3. Read robots, exercises. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.

Serialize one supplied product-token group into robots text, sample paths, and delegate allow/disallow matching for each exercise, preserving matched-rule evidence.1

Delegated operations used for this result: robots allow checker. Their calculation or parsing conventions apply to the corresponding result fields.2

Input fieldMeaning and unitsAccepted input
productTokenProduct TokenRequired. Text; minimum UTF-16 length 1; maximum UTF-16 length 128.
rulesRulesRequired. Array of Object; no unknown keys.; minimum items 0; maximum items 16.
rules[].allowAllowRequired. Boolean.
rules[].pathPathRequired. Text; maximum UTF-16 length 65536.
pathsPathsRequired. Array of Text; maximum UTF-16 length 65536.; minimum items 1; maximum items 16.
countRequested count; the mechanics explain whether one draw expands into several returned records.Required. Safe integer; minimum 1; maximum 32.
seedOptional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed.Optional. Safe integer.
Output fieldInterpretationReturned shape
robotsRobotsRequired. Text; maximum UTF-16 length 65536.
exercisesExercisesRequired. Array of Object; no unknown keys.; minimum items 1; maximum items 32.
exercises[].pathPathRequired. Text; maximum UTF-16 length 65536.
exercises[].allowedAllowedRequired. Boolean.
exercises[].matchedRuleMatched RuleRequired. Text; maximum UTF-16 length 65536.
randomnessReplay 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.seedOptional numeric replay seed; normalization and precedence are explained below.Required. Safe integer. or Null.
randomness.sourceSourceRequired. 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.

json
{
  "input": {
    "productToken": "FixtureBot",
    "rules": [
      {
        "allow": false,
        "path": "/private"
      },
      {
        "allow": true,
        "path": "/private/public"
      }
    ],
    "paths": [
      "/private/x",
      "/private/public/x"
    ],
    "count": 1,
    "seed": 42
  },
  "output": {
    "robots": "User-agent: FixtureBot\nDisallow: /private\nAllow: /private/public\n",
    "exercises": [
      {
        "path": "/private/public/x",
        "allowed": true,
        "matchedRule": "Allow: /private/public"
      }
    ],
    "randomness": {
      "seed": 42,
      "source": "seed"
    }
  }
}

Limitations and assumptions

  • This exercises the linked checker's supported rule semantics. It makes no HTTP requests and does not confer authorization. Tokens and paths reject characters that would create unintended records or comments.
  • 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

  1. Tool behavior and example: Random Robots Rule Matching Exercise Generator — tool.io

  2. Calculation or validation: web/robots-allow-checker — tool.io

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.