Simplification of CFG (Removal of Unit Productions)

preview_player
Показать описание
TOC: Simplification of CFG (Removal of Unit Productions)

This Lecture shows how to Simplify a given CFG by removing the Unit Productions.

Music:
Axol x Alex Skrindo - You [NCS Release]
Рекомендации по теме
Комментарии
Автор

Sir, never got explained like you. You have a beautiful way to explain the things

parvezkhan-tvze
Автор

Thank you so much for these lectures. It's really helpful as i have my exam in a week💗🙏🏻

apadogwaenchana
Автор

Sir your videos are providing ultimate nice teaching Techniques....I wish all the teachers can teach like You so much....With regards.

braintwisters
Автор

I am so overwhelmed. Never understood this concept before.

indianlad
Автор

Thank you very much sir these videos helped me a lot

mlowkya
Автор

Thank you so much your videos are easily explained and understandable for a correspondence student like me it was very helpful

poornimas
Автор

Yup Videos are great and you got good sense, really very calmly you explained the concepts.

santoshsahani
Автор

This course is followed step by step in colleges.

moonmoondash
Автор

sir thanku very much for ur great work when will u upload videos on PDA and there conversion from CFG nd to CFG

shashanksharma
Автор

sir your all videos for TOC are very supportive. but what abt remaining topics? please upload it sir like pda to cfg, cfg to pda, pumping lemma for CFL, Turing machine, and etc....we are waiting for your videos sir.. others videos not making any concepts clear very well. but your videos are get perfectly in mind at once directly. so please upload as early as possible....


thank you very

rohitpatil
Автор

Sir, Can you make video about elimination of left recursion with examples....it will help to us

pavankumar-cqcz
Автор

Sir, can you show an example about how to simplify the CFG like A->B, B->A. An real case must be more complex.

tongdayang
Автор

This is really simple. All we have to do is remove the non terminal on rhs and substitute by it's corresponding terminal symbol.

aditikhedkar
Автор

Please what if A-> B|a and B-> bbA|b.
Can x be a sentential form, or must it only be a terminal symbol🙏

ndktechh
Автор

what if S is in below production from X Y Z etc ?
does S also count as non terminals ?

kushalshakya
Автор

Sir non terminals are always in capital letters and terminals are in small letters?

smritikerketta
Автор

Does it work if A -> B and B ->abcd. Where {A, B} are non-terminal symbols and {a, b, c, d} are terminal symbols? (Aka if it does work for multiple terminal symbols)

iancuvlad
Автор

Help!!from the three rules:
1.Reduction of CFG
2.Removal of Unit production
3.Removal of null production
which rule should we apply first for simplification of grammar? or what is the sequence to apply this 3 rules? or they ask only one of them to apply at one time?

shaunakshetye
Автор

How to distinguish between terminal and non terminal symbols????

mohantysushree
Автор

Since Z -> a and X -> a can we also write as Y -> X | b instead of Y -> a | b ?

knese