Applying left factoring to convert the grammar into Deterministic grammar

In this video, it is shown that how a non-deterministic grammar is converted into deterministic grammar by applying left factoring.
link to my channel-
/ lalitkva. .
link to data structure and algorithm playlist -
www.youtube.co....
link to information theory and coding techniques playlist -
www.youtube.co....
link to compiler design playlist -
• Parsing

[@nishantsahu3609]

These videos are of great help. All my doubts were cleared.

[@dynamictechnology4912]

Nice explanation, after watching it my all doubts are clear, thank you sir

[@deepikasharma1501]

Great video... All my doubts are clear now... Thank you sir...

[@deepikasharma1501]

Please upload some more great videos like this on the topics in the second half of the syllabus... Thank you sir...

[@tuneerbhattacharya6056]

for the fourth question-
s->as1
s1->as2|ccd|ddc
s2->d|bd
is this correct sir?

[@LalitVashishtha]

You will get it after substitution.
You don't need to do it until you are asked to do so.
That is also correct.

[@rhythmsahu1356]

in part 3 why u have only taken a common when ab could be taken common

[@ohhmypenniereview8505]

great series

[@letslearnmath1172]

Just amazing!!

[@imranshaik5325]

thank u very much

[@malikismail9947]

Thanku sir