Regexp Puzzle

(ND|ET|IN)[^X]* [CHMNOR]*I[CHMNOR]* P+(..)\1.* (E|CR|MN)* ([^MC]|MM|CC)* [AM]*CM(RC)*R? .* .*H.*H.* (DI|NS|TH|OM)* .*PRR.*DDC.* F.*[AO].*[AO].* (HHX|[^HX])* (O|RHH|MM)* ([^EMC]|EM)* .* .*OXR.* C*MC(CCC|MM)* .*LR.*RL.* [^C]*[^R]*III.* .*SE.*UE.* (...?)\1* (S|MM|HHH)* ([^X]|XCC)* [^M]*M[^M]* (RR|HHH)*.? (RX|[^R])* N.*X.X.X.*E [CEIMU]*OH[AEMOR]* R*D*M* .*(.)C\1X\1.* .(C|HH)* [^C]*MMM[^C]* .*G.*V.*H.* [CR]* .*XEXM* .*DD.*CCM.* .*XHCR.*X.* .*(.)(.)(.)(.)\4\3\2\1.* .*(IN|SE|HI)

Instructions

Each regexp is a full match, anchored on both ends.

Cells can be edited directly.

If there is a value for every cell in a regexp's path, the regexp will turn green or red indicating if it matches or not, respectively.

A green match does not indicate that the cells' values are correct. Only if all regexps are green have you solved the puzzle.

Using the rotation arrows at the top, you can rotate the puzzle 120 degrees in order to view from a different angle. Current inputs will rotate as well.

Puzzle originally part of the 2013 MIT Mystery Puzzle Hunt, created by Dan Gulotta from an idea by Palmer Mubane.

More background at http://gregable.com/2015/12/regular-expression-crossword-puzzle.html

This version, modified by Ian McKellar uses HTML5 localStorage to store progress.