Message from JavaScript discussions

August 2017

— Parsing the regex to the DFA is another story... haha


Deterministic finite automata are a form of tree automation, it's how CPU's work on a low level and also parsers

— A parser will use DFA/NFA to parse code one symbol at a time

— For my use case you can tell if two totally different regex can derive the same strings

— So like diffRegex(myRegex1, myRegex2); // true would be the desired result

— Even if the regex source strings are TOTALLY different

— myRegex1.source === myRegex2.source only tells you if the strings are equivalent, not what they can understand

Message permanent page

— Right!

— Without any input or test data

— You would need infinite test data

— Hmm, I don't think it's precise

— Or 65535*65535 fuzz strings, if not more