Match text patterns using regular expressions with Regex Machina
Turing Terminal, 2077 A.D.
In Regex Machina, you’re an officer who must help inbound travelers reach their destinations. Your task is to process the travelers as either human or bot. To differentiate them, use regular expressions to match the human strings while avoiding the bot strings.
But be advised, some of the bots are nearly indistinguishable from humans! To process all of the travelers successfully, you’ll need to match complex text patterns using features of regular expressions such as character sets and ranges ([]), wildcards (.), quantifiers (*, +, ?), metacharacters (\d, \w, \s), anchors (^, $), and capture groups (()).
Thomas Park
Thomas is the designer of Flexbox Froggy and the founder of Codepip. Before Codepip, he worked as a computing education and human-computer interaction researcher at Drexel University's College of Computing and Informatics. He was also involved in educational software initiatives at the Mozilla Foundation and contributes to open source to this day.
