I know so many people want me to continue lol. I will but I can’t say when. I’m a bad TH-camr xD. But if you want I can do some one on one help In discord if you want. Cheers
@@tylerlaceby Ive also got functions figured out I now just need to make the function calling part thanks to the videos earlier which helped me understand how things should work
Oh noo, this is the last episode (for now) :-( I've been following along but writing the code in Rust, and everything compiles and runs as expected so far! Amazing tutorial series, very easy to follow along, great explanations, keep it up! Can't wait for the next one!
this series has been fascinating, thank you - you deserve a whole lot more recognition for it! do you plan to continue the series, and maybe cover (e.g.) functions, loops, arrays, or even OOP? (also seems like your discord link expired)
Oh boy the discord link is also broken lmao. also thanks for the kind words. I really want to finish at least conditionals, functions and such. Arrays will function in our language identically as strings. You will be able to use the computer object access for indexing. But other than that a string and array will function very much the same way. I won’t cover OOP but if I cover functions they will support closures and I can demonstrate how you could return a object and it would therefore have the ability to contain closed over functions
Everything's working so far for my implementation, but I'm having trouble parsing function call chains without parenthesis. I want something like: "a.b.c().d().e.f" Instead of having to do: "((a.b.c()).d()).e.f"
Yep parsing member expressions is a tricky and very error prone task for this type of parser (Recursive Descent LL1). I w didn’t mention it but I would suggest writing a parser using a technique called Pratt parsing. I have discussed in great detail on my discord server the intricacies and solutions it solves if you are interested.
Didn’t forget them. It’s quiet trivial to implement those and I kinda stopped making videos. Conditionals, loops etc are all super easy to implement so I left it for everyone else to implement. If you want help with those I wouldn’t mind helping on my discord. Cheers
![[#2024MAMA] ROSÉ (로제), Bruno Mars - APT. | Mnet 241122 방송](http://i.ytimg.com/vi/dgGqD28J6aQ/mqdefault.jpg)
One of the best tutorial series ever seen!! Helpful for every CS students during their Compiler Design course!!
Could you continue the series please it's amazing and you've taught me a lot about how a language works behind the scenes.
I know so many people want me to continue lol.
I will but I can’t say when. I’m a bad TH-camr xD.
But if you want I can do some one on one help
In discord if you want.
Cheers
@@tylerlaceby thanks for the offer I might consider it if I have days off.
@@tylerlaceby Ive also got functions figured out I now just need to make the function calling part thanks to the videos earlier which helped me understand how things should work
Oh noo, this is the last episode (for now) :-(
I've been following along but writing the code in Rust, and everything compiles and runs as expected so far!
Amazing tutorial series, very easy to follow along, great explanations, keep it up!
Can't wait for the next one!
Haha well when fall break starts I plan on finishing it up with functions, loops, conditionals, and standard functions.
Amazing series. I was always curious of the process of creating a language and this is scratching that itch perfectly. Thank you for making this!
Great series. waiting for the continuation
Can you go over the runtime part of the method operations?
I want more !! This tutorial is so helpful !
this series has been fascinating, thank you - you deserve a whole lot more recognition for it! do you plan to continue the series, and maybe cover (e.g.) functions, loops, arrays, or even OOP?
(also seems like your discord link expired)
Oh boy the discord link is also broken lmao.
also thanks for the kind words. I really want to finish at least conditionals, functions and such.
Arrays will function in our language identically as strings. You will be able to use the computer object access for indexing. But other than that a string and array will function very much the same way.
I won’t cover OOP but if I cover functions they will support closures and I can demonstrate how you could return a object and it would therefore have the ability to contain closed over functions
@@tylerlaceby ah okay, very much looking forward to it! :D
@tyleraceby Please bring on the further episodes... can't wait to develop something which I always wanted
Next one out soon.
@@tylerlaceby tbh eagerly waiting for it
Its a great series where is the thanks button?
Hey amazing series! If you don't mind me asking, when will the series continue?
Hopefully soon xD
Awesome man! keep going bro! i've been following in python and it's been a lot of fun and learning :)
Could you help me add eval_member_expr in expressions.ts please? I can’t figure it out.
Everything's working so far for my implementation, but I'm having trouble parsing function call chains without parenthesis.
I want something like:
"a.b.c().d().e.f"
Instead of having to do:
"((a.b.c()).d()).e.f"
Yep parsing member expressions is a tricky and very error prone task for this type of parser (Recursive Descent LL1). I w didn’t mention it but I would suggest writing a parser using a technique called Pratt parsing.
I have discussed in great detail on my discord server the intricacies and solutions it solves if you are interested.
Me patiently waiting for the next part(s) °-°
what VSC theme do you use?
You Forget To Add The Evaluate Member Expressions Function In The Interpreter
heya, you forgot conditionals, and the if statement, I dont think its practical to have a language that cant even parse conditions.
Didn’t forget them. It’s quiet trivial to implement those and I kinda stopped making videos.
Conditionals, loops etc are all super easy to implement so I left it for everyone else to implement.
If you want help with those I wouldn’t mind helping on my discord. Cheers