Types, Prefix, Assignment & Grouping Expressions | Writing a Custom Language Parser in Golang

preview_player
Показать описание
This video covers a lot of material on parsing types, grouping, variable re-assignment and prefix operators. Then we finish off by writing the variable declaration stmt parser which incorporates types.

⭐⭐ GitHub Repo ⭐⭐

🔔 JOIN THE COMMUNITY 🔔
----------------------------------------

-- Social Links --
Рекомендации по теме
Комментарии
Автор

Thank you for this awesome series! We would definitely want videos about error handling and error tolerant parser.

kirillhorn
Автор

This series is amazing, please keep them coming! Thanks a lot for creating this since pretty much all other content has people creating simple interpreters without building ASTs or not even mentioning Pratt parsing.

And we of course would like error handling, especially to see an example of soft vs. hard errors and how the lexer/parser could continue processing after soft errors.

ygunayer
Автор

This is awesome!

Also video 5 isn't in the playlist yet and I just found it and now I'm excited 🎉

StregasGate
Автор

Yay! Next video is up. I've been looking forward to this. :)

DoubleDotStudio
Автор

this series is amazing!! :D i have learnt so much already! and yes i would love to see videos about error handling :)

servingcurnt
Автор

Hi, thanks for the series really like it! I am trying to follow it but using Haskell.

Not criticism at all, I found some things that may be my mistakes or real bugs, so hoping it helps:

1) The parse prefix, which @evertonelvio already mentioned it in a comment, so nothing to say.
2) I think when parsing chains of binary expr that go frome more to less or equal it breaks or doesn't give the right tree. Not sure cause I fixed it in mine.. I think the first problem was that if it went from more to less then it just stopped parsing the Expr but didn't reach the SEMICOLON yet so error, and after I fixed that the problem was that if I did "2 * 5 + 3" it would give back a tree with the * as the Root and the + in a branch, which means it will do the addition before the multiplication (and I suppose it is not what is intended..).

But anyways, thanks for the series and excited to continue following and doing my small project along the way!

smallcat
Автор

Hi!
On the parse_prefix_expr, instead of calling parse_expr, should call only a parse NUD expr... because '-2 * 3' should be parsed a '-2' * '3' and not '-' '2*3'...

evertonelvio
Автор

led is runtime Expr but nun is compile time Expr?

VladSaratovskyi
Автор

what happened to this series? abandoned again?

_slier
welcome to shbcf.ru