What's this?
This tool shows you the deterministic and nondeterministic automata that some regular expression engines would use to parse your
expression. Besides the educational use, it's nifty for debugging your expressions - just follow the little arrows and see where
they go wrong.
Legend
Learn more
Read more about how this works at my blog
binarysculpting.com.
The graph generation is powered by Piglet,
the fluent parser generator. Follow me on twitter @Perdervall.
Share
Want to share your graphs? Press enter in the regular expression box and copy the URL of the page to get a direct link to your graph.