Jump to a problem, path or page
Jump to a problem, path or page
Streams, grammars and graphs
Streaming decoders, grammars, routers and graph algorithms with clear error contracts and bounded resources.
Parse quoted fields across chunk boundaries with explicit syntax and resource limits.
Tokenize and parse arithmetic with precedence, unary operators and bounded evaluation.
Parse a declared option schema with unambiguous values, terminators and structured errors.
Validate nested values with typed rules, bounded traversal and useful error paths.
Tokenize chunked JSON text with resumable lexical states and bounded token sizes.
Decode arbitrary byte chunks into Unicode scalars with exact error offsets and bounded state.
Match methods and path segments with deterministic precedence and safe decoding.
Produce deterministic minimal insertion/deletion scripts and apply them against a verified base.
Find shortest paths on immutable directed graphs with nonnegative integer weights.
Recompute affected formula cells through a validated dependency graph with explicit cycle and error semantics.