Equivalence of CFG and PDA (Part 1)

From where the general form came yr, actually i didn't get that how you write that general form?????? Please reply me, i need it and if anyone knows, can reply me, as I've exam tomorrow 🙏🙏🙏

What a waste of time. Why are you confusing showing some random cfg? Why are explaining a simple full example instead of this island

Still have doubts 😢

Martin Larry Perez David Martinez Charles

Robinson Ronald Thompson Larry Harris Jeffrey

Goodwin Branch

Rodriguez Sarah Wilson Nancy Clark Jennifer

will the result of left most derivation not be 2210 ?

Thats why i hate this channel waste channel

Don't panic to see the comments that some students can't understand it , actually this topic is little bit complex, so you have to see the video twice or thrice for proper understanding 👍

Sir the example we had was different and you solved the different one 😅

kuch samjh ni aya 🥺🥺

what if input symbol and the top element on stack does not match?

If I have more than one rule with the same start variable what rule should be applied ?

Thanks sir❤

amazing video but you just left the first example you did. You broke it down but did not convert it

Great video

Little bit confusing

Zindagi chune engineering nahi.

I m having a doubt, what if our production going like this
A --> Aa | Yb
When PDA find non terminal A on top of stack then it would always took Aa not Yb.
How we can solve it ?

Heyy

Got it 👍

Good explanation. Thank you

Bit confusing

I usually have no problems understanding your videos, but this one had me yawning all over. Jesus, I just want to graduate

Sir, where did we get A-->BCD rule from? It's not present in the grammer.

got it, now ill be able to construct PDA for any CFG
❤❤

So, So complicated. hard to understanding

generally find Neso Academy videos quite useful because of the provision of practical examples to back up the theory... but like others this video left me scratching my head, and no better able to convert CFGs to PDAs than before i watched. a shame, especially as the video was 22 minutes long!

How can you get Left most derivation sir i mean without using inPut string?

Hi, will this general form for all grammars we will try to find equivalent pda?

This video was confusing, hard to track what is going on when

All the different rules are different examples he has taken to show the working of the method, I got confused if they were relating to the grammar in the start of the video

this is worst , u have not explained the example

for the first time i was disappointed at the end of the video for this channel

I don't understand why epsilon, epsilon -> S, should it be "epsilon, S -> A"?

Why can't it be like:
--> S
--> A
--> 0A
--> 0 .

Only god knows where I will be applying this logic.

U didn't continue with the starting examplee

SO good

Sir a also gives oa A ->OA

one of the things i don't understand is that what if the production is of type B -> ACD | EF; which one to push , we need to apply recursion using stack . please further make a video explaiing how to perform recursion using stack.

Thankyou sir

First video with damm bad explanations.

crap explanation

Sir,please explain only by taking one grammar

the grammar and final PDA do not match