How would a machine choose between these 'or' | statements, I could see probabilistic models for language parsing, but for a more deterministic method would it use back tracing when certain decisions lead to non-terminal strings/or non acceptable strings?
The best videos on youtube for comp sci students
yeah this guy's awesome. I owe him a beer or two if I pass my exam in 2 weeks!
I love how you simplify things. Thank you, this is extremely helpful!
I have been watching videos and still do not grab the idea of grammar in computation.
Please how best could you explain that to me ?
Keep it up! This is really helpful.
Thanks, great explanation
Nice and easy explanation
Thank you. It was great.
Wonderful tutorial, thanks
Thank you ! Your videos help me a lot.
Thanks!
Thanks for the video!
thanks, soooo helpful
You're welcome!
This video is extremely helpful! Wow, thank you.
How would a machine choose between these 'or' | statements, I could see probabilistic models for language parsing, but for a more deterministic method would it use back tracing when certain decisions lead to non-terminal strings/or non acceptable strings?
Great work. Very helpful
thank you so much
thanks
perfect
kind of annoying for people who subscribed in video 1 to be reminded every 3 minutes in video 68