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.
Hey Kay I am happy we have you as reference and mentor in this journey learning programming and diving in such fundamentals in CS. What in couple of months was really challenging with discipline, effort, motivation and love for the things you like to do at the end we overcome any obstacle! Love for the 0de5
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!!!
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.
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.
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.
Wasn't aware about the "Clean" vs "Clay-Knee" controversy. Seemingly (or according to his son Ken Kleene), Stephen C. Kleene invented this peculiar pronunciation of his name all by his own. One remark about 'automata', though. It's a plural for 'automaton'. So it's 'several automata' but 'one automaton'.
This remember me a code wars challenge : "Regular Expression - Check if divisible by 0b111 (7)" where i had to convert a DFA into a regex. Spent hour trying on paper and never finished this kata
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.
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).
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
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 😊
I think I have an implementation that doesn't require shunting yard nor dfa/nfa. A simple pratt parser and binary (and unary) tree is all that is needed. :)
Thanks for making me feel like the grug brain. The whole time youre talking about regex and with the diagrams all im hearing is Category Theory. Wondering if this is turning into a haskell video. And then think its funny to equate recursion to a turing machine? Not lambada Calculus. Im going to have to watch a couple times to get my 🧠 to understand this all.
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.
this channel has by far become my favourite with regards to programming :)
tks youtube algorithm for recommending this amazing channel
5:40 what follows is one of the most brillant insights and explanations in computer science. You are most impressive.
This channel is truly one of the best of our time, deserving of recognition and appreciation.
Man I just dived into the rabbit whole of büchli automata a couple of days ago and then you drop this masterpiece. Thank you!!
Thanking you most kindly from English England
What gets you excited, Moor Moor?
Love your presentation and video editing style. Thanks for everything
We love you, Kay!
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 :)
Really enjoyed this one...
Please never stop making these!
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.
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
Less than 3 minutes in and this is already a banger, thanks for the hard work !
What a pleasant surprise! Thank you so much for these videos
Maybe the best channel on RUclips, amazing
Agreed!
Hey Kay I am happy we have you as reference and mentor in this journey learning programming and diving in such fundamentals in CS. What in couple of months was really challenging with discipline, effort, motivation and love for the things you like to do at the end we overcome any obstacle! Love for the 0de5
Content quality is amazing. You're spoiling us
Noam Chomsky, a linguist and still got influence in Computer Science world. Insane!
Thank you for making these. Such a rare gem.
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!!!
Wow, you are amazing! Thanks for making this video!
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.
Your videos are actually excellent! This has made me a big fan
Another banger, Queen! Thanks for putting this together so eloquently!
Cheers and thanks for sharing! Loving your videos!
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.
new video yay, your videos are amazing!!!
The videos are getting cleaner and cleaner
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.
Excellent video, thanks for the detailed explanation.
Takes me back to 2018, my first semester in computer science..
Great video! I wish they had taught automata like this at uni
Im listening
ok thanks for letting us know
😂
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.
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
Omg so thanks because that is what i need.
What a great video-thank you!!!❤
What a coincidence, i learnt FSM and state pattern. Thanks btw.
Oh my!!! This is so gooood! Thanks!!!
Wasn't aware about the "Clean" vs "Clay-Knee" controversy. Seemingly (or according to his son Ken Kleene), Stephen C. Kleene invented this peculiar pronunciation of his name all by his own. One remark about 'automata', though. It's a plural for 'automaton'. So it's 'several automata' but 'one automaton'.
As usual, great stuff. Klaynee always gets me too - waaaay back we only had books and had to make up pronunciation (Runge ouch).
Wish i would've had videos like these when i took my theoretical computer science class... Shit was brutal
Another banger. Love your way of going through shit! Already eagerly anticipating your next vid -whatever it may be about.
Heyyy, long time no see, thanks for the vid ✨
to quote people on other social networks: am I on RUclips Premium?
Absolutely amazing video
This remember me a code wars challenge : "Regular Expression - Check if divisible by 0b111 (7)" where i had to convert a DFA into a regex. Spent hour trying on paper and never finished this kata
amazing video.
Thanks for providing
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.
youre da best, kay!
Nice video!
I have some technical questions:
What do you use to make animations?
What video editor do you use?
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).
Interesting channel
Amazing video
It would be nice to have a video on the lexic analysiss a compiler does
Thank you so much
Half of my semester in 30 minutes 🙏
This would’ve been so helpful a semester ago 😭
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
great content, this has way less views than it deserves
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 😊
I think I have an implementation that doesn't require shunting yard nor dfa/nfa. A simple pratt parser and binary (and unary) tree is all that is needed. :)
Love your channel! Let me know if you are still looking for a copy of regular expressions and state graphs!
This makes me wanna do it myself in python 😅
@6:00 I felt nothing but the void within.
You’re so smart! Makes me feel dumb lol
taking theory of automata and computability soon so this is good
great video! i think you forgot a cut around 15:32
the code highlighting lacks a bit of contrast which makes it difficult to read.
Languages! Now we're cookin'!
I recently learned about LISP Scheme and I am noticing something that looks like Scheme expression 👀
Ur back wohooo
also how do I like twice
Hi, Kay!
Wow
Please, rearrange the ODE5 megalist in chronological order
Have now done - apologies, I thought that was a viewer-setting but I now realise it is mine!
holy graph
I think they are included in Python (I'm learning Python)
your 0DE5 playlist is backwards
I see regex I click 😊
Cellular automata
the regular expression for even number of a's should be (h*ah*ah*)* isn't it?
I pronounced it as «Clean» (Klenee)
What tool you used to make the slides?
Where is chapter 1?
automaton. it's automaton. "automata" is plural
Thanks for making me feel like the grug brain. The whole time youre talking about regex and with the diagrams all im hearing is Category Theory. Wondering if this is turning into a haskell video. And then think its funny to equate recursion to a turing machine? Not lambada Calculus. Im going to have to watch a couple times to get my 🧠 to understand this all.
Hiya hun! I love regular expressions, just wish I was intelligent enough to understand them 🍆
🏺🦵
What’s the link to the membership only site?
F lifting
/^ha+(ha+)*h$/
Then I saw the author’s answer and was blown by how I couldn’t see the obvious repetition of the “ha+” pattern. Neat
My brain is confused. I see one thing but hear another.
why are they called regular expressions.,..
is there irregular expressions? :D