Theory of Computation: CFG Introduction (Derivation, Parse Tree, Ambiguity)

[@sonytvization]

Teaching is an art form. you ma'am do it the best. I love how you repeat certain important stuff which makes it stick a lot better. thank you

[@sanas.193]

The best... Thank you for helping me right before exam... Thank you so much.. you are a Gem

[@Shantanu_lrnr]

Why are there no teachers like you in our college mam???

[@satheeshans9512]

It's a good explanation I had ever seen

[@batuhanb1544]

Sen Allah'ın bir lütfusun! Her zaman arkandayız YÜCE KADIN!

[@Viscos2000]

Very nice mam ❤️❤️

[@vivekjaiswal4391]

Very nice

[@AffectionateBuffalo-nc3lx]

❤❤❤❤❤

[@pogocoin2335]

thankyou so much

[@shinyjohnson546]

Thank you so much 😘

[@gudisa-1]

well done

[@Ged1356]

Why did you not do e*e

[@mrsurya3251]

Thanks a lot mam

[@suryarajkasthurihotel5156]

Super mam

[@littlemermaid5921]

thanx mam

[@rohanhegde108]

Thank you

[@Abbasinfo]

Mam muja is Question ka Answer chahiya please ap de den write production and {S,N,P,T} of grammar for language L={9-5+2,3-1,...} also draw the parse tree and write left most and rightmost derivation of grammar

[@thevagabond85yt]

Sorry but grammar is not ambiguous. Language produced by grammar is ambiguous. W does not belong to T* but w belongs to L(G)

[@roshanr8020]

Mam I have an doubt.... The CFG can be construct anyway we can.. or the solution u derived are the only way.....

[@VanishreeGunalan]

you have done left derivation on right side 🙄🙄🙄🙄🙄

[@techkunbyamogh]

should have done e*e first

[@SuridSarker]

Thanks mam