Комментарии:
Qué bueno que hay quienes instruyen aún con lenguaje C.
Ответитьhere because I'm building my first compiler for a new language I'm writing. went back and forth between this video, some test code I was writing in C++, and ChatGPT for supplemental learning. once I build out my TreeNode class more and get more comfortable working with trees, I'm hoping I'll be able to take the next step and actually start into the AST phase. right now all I have is a really rough lexer. wish me luck. thanks for the educational content.
ОтветитьVisited here after watching a reel on instagram which says best yt channel for C programming🤣🤣
ОтветитьI never knew that Yoda was Chuck Norris' nephew
ОтветитьLoved your daughter's cameo 😁
ОтветитьI've been searching for the perfect video for the past 2 hours, at last i landed on your video, i was literally on the verge of giving up. your a life saver. keep up the great work. thank you
Ответитьyes, please!!! I would definitely enjoy you going into compiler data and would love to see a video on it and other parts!!!
Ответить.
ОтветитьI've been interested in Trees for a while, but you got a Like for the Baron Harkonnen reference.
ОтветитьI hate my life
ОтветитьGreat teacher, thank you Jacob
ОтветитьWow no one else explained this better .. thanks a TON
ОтветитьYour videos are amazing!!! Definitely want content on compilers
ОтветитьYour daughter scared the hell out of me wtf
ОтветитьYour videos should be on netflix!
ОтветитьHi, for the create node function, why is “return result” AFTER the if statement, unless we want the function to return NULL in the case memory allocation is unsuccessful? However, wouldn’t we want to throw an error if memory allocation fails?
ОтветитьI was really hoping you would fix that asymmetrical "---<empty>--" at some point.
ОтветитьThis was a good short intro. I'll have to see if you've done one on non-recursive tree walking because that would be a good one to show any newbies. If you haven't already I hope you do at some point as you would make a really good video on it where most would not, and it would give me something to recommend for others.
ОтветитьJust discovered this channel just a few hours ago and already binged almost 20 videos! It's amazing how you can explain concepts so clearly and concisely that made topics I struggled on so much before look so simple and straightforward! Easily the best teaching channel I've ever found here
ОтветитьHi, do you have a video on recursion removal using a stack?
Ответитьquestion, why do you keep using printf when putchar & puts would both be faster & more appropriate for some things?
ОтветитьAwesome 👏
ОтветитьWow, Excellent and simple implementation ! Thanks .
ОтветитьThe best explanation I could find, thank you.
ОтветитьWhat a great channel!
ОтветитьThan you so much
Ответитьi think u change my future
ОтветитьOh, please! I want to see a implementation of ASTs and general compiler related topics!
ОтветитьASTs are used for a variety of tasks in compiler development -- such as SSA generation using Braun13, and CFG generation that helps with Data-Flow analysis. The AST itself is made from the parser, and then used to create Linear IR.
Ответить"The tree is upside-down" - we're computer scientists, not botanists.
Ответитьyou are cool, I really appreciate people who share knowledge and encourage learning ... In the future I intend to follow the same steps.
ОтветитьI like you t-shirts and the design of your , nice and minimalistic
ОтветитьPlease implement an AVL Tree in C, thanks.
ОтветитьReally tired of without further ado pado
Ответитьcan you make from Unix-like OS , c compiler to compile OS and all the software , hardware architecture
ОтветитьWhat color theme is this?
ОтветитьI'd love to watch a video about compilers! Your content is awesome by the way
ОтветитьSo without further ado, that was an excellent explanation! Looking forward to more DS videos!
Ответитьcan you make video a about graph. thanks
ОтветитьI have been c coding for years and still don't know it all...
ОтветитьPlease make building compiler in C series. Would love it so much.
ОтветитьI know this is supposed to be short and introductory, but I still missed seeing the implementation of binary trees on arrays through abstraction of indexes. Which is probably the actual general case.
Ответить