On the Subject of Regular Hexpressions
You can’t parse [X]HTML with regex. Regex is not a tool that can be used to correctly parse HTML. Every time you attempt to parse HTML with regular expressions,
the unholy child we̿̔̉eps the blood of virgins, and Russian hackers pwn your alarm clock. If you ₚₐrse HTML with regex you are giving in to Them and their bŀasphemous
ways which doom us all to inh
uman toil for the One whose Naᵯe ၚannot be expressed in the Basic Multilinɠuaɬ Plane, he c͒ͪo͛ͫmes.
A mere glimpse of the world of regex parsers for HTML will instantly transport a programmer’s consciousness into a
world of cease̶less screaminͫg, he comes
, the pestilent slithy regex-in
fection will đevour your HTML parᵴer, a𐓄Ᵽ꜕icatiȣn and eⓍiᶊtence Ꞙṑꝵ all tïmé.
Have you tried using regex to defuse a bomb instead?
- This module has eight Vertices representing the corners of a regular hexahedron, and six Face buttons corresponding to the sides of the hexahedron. Pressing a Face button will cycle the corresponding Vertices. Each Vertex is labeled with a symbol for your convenience; the labels play no role in solving the module.
- Each Vertex has an associated word, which is shown on the display when the Vertex is at the top of the hexahedron. Use the rules below and Table 1 to determine the four target regular expressions (target regexes), then find the Vertex words that match each target regex.
- To disarm the module, arrange the matching Vertex words in the center column of the module, so that the four words from top to bottom match the four target regexes in order, and then press the Submit button. That is, the topmost word must match the first target regex, the word below that must match the second target regex, the word below that must match the third target regex, and the bottommost word must match the fourth target regex. The arrangement of the two Vertex words on the left and the two on the right do not matter.
- Note that there may be multiple words matching a given target regex, but there is only one way to arrange the Vertex words so that each word in the center column matches the corresponding target regex.
 For a word to match a regex, the entire word must match. Page 3 explains the full mechanics of regex matching. If you are familiar with regexes, you should consider
every regex to have an implicit
^ at the beginning and an implicit
$ at the end.