Message from JavaScript discussions

August 2017

— Thanks

— 

This is, again, for /hello/ except showing the code points:

-->(s1)-72->(s2)-69->(s3)-76->(s4)-76->(s5)-79->((s6))


and here's what <w{5}> looks like:
-->(s1)-0,65535->(s2)-0,65535->(s3)-0,65535->(s4)-0,65535->(s5)-0,65535->((s6))

— Not yet but I might

— For now I just made a simple DFA which can function just like a regex

— 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

Message permanent page

— 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!