How Do Regular Expressions Really Work?

[@wlockuz4467]

Wow this is mind blowing! I have read a lot of theory about Regex but I have never seen a practical example so well done! You earned a sub!

[@LowByteProductions]

Thanks WloCkuz - much appreciated!

[@fabiodan30]

Thanks for spreading the good word on parsers and virtual machines. It's important work, what you're doing here, and more people should do it. Liked and subscribed!

[@kylefong2888]

YOU'RE ABSOLUTELY SICK!!! I geek out about stuff like this, this is so cool. Thank you for taking the time to share your knowledge!

[@huizhang7413]

Holy shit, I spent 2 weeks learning the principles of compilers. I learned tons of terminology, regular expressions, NFA, DFA, and how to convert one into another. But when it came to writing a regular expression engine, I still didn't know where to start. But this video taught me in just 20 minutes!!! A big thank you to you.👍

[@imsherry7225]

You Are A Great Person ❤️✌️

[@LowByteProductions]

Thanks Sherry ☺️

[@imsherry7225]

@@LowByteProductions My Pleasure

[@ben.faerber]

Wow, I'm so happy to have found a channel like this about my favorite language! I'm writing an APL clone in Javascript and will have to use your videos for research!

[@LowByteProductions]

Thanks Ben - hope they come in handy!

[@LachlanMiller]

This was really good, thanks.

[@AmanGupta_Dev]

After watching your videos, I am pretty much confident that all those curious questions / doubts I had, will be solved ! once and for all !

[@LowByteProductions]

I certainly hope so!

[@ShaunakDe]

Thanks for doing this. It was very instructive to watch.

[@poof65]

Very interesting, even if I don't have seen it at the best moment. End of day on my couch, I was starting to fall asleep at the end of the video 😅

[@LowByteProductions]

I commend your effort given the circumstances 😁

[@yapdog]

Wildcard (.) matches everything but newline ( ). At least in most engines. Great video, very timely for me 😁👍

[@ratchet1freak]

a better way than backtracking is to instead have an array of current states and go character per character. Then when a choice is to be made on a state you duplicate that state and simulate both choices. This lets you avoid the most common pitfall of regex implementations If a state fails to match the character you drop it from the state array. The regex matches when you get to the end of the string with a state that is at the end of the regex.

[@dentjoener]

For repetition (including all of the variants) I usually use a generic repeat pattern with min and max, and for unbounded versions I set max to some incredibly high value. (MAX_SAFE_INTEGER or something). This allows me to do the following tranformations: ? -> repeat(0,1), * -> repeat(0,MAX), + -> repeat(1,MAX),... etc

[@gimmemoreborisbrejcha9794]

I believe implementing such an engine can be easier with usage of some nfa implementation, and being able to combine them. I actually implemented one that contains very advanced features of modern engines, like captures and such.

[@sshh6285]

subscribed, awesome, unique content

[@BryanChance]

I learned about regex when I was trying to learn Perl. Oh yes, the syntax is absolutely mind boggling to me at the time. (I'm talking about Perl's syntax) Just kidding but it's close. LOL After about 8 months, it finally clicked; the regex syntax made sense. Anyhow, Perl and regex are perfect together. I think learning Perl and regular expression broke my brain. LOL Then I found out about sed, awk, and all the other text utilities commands like cut, sort, uniq, tr, etc.. I couldn't imagine the complexity of writing a regex engine. But I 'll find out watching video!. Thank you for sharing your work.

[@LowByteProductions]

I learned perl a long time ago - probably before I had any real idea what I was doing 😁 I look back very fondly on it, and remember it being amazing for regex and text processing in general.

[@AnonymousAccount514]

Mind Blown

[@JSRFFD2]

This was a very good video, thank you! I wonder if backtracking could be handled more elegantly with recursion. I also wonder if backtracking or recursion would be better suited to handle something like a|b

[@LowByteProductions]

For your first point, yes I think you could use recursion, although a bit of alteration would be needed. In that case, you're using the call stack itself as the data structure that keeps track your state. The call stack is however a limited size (varies from environment to environment), and JS unfortunately doesn't have tail calls. For your second point, alternations need a bit of extra modelling (in parsing), but are essentially just a new kind of element type. So in the stateMatchesStringAtIndex function you could add a new case that iterates through the possibilities, trying each one until it finds one that works.

[@anonymoussloth6687]

Can u tell me where i can learn to create a more complicated one? I have studied finite automata and compiler design so I am not new to regex and dfa, but I want to learn how to implement onw from scratch

[@JayDee-b5u]

Why are you using arrays of arrays?

[@mluevanos]

Thanks for bringing the advanced JavaScript topics to YT.

[@eugenegordo3130]

Thanks for the video! Tell me please which font you using in the editor?

[@LowByteProductions]

I believe it's inconsolata

[@eugenegordo3130]

Thanks!

[@MrLiquitorleaveit]

I´m feeling like I´m a bazillion hours away from producing code like this. Watched the whole video though, kind of fascinating how it all adds up in the end.

[@LowByteProductions]

Hey - you'll surprise yourself with how much less than a bazillion hours it can be if you focus on the right stuff. Anytime your reading/watching/trying to understand something that makes you a bit uncomfortable because it's not immediately clear - that's actually a great sign! Follow it up with a trip to Wikipedia or a Google search. Keep exposing yourself to tough stuff. Very quickly concepts will fall into place, and you'll be able to look into even tougher stuff. Honestly it's one of the things I wish I had been more conscious about earlier in my career.

[@laujimmy9282]

​@@LowByteProductions this comment is really helpful for many of us ❤ thx

[@maxdemian6312]

I always read regex as reghex

[@panjak323]

Regex is much easier once you learn DFA and NFA and regular grammars. Then it's just syntactic sugar, and can be implemented as such.

[@calvinlucian387]

Nope. Still can't work with regex. 😪 Great tutorial tho ❤

[@LowByteProductions]

Give super-expressive a try (github.com/francisrstokes/super-expressive). Might help you better wrap your mind around the idea!

[@poof65]

Regex is love, Regex is life 😍

[@calvinlucian387]

@@LowByteProductions Thanks! That's a gem of library! ✌

[@fylink]

Your algorithm misses nested qunatificators. For example, imagine the expression /([A-Z].*){3}#/ matched against the string 'AxsaBsaxsaCsaxas#'. Your algorithm will fail and it would need drammatic modifications to cope with that.

[@koenderbb5191]

Zeg eens eerlijk, ben je Nederlands?

[@LowByteProductions]

Nee helaas kom ik uit Engeland. Maar mijn dochter is wel Nederlands.