CFG to GNF Conversion (Removal of Left Recursion)

TOC: CFG to GNF Conversion (Removal of Left Recursion)
This lecture shows how to remove Left recursions in CFG to GNF conversion and how to obtain the completely converted GNF from the given CFG
Contribute: www.nesoacademy...
Website ► www.nesoacademy...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Pinterest ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
• Axol x Alex Skrindo - ...

[@imranshaik5325]

Me : This question is easy. Z : Let me introduce myself.

[@SumitKhobragade-uf2sn]

🤣

[@priyanshumishra334]

That Z is the fucking nightmare. 😭

[@tgtes2720]

I'm from Ethiopia and I just want to let you know that your videos are a great help! Thank you!

[@sandypspkt]

I'm from NEPAL 🇳🇵🇳🇵 and I just want to let you know that your videos are very helpfull ! Thank you! sir❣

[@imprakrut]

Who is watching this one day before the exams?

[@mohitmaithani4192]

Me

[@nikhilmadhusudhanan7371]

Guilty! Just over 12 hours left...

[@mohitmaithani4192]

@@nikhilmadhusudhanan7371 i did great buddy

[@msteven7145]

1 hour before exam B-)

[@pranaygupta5845]

Me and probably my whole class. XD

[@omdeep4137]

Your lectures are miracleous. It will definitely help to understand things better as well as to pass the exams

[@bhanupchennam1366]

Neso academy is the reason for passing my exams much impact compare to leaturea in college

[@apoorv_rajput5498]

Bro you get palced ??

[@ranitbarman6471]

Why does it seem like normal forms are increasing the complexity more rather than reducing it......

[@richaaggarwal07]

lol

[@chouaibbenali5201]

I had some hopes and then i saw that Z production in the end i'am like Nop..

[@ankithareddy81]

Same 😣

[@imranshaik5325]

Me : This question is easy. Z : Let me introduce myself.

[@apoorv_rajput5498]

Are you doing any job now ???

[@lipsachhotray1021]

thank you so much for your efforts to explain the topic so lucidly!

[@satyayadav4501]

Neso academy is only choice to learn all my subjects it is not only help to pass the exams ..it is also give a me best knowledge upon respected subjects....thank you so much 🙏

[@rajkumarjagatjitsingh3829]

thank you sir for the conclusion in such a short time.

[@chetanreddy6128]

This is the easiest way I've watched whole in the KZbin!

[@damianwysokinski3285]

Thanks man for the video. I can’t belive that I need to waste time learning this stuff during my master CS studies…

[@Umarfarooq-ee9nl]

Thanks sir. I had doubts on this topic, now it's ok. Tomorrow is my exam. This topic is confusing on the book. Thanks again

[@hotaru6765]

I know this was written 6 months ago but same here lol, mine is tomorrow too

[@amitthakur-ky9hq]

@Swargam Hazarika i know this was written 2 weeks ago but i have my exam tomorrow too. LMAO!!!

[@dhairyaanchal8623]

@@amitthakur-ky9hq i know this was written 2 days ago but i too have my exam 2moro, #lol

[@Mazino420]

@@dhairyaanchal8623 i know this was written 9 months ago but i have my exam tomorrow lmaaao🤣🤣

[@vinayak186f3]

@@Mazino420 I know last comment was written 1 yr ago but I too have my exam tomorrow . LoL

[@jayshrikhamk97]

I'm from India ...ur videos is very helpful me ..in that lockdown..corona situation s

[@asutoshpanda8807]

Thanks for the simplicity u use to make the concept clear😊

[@prindamuthukrishnan4134]

Good and awesome teaching easily understand by everyone 👏👏and very clear for me👍

[@RockStar-Siblings]

a big appaluse for ur hardwork dedication and simple,neat and clear explanation.thank u very much ..!!! ur every video really helped me a lot.

[@afraaalmoala3133]

Thanks alot >. regards from the heart of Africa from Sudan .

[@pradeepkumarsingh6964]

sir , u are amazing , thnx a lot for teaching TOC in such efficient manner

[@vinayaksharma-ys3ip]

Thanks you so much Sir.....really all your hard work is being reflected through your videos👍👍💯💯💯

[@farajkhalid7633]

Having a quiz tomorrow, Thank you Neso academy for helping me out !

[@drkaranmannan]

bhai same.

[@blitzkrieg7453]

how did you perform in the quiz?

[@farajkhalid7633]

@@blitzkrieg7453 hhhh I passed the course, graduated 3 years ago and now working 😂

[@blitzkrieg7453]

@@farajkhalid7633 wow that’s great!

[@jonaskoelker]

I had an insight about left recursion I would like to share: Let's say you have a left-recursive grammar T -> T + F | F and F -> 1. The partially expanded derivations / parse trees look like T, (T + F), ((T + F) + F), (...(T + F) + F) + F) ...), where the path from the 'T' root to the leftmost leaf is where the left recursion happens, or rather not to a leaf but to the point where T is replaced by some non-left-recursive production, i.e. the point were we use T -> F rather than T -> T + F. [Suggestion: draw or envision a diagram until this clicks for you.] Removing left recursion essentially means parsing that part of the tree in a bottom-up rather than top-down fashion. For example, let's rewrite my grammar to S -> F | FK and K -> + F | + F K and F -> 1 and let's derive 1 + 1 + 1. Note that S and K together replace T. So we go S -> FK -> 1K -> 1 + F K -> 1 + 1 K -> 1 + 1 + F -> 1 + 1 + 1. Whenever we add more factors (adding "+ F" ~ adding one more layer to the parse tree) we're always replacing the right-most non-terminal. But when we're expanding F, which is not part of the left recursion (except as an ultimate output as it were), we're replacing the left-most non-terminal. [Recall that left-most is top-down and right-most is bottom up: we see that the left-recursive part is handled bottom-up, but everything outside it can still be handled top-down]

[@amitch.in7]

Thank You. You saved my semester.

[@dard-e-dil3101]

It's really helpful ❣️thanks neso academy 🙏

[@shravyagowda1024]

Thank you so much sir!!! This was really helpful during exams🙏

[@muskankesharwani3151]

Ajeeb farzi cheej hai ...bhai kyun padhna hai ye sb just for clearing exam ....that doesn't make any sense ....Ughhh😐Well thanks Neso academy for your videos ..

[@mohduwais2603]

😂😅

[@adeshkumarsahoo6256]

Thank you very much Neso Academy .......very much greatful to you..

[@haythama8563]

Shouldn't we convert Z to A5 or something like that? in GNF we should have one Terminal followed by Non-Terminals lets say A in ascending order (or index) , but Z is not A?!

[@sek3254]

you saved me !!!!!!!!!!!!!! Thank you

[@Apoorvpandey]

This looks incredibly complex, but the steps make it simple!

[@arnodunstatter]

Can you do an explanation of how A4 -> b | b A3 A4 | A4 A4 A4 can be shown to be equivalent to A4 -> b | b A3 A4 | b Z | b A3 A4 Z where Z = A4 A4 Z | A4 A4?

[@marxman1010]

Can't find a decent explanation from the web, too.

[@scimitar_0096]

In the last Z-> b(A3)(A4)(A4)Z should be "b(A3)(A4)Z(A4)Z" By the way nice videos.

[@elyasaf755]

It is fine in the video and should remain the same

[@kisnagoyal9694]

for those who have confusion in z... we are skipping 1st A4 and writing remaining A4's then Z..

[@gauravbhandari1184]

Got it at very first time. Love from Nepal..

[@sambhavbhurtel]

csit boards? hahaha

[@debanjanghosal618]

If this comes in uni exam, this better be worth atleast 30 marks!

[@Rohit_Yadav008]

Sir dhuye Uda diye🥲🥲🥲

[@mahimaverma1572]

Plz upload vedios of pda n Turing machine ...

[@siddharththakur2411]

Thanks

[@revathireshma5198]

Thank you..sir I understood 👍👍

[@niteshdewangan7522]

Tis is life saving

[@neeraj8867]

all the best for all your sem exams we will meet in future

[@divyamsh2115]

My sir's explanation was pure shit..this video helped me a lot

[@vinayak186f3]

Solid 50 marks question 😶

[@dhruvsharma5786]

Dhanyawad Sirji❤❤❤❤❤

[@annc4196]

How about A3, shouldn't you replace it with a? as 3 is less than 4?

[@visakhakenguva9698]

Thanks a lot sir for your clear explanation

[@waklord1830]

its b A3 A4 rater than b A3 A4 z they must have missed something if ur confused just remove z from eq , Thank you

[@AmandeepSingh-qj5qg]

Watching 2 hrs before the exams 👍👍💪

[@Greg-mo8bd]

Wonderful teaching

[@zedx4749]

Watching this 30 minutes before the exam.

[@vineethreddymadadi7940]

Awesome, thanks a lot!

[@dhanarajs2707]

muthey.... nee life saveraaadaaa

[@divyarani5128]

Is this the actual way for solving left recursion? I think there is some other way for that. Then why are we solving it like this ..is it enough? I don't understand 🙁

[@inaminam9080]

Time 00.21 Am Exam study night

[@kunalkhoche5476]

Awesome tutorial sir

[@sandhya6312]

👌👌👌 explanation.grateful to uu.loved it

[@pranav7911]

No simple explanation on yt than this

[@shreyashchoudhary4576]

Really very helpful!

[@laisdeghaide9853]

Thank you sir, I would like to know how to convert this CFG to GNF, can you please help me? S -> A | S + A A -> B | AB B -> (S) | a | b | c

[@manjarinandimajumdar2642]

Thank you so much for this amazing explanation. Helped me loads.

[@NTHATHOLUMURALINAGABRAHMAM]

providing more examples will help us.but thank you

[@ayanmandal8257]

Sir, suppose if the production was A1-A4A4 then after creating z production what i write in new productiom A1?

[@everythingconsider]

Xouk

[@ravikumar376]

Sir too lenthy problem. Plz reduce small prob.But we are enjoy your teaching an

[@shannu7441]

I am watching on the day of examination

[@piyushchaudhari397]

Thank u so much nesco academy

[@manikanta-oh3qy]

sir plz upload control systems video lectures

[@event9123]

Complex but good ...

[@geethageethu1471]

But, A2 -> b becomes a useless production?, since we have replaced all the values of A2 with b

[@abhijithea3665]

can we remove A2->b ?

[@maheshvangala8472]

nice explaination

[@LosEspookys]

who is watching this 73 days before the exam?

[@vinayak186f3]

You

[@sanikaardekar69]

Thank you!

[@bisatisrilatha7957]

Tq so much continue 🙏🙏🙏

[@harshdasadgir3292]

Tysm sir very helpful

[@maphareleganza1741]

zabardast !! Hyderabad VJIT

[@rohitashwapratapsingh142]

THANKYOU SIR

[@AhamedKabeer-wn1jb]

Thanks Sir...

[@Ex-Coder]

Awesome.....sir

[@MhdAliAlashkar]

شكراً لك

[@Shivayadav-dn4qe]

thank u

[@siddharthsingh7378]

Z production is the final boss

[@arushirastogi3805]

LOVE

[@johnbabu4042]

Thankyou 💗💗

[@parthnakti4991]

I have a doubt, you completely merged Z with A4 but didn't did the same with A1 and partially merged it?

[@dhanushsivajaya1356]

Thankyou sir

[@anmolchourasiya3881]

THANKYOU

[@name.7077]

I guess it's better to leave this question than attend this. Lol

[@vednande6192]

I can see the end of the world in front of me after seeing this video

[@padmarajuchandanraju7130]

In the final answer A4 ; A3 is less than A4 ; but you haven't changed it.

[@pranaygupta5845]

Because now it is in GNF, i.e, the production has terminal followed by Non terminals

[@backslash8874]

You should only be concerned about the first variable in a relation (i.e. check ia or A->aBCD... .where 'a' is a terminal symbol and A,B,C,D,... are non-terminals)

[@GurpreetKaur-sk2yq]

My teacher explained from your video 😭

[@runtimeerrors5792]

thanks uncle

[@Shirin-bx9xj]

Don't we need to remove the A2->b production since it is useless at the end

[@Arham__Qasim]

Only god knows where TF i'll be using this in my entire life🙂

[@dard-e-dil3101]

Haa haa really bro

[@jayshrikhamk97]

Thanku

[@virtualgamerz7345]

This method is not working on other questions

[@marxman1010]

Removal of left recursion requires more explanation. Why Z -> A4A4Z | A4A4?

[@GDX17]

now how would you convert this to a simple grammar?

[@harpalsinhjadeja2568]

Z produces 2 a4 we get extra a4

[@ankitbhardwaj3658]

Z came like that toe crusher when you need just 2 off 1 ball

[@mahimdhungel6777]

if i

[@nikhilmahato5771]

Off course but that form is not allowed in gnf