Interactive playground for the PetitParser-based regular expression engine. Write patterns, inspect the AST, trace NFA state transitions, and test matching strings in real time.
Structural representation of the parsed regular expression:
The Non-deterministic Finite Automaton state graph transitions:
| State | Transitions |
|---|