Hi, the two examples you shared for left most derivations, in the first example when you have replaced S with epsilon only, how is that a leftmost derivation when you've merely used a rule? The second makes sense that you've replaced the left most variable with a epsilon. Please help
for the second derivation you did for S -> SS | ε, why is this considered leftmost derivation because aren't we still replacing the S on the right? I thought leftmost derivation means you only replace leftmost variables, but once you have done that, are you allowed to replace another variable that is not the leftmost one? Edit: Is it because we cannot end on a variable so we need to replace the right one?
I might misunderstand your question and my answer may be off ( i am learning as well). But, with a leftmost derivation you start with variables to the left and replace them moving left->right until the string is in the set of terminals. You don't just replace the leftmost variable. If you only replaced the leftmost variable and there were other variables in the string, the derivation would be incomplete. Does this answer the question?
Man Seriously You Deserve Lot of appreciation for your work!
Thanks! Really got insights ,a great video !
This is awesome content. actually saved my life.
Thank you!! you are why I am passing computational theory
You're gonna shine one day proffesor!
Great video!! i clicked on this video because of the thumbnail btw.
Thanks for the video!
Thank you! that was really helpful !
thank you bro
Is the * in the E set of terminals just mean 'the permutation/combinations of all elements in the set E' or does it have a more nuanced definition?
great work bro
Hi, the two examples you shared for left most derivations, in the first example when you have replaced S with epsilon only, how is that a leftmost derivation when you've merely used a rule? The second makes sense that you've replaced the left most variable with a epsilon. Please help
Hey! Nice vid. Could you make a video explaining reductions in a deterministic CFG? I find it very hard to understand
What do you mean by reduction?
@@EasyTheory the bottom up derivation. In Sipser, a DCFG is defined by a series of reduction from a string of all terminal to the start variable.
@@itsmemouha2811 Didn't know about that! Got some reading to do 👀
thanks!
In Ambiguous, the derivation has to have the same answer?
yes, It must result in the same final string
for the second derivation you did for S -> SS | ε, why is this considered leftmost derivation because aren't we still replacing the S on the right? I thought leftmost derivation means you only replace leftmost variables, but once you have done that, are you allowed to replace another variable that is not the leftmost one?
Edit: Is it because we cannot end on a variable so we need to replace the right one?
I might misunderstand your question and my answer may be off ( i am learning as well). But, with a leftmost derivation you start with variables to the left and replace them moving left->right until the string is in the set of terminals. You don't just replace the leftmost variable. If you only replaced the leftmost variable and there were other variables in the string, the derivation would be incomplete. Does this answer the question?