Thanks to Micah Wood (Platinum), and Josh Hibschman, Timmy Gy, Patrik Keinonen, and Travis Schnider (Silver) for helping support this video. If you want to contribute, links are in the video description.
Oh interesting, this video clarifies that the entry symbol S is inherently from the producible strings. Otherwise is there some assumption that S can only be symbols that terminate within the rule set? Perhaps I'm running in circles, I'm not clear on what you may do if S was actually not () [or some combination of '(' and ')'], or is this impossible [example, S != (()]? Maybe I missed in an earlier video something along the lines of 'CFG is producing a string from the Language, from symbols recognized in this language'?
Similarly, when choosing S => SS, would back tracing be used to figure out the choice, or would you try to find recognizable 'bits' of information from the language 'word bank' to make the decision, like ( () ) () => ( S ) () => ( S ) S => SS => S, in a backwards kinda way?
Thanks to Micah Wood (Platinum), and Josh Hibschman, Timmy Gy, Patrik Keinonen, and Travis Schnider (Silver) for helping support this video. If you want to contribute, links are in the video description.
Man, I wish you were my professor. I didn't understand a single thing about parse trees until now.
Thanks a lot! 🙏🏽
excellent explanations!
Very well done video, helped me a lot, appreciate it
hello from BR. Great video! Easy to understand.
Please provide an example on how to show if a given grammar is ambigious or not
THANK YOU SM UR THE BEST
I really want to know why the tree grow down in the first place
Oh interesting, this video clarifies that the entry symbol S is inherently from the producible strings. Otherwise is there some assumption that S can only be symbols that terminate within the rule set? Perhaps I'm running in circles, I'm not clear on what you may do if S was actually not () [or some combination of '(' and ')'], or is this impossible [example, S != (()]? Maybe I missed in an earlier video something along the lines of 'CFG is producing a string from the Language, from symbols recognized in this language'?
Similarly, when choosing S => SS, would back tracing be used to figure out the choice, or would you try to find recognizable 'bits' of information from the language 'word bank' to make the decision, like ( () ) () => ( S ) () => ( S ) S => SS => S, in a backwards kinda way?
Helped alot. Thanks
보고있나... prince Song??
thanks
Thanks for the clear lesson!
Why did you start with SS variables first and not (S) for example?
how would u bring it outside the brackets if u did that