Explanation

What a typed-token alphabet makes expressible that a byte alphabet does not, and what lexing first costs.

The routes and the two engines behind one entry point, which patterns each takes, and what each costs.

Lexing and matching as two grains over the same bytes, run on two threads as a producer and a consumer.

Every public module, the execution surfaces a pattern is reachable through, and parity with the regex crate.