Technical reference

Bounded-pattern vocabulary

makotoPattern is the profile dialect's deliberately bounded, linear-time string-pattern keyword. It avoids ambient host regular-expression semantics and catastrophic backtracking.

Why it exists

Organizational profiles often need string constraints for identifiers, regions, classifications, and transformed fields. A portable protocol needs the same accepted language and bounded evaluation behavior across implementations.

Supported model

The grammar supports literals, character classes and ranges, grouping, alternation, anchors, and bounded repetition. Patterns are Unicode scalar sequences interpreted with pinned Unicode 15.0 data. Unsupported or oversized syntax is a profile-resolution failure, not a host-regex fallback.

Examples

^[A-Z]{2}$
^[0-9a-f]{20}$
^(yes|no)$

Implementation status. parser/language tests and exact state-boundary tests exist locally. The remaining normative operation accounting and isolated worker resource enforcement are release blockers, so this page does not claim full conformance.

See the profile dialect and the complete specification.