I just wanted to express how lucky we are to have someone like you doing this! It's rare to find such good explanations of computer science and mathematical concepts these days.
This video encapsulates so well part of what I'm trying to make right now... I'm in awe! Can't wait for the next one! (context: I'm in the process of creating a lexer-parser duo, tailored for educational purposes. It'll take the user through a step-by-step visual journey of how lexing and parsing work, enabling educators to better explain the inner workings of a compiler... Still in very early stages, only parsing is implemented currently... Wish me luck :') )
Fun fact: Regular expressions were invented by Stephen Kleene. They were later popularized by Ken Thompson when he wrote the "ed" editor for Unix. Edit: I wrote this before I saw you had it in your video, once again you continue to impress.
Had me worried that you gave up on the project. Honestly I have to say over the past few weeks, this channel has become one of my favorites. I really hope you will keep on doing the great work!!!
This series is wonderful. It would be nice to have the playlist for it start with the intro and go down from there, would be much easier to watch that way.
These are the data structures we use for fast pattern matching on firewalls when scanning for malware and intrustions too, with some optimizations. At some point of growing the memory backing them got to hundreds of MB, scouts honor. We got yelled at.
I remember learning lex and yacc back in my compiler design course. I was so proud of barely scraping by on a pass, the only person who got a HD did it by failing three subjects and his girlfriend left him.
A lot and very good content in such a short clip. Just a nitpick: at 19:46 "any_char" creeps in instead of "single_char"... some tests work just because the string length are the same as for correct strings (and what should be incorrect strings).
I thoroughly hope you dig into the irregular expressions. :( they make me sad. They are nice features to have on occasion, but I think its beauty is someahat like C's beauty. By pushing some useful features out of scope we end up with a tool that is more obviously the right or wrong tool at a given time. C did this with the preprocessor, calling conventions, dynamic dependencies, and symantics for threading. They're all externally defined, and they're all hard problems that need to be solved. There's a lot in regex libraries that feels like its a cool tool, but it feels weird that its there.
Simply put, regex needs to be transformed into an NFA before that turns into a DFA that can simplified and transformed into a table driven automaton for those nice tight loops in code 😊
Happy deepawali light a candle lamps (100+)at main house , may the light remove all kind of darknes self doubt bad habits bad thoughts , your life lights up , happy deepawali Kay
I just wanted to express how lucky we are to have someone like you doing this!
It's rare to find such good explanations of computer science and mathematical concepts these days.
This took a whole semester to grok back in 2000.
Concise explanation.
Im listening
Thanking you most kindly from English England
this channel has by far become my favourite with regards to programming :)
tks youtube algorithm for recommending this amazing channel
I remember this in my first year university courses. We had to write code that would convert the NDFA to a DFA 😊 takes me back
This channel is truly one of the best of our time, deserving of recognition and appreciation.
Love your presentation and video editing style. Thanks for everything
This video encapsulates so well part of what I'm trying to make right now... I'm in awe!
Can't wait for the next one!
(context: I'm in the process of creating a lexer-parser duo, tailored for educational purposes. It'll take the user through a step-by-step visual journey of how lexing and parsing work, enabling educators to better explain the inner workings of a compiler... Still in very early stages, only parsing is implemented currently... Wish me luck :') )
Sounds amazing, good luck :)
We love you, Kay!
What a pleasant surprise! Thank you so much for these videos
5:40 what follows is one of the most brillant insights and explanations in computer science. You are most impressive.
Maybe the best channel on RUclips, amazing
Agreed!
Thank you for making these. Such a rare gem.
Less than 3 minutes in and this is already a banger, thanks for the hard work !
Fun fact: Regular expressions were invented by Stephen Kleene. They were later popularized by Ken Thompson when he wrote the "ed" editor for Unix.
Edit: I wrote this before I saw you had it in your video, once again you continue to impress.
Had me worried that you gave up on the project. Honestly I have to say over the past few weeks, this channel has become one of my favorites. I really hope you will keep on doing the great work!!!
new video yay, your videos are amazing!!!
This series is wonderful. It would be nice to have the playlist for it start with the intro and go down from there, would be much easier to watch that way.
These are the data structures we use for fast pattern matching on firewalls when scanning for malware and intrustions too, with some optimizations.
At some point of growing the memory backing them got to hundreds of MB, scouts honor. We got yelled at.
What a great video-thank you!!!❤
Another banger. Love your way of going through shit! Already eagerly anticipating your next vid -whatever it may be about.
Excellent video, thanks for the detailed explanation.
Omg so thanks because that is what i need.
Heyyy, long time no see, thanks for the vid ✨
Noam Chomsky, a linguist and still got influence in Computer Science world. Insane!
As usual, great stuff. Klaynee always gets me too - waaaay back we only had books and had to make up pronunciation (Runge ouch).
Oh my!!! This is so gooood! Thanks!!!
Hey, I'm studying finite automata in college right now!
I took compilers and automata theory last semester and it was hell 😭 that class took over my life for that whole semester
+1
Great video! I wish they had taught automata like this at uni
I remember learning lex and yacc back in my compiler design course. I was so proud of barely scraping by on a pass, the only person who got a HD did it by failing three subjects and his girlfriend left him.
The videos are getting cleaner and cleaner
amazing video.
What a coincidence, i learnt FSM and state pattern. Thanks btw.
Takes me back to 2018, my first semester in computer science..
Wish i would've had videos like these when i took my theoretical computer science class... Shit was brutal
Amazing video
Thanks for providing
A lot and very good content in such a short clip. Just a nitpick: at 19:46 "any_char" creeps in instead of "single_char"... some tests work just because the string length are the same as for correct strings (and what should be incorrect strings).
I thoroughly hope you dig into the irregular expressions. :( they make me sad. They are nice features to have on occasion, but I think its beauty is someahat like C's beauty. By pushing some useful features out of scope we end up with a tool that is more obviously the right or wrong tool at a given time. C did this with the preprocessor, calling conventions, dynamic dependencies, and symantics for threading. They're all externally defined, and they're all hard problems that need to be solved. There's a lot in regex libraries that feels like its a cool tool, but it feels weird that its there.
Thank you so much
Simply put, regex needs to be transformed into an NFA before that turns into a DFA that can simplified and transformed into a table driven automaton for those nice tight loops in code 😊
This would’ve been so helpful a semester ago 😭
great content, this has way less views than it deserves
It would be nice to have a video on the lexic analysiss a compiler does
This makes me wanna do it myself in python 😅
Totally pronounced RegEx, Reg as is in Reginald because it rolls off the tongue better! Or even ReJex. It’s got good mouth feel and ear feel.
Half of my semester in 30 minutes 🙏
Happy deepawali light a candle lamps (100+)at main house , may the light remove all kind of darknes self doubt bad habits bad thoughts , your life lights up , happy deepawali Kay
Hi, Kay!
Languages! Now we're cookin'!
@6:00 I felt nothing but the void within.
Love your channel! Let me know if you are still looking for a copy of regular expressions and state graphs!
Ur back wohooo
also how do I like twice
great video! i think you forgot a cut around 15:32
I recently learned about LISP Scheme and I am noticing something that looks like Scheme expression 👀
I think they are included in Python (I'm learning Python)
What tool you used to make the slides?
taking theory of automata and computability soon so this is good
I pronounced it as «Clean» (Klenee)
I see regex I click 😊
Where is chapter 1?
Hiya hun! I love regular expressions, just wish I was intelligent enough to understand them 🍆
What’s the link to the membership only site?
🏺🦵
why are they called regular expressions.,..
is there irregular expressions? :D