For the ones having a doubt on "B -> SB": the example considered is already in the CNF, so there is no need to follow the "STEPS" in order to convert it to the CNF (thereby not following the S' rule). Hope this helps!
In formal language theory, a context-free grammar, G, is said to be in Chomsky normal form (first described by Noam Chomsky)[1] if all of its production rules are of the form:[citation needed] A → BC, orA → a, orS → ε, where A, B, and C are nonterminal symbols, the letter a is a terminal symbol (a symbol that represents a constant value), S is the start symbol, and ε denotes the empty string. Also, neither B nor C may be the start symbol, and the third production rule can only appear if ε is in L(G), the language produced by the context-free grammar G.[2]:92-93,106 Source -wiki
I recommend you people watch the previous videos on removing unit, null productions along with CFG to CNF conversion. Because steps 1 & 2, which take up majority of the process, aren't being applied to this example(which is a simple one).
Those who have doubt of S on RHS thus no CNF. So, you check for this(ie: step 1 of converting cfg to cnf as per previous video) when given production is not CNF. That is we begin with the procedure if given production is not in CNF form. But here given production is already CNF. Thus we don't follow those steps and it doesn't matter if S is on right side because its already in CNF form.
The steps are clear to me, thanks for the video. But i have one doubt. If it is already in Chomsky Normal Form, doesn't that mean that unit and null productions are already removed? And if so, is it fine to just check if it's in Chomsky Normal Form directly? Please correct me if I made some error
You said that when i -> j , i < j not i >= j however when we see A4 -> b | b A3 A4 | A4 A4 A4 you say that the part b A3 A4 is in normal form however here i == j
it started with a non terminal symbol that's why it was accepted if it would have been A3bA4 then we would have to replace the A3 but since it started with b it was accepted
no, that breaks the definition of GNF which is 'one terminal followed by n non-terminals' it's already in GNF so I guess the i < j part can be ignored.
Sir urgent doubt hai........ Diff. Method sai different answer aa sakta hai na? Bs condition satisfy Krna chaiye... Sir vo dusra method jismai A1,A2,A3 assume krte usse different aaraha
S occurred on the right side in the given example so it is not in CNF but how did you proceed further without converting it to CNF (please help I have exam tomorrow )
MAny thanks for the good job. Please can you do a video on conversion of regular expression to context free grammar. Please help us as urgent as possible
bcoz of one small mistake u done in the whole que is gone wrong and my last 2h before the exam day gone to hell can u pls post another video in which u didn't do such type of silly mistake of S on the right side of CNF that u didn't recheck whether what u r teaching is right or not
MAny thanks for the good job. Please can you do a video on conversion of regular expression to context free grammar. Please help us as urgent as possible
only god knows where I'll be using this in my life...
to pass the exams.
truee
To design compiler and programming languages
To impress your gf
@@anjandey6089 😂😂😂😂 exactly
For the ones having a doubt on "B -> SB": the example considered is already in the CNF, so there is no need to follow the "STEPS" in order to convert it to the CNF (thereby not following the S' rule). Hope this helps!
Thanks!!
In formal language theory, a context-free grammar, G, is said to be in Chomsky normal form (first described by Noam Chomsky)[1] if all of its production rules are of the form:[citation needed]
A → BC, orA → a, orS → ε,
where A, B, and C are nonterminal symbols, the letter a is a terminal symbol (a symbol that represents a constant value), S is the start symbol, and ε denotes the empty string. Also, neither B nor C may be the start symbol, and the third production rule can only appear if ε is in L(G), the language produced by the context-free grammar G.[2]:92-93,106
Source -wiki
This subject is over for me nowwwww and i am not gonna see this shit again. I m so happy goodbye theory of computation 🗡 u were a bitch
I recommend you people watch the previous videos on removing unit, null productions along with CFG to CNF conversion. Because steps 1 & 2, which take up majority of the process, aren't being applied to this example(which is a simple one).
Oh my god, my teacher makes notes from your videos and teach us by that notes😂😂
Are you a LPU student as well? 😂😂😂
My teacher also like thiss
🤧that's so good
Mr. Anand Bihari , loook at this😂😂
Those who have doubt of S on RHS thus no CNF.
So, you check for this(ie: step 1 of converting cfg to cnf as per previous video) when given production is not CNF. That is we begin with the procedure if given production is not in CNF form. But here given production is already CNF. Thus we don't follow those steps and it doesn't matter if S is on right side because its already in CNF form.
Yes I agee with Aditya
Ohh, Thank you🌹
Thank you
your lessons are powerful!
Congratulations for 1.5 million subs 🥳🤩
M fan of the way you teach...thanks a lot..big thumbs up👍
nice video
B-->SB. Here it is not in Chomsky Normal Form since S is on the right side. Please explain!!?
Same question!
rachit chhabra no buddy S is right side still it is non terminal because it's a starring point....... Generally it's non terminal
Yes, we would have to add the production S' -> S. Small oversight.
u r asking a right question but d thing after removing unit production s'-s the s' will be extended with what s has now
exactly
Why didn't we convert S'-> S? Because according to be in Chomsky Normal Form when S is in left side so we take S'.
Yeah I agree. The expression was still not fully converted into a CNF.
Right not left bro
Here 5:00 you solve my doubt.. Thanks sir
In the CNF lecture you said that Start Symbol S must not be on Right hand side and inn this lecture S is in RHS than you also considered it as CNF
Yes it's right can can you explain me why did this happen in this example.please response me if you know
@@nikhilsharma8350 If you see in previous example it was A->S and in this it is B->SB. Hence alone if S is found then we have to change.
I think there is a mistake as discussed in CNF S->ASB and A->S due to which we took a new production here too there is a state B->SB
The steps are clear to me, thanks for the video. But i have one doubt. If it is already in Chomsky Normal Form, doesn't that mean that unit and null productions are already removed? And if so, is it fine to just check if it's in Chomsky Normal Form directly?
Please correct me if I made some error
Why should do Step 1,when we know that in CNF these Step Have to do.We should do directly step 2.
Aren't we going to add S'-> S???
But, At 3:54 according to CNF the starting symbol shouldn't be on RHS of any production rule...😢
You said that when i -> j , i < j not i >= j
however when we see A4 -> b | b A3 A4 | A4 A4 A4
you say that the part b A3 A4 is in normal form however here i == j
it started with a non terminal symbol that's why it was accepted
if it would have been A3bA4 then we would have to replace the A3
but since it started with b it was accepted
@@kriskhandelwal6967 thanks bouiiiiii
@@kriskhandelwal6967 thanks
Excuse me sir! 3:50
here there S on right side of production. And how it is already in CNF??
A4-->b A3 A4? is this possible?
same doubt
Thanks. Nicely explained.
Since we are already removing Unit Productions and Null Productions in CNF, Why do we need step 1 here?
The step which he said in the first, is for the conversion from CFG to GNF and not CNF to GNF.
@@vaishnaviv2169 If its already a CNF there will be no Null productions and Unit productions.
@@HighbrowDirector yeah... So, did he remove some unit or null values bymistake?
Or is there any mistake in that video?
@@vaishnaviv2169 Actually no mistake 1 step was redundant
not in CNF form as S is in the right hand side
Nice video sir... completely able to understand the concept...☺️☺️
If i have a production of the form: A1 -> b A4 A3 A2 (A1, A2, A3, A4 are Non-terminals and b is a terminal), will this production be in GNF?
Thank You So much sir👍👍👍
it will be really helpful if you provide the image of the things you tought over here
screen shot lele na pagal
good teaching
Thank you, Sir.😊😇
it can be done in a simpler way also
How?????
Excellent Sir.. Thank you so much ...
Great lecture . Impressed with it !!
I think you forgot to change 'A3' to 'a'.
no, that breaks the definition of GNF which is 'one terminal followed by n non-terminals'
it's already in GNF so I guess the i < j part can be ignored.
Thank you sir👍
Sir urgent doubt hai........
Diff. Method sai different answer aa sakta hai na?
Bs condition satisfy Krna chaiye...
Sir vo dusra method jismai A1,A2,A3 assume krte usse different aaraha
Is there any Solution Manual for Automata By cohen and denial ?
S occurred on the right side in the given example so it is not in CNF but how did you proceed further without converting it to CNF (please help I have exam tomorrow )
Doesn't BB in S makes it not in CNF because BB is repeated
In step 4 what if it had....(A4->A4|A3)?
thanks
Amazing videos
Thank you❤🙏
sir*
Why did we write A4 twice?
please upload videos on pda and turing machine .i have my exam on 20 june
thx man ! nice explaind !
Sir*
Respect to your teacher please*
tomorrow is TOC exam,,, Wish me luck guys😥
Videos were sufficient?
@@omop5922 yes, more than sufficient
Thank you ..
sir*
Thankyou sir
Good work sir keep going
I think this helps :
In the given grammar, 𝑆 S does not appear on the RHS directly (e.g., 𝑆 →…S…)
MAny thanks for the good job. Please can you do a video on conversion of
regular expression to context free grammar. Please help us as urgent as possible
Here we go generational pain.
still have many doubts
I was searching for GNF - Polo G
Sir i have my examss from 6th of july . It would be very helpful if you put now.
wowww
wrong!! As B->SB has S on right side. it is not in CNF!! Please do convert it
Sir i need to learn whole turning machine . How much to pay you to get it?
This example is wrongly solve d
3:04
replace the valoo
I beleive that this subject is the most useless subject in the world
Without this we won't be able to write code. It's just that we don't know why we are studying all these, makes us cuss the sub. I can feel u broo
Sir you are great but your voice is not perfect
its not gridback, its gribah (i pronounced like "i")
:))))))))
it's not gribah eather ! the therm "ch" has its own prononciation !
Dukh dard peeda kasta
ab exam ho gaya ab kya dal rahe hoo. 😨😨ye questions exam me v aya tha
it should be A4--> b | A2 A3 A4 | A4 A4 not A4--> b | A2 A3 A4 | A4 A4 A4
Wrong solution
What's the wrong solution?
May I know??
A of 1 😂😂😂
Could you go any slower😒
Sorry to interrupt but he is already slow,
Or watch at *.75 speed 😂
Manish Sharma Fitness I was being sarcastic dude
@@ManishSharma-lm3wg Can you be any dumber, oof!
Dude I saw this lecture in 3x then it was at a formidable speed 😅
bcoz of one small mistake u done in the whole que is gone wrong and my last 2h before the exam day gone to hell
can u pls post another video in which u didn't do such type of silly mistake of S on the right side of CNF that u didn't recheck whether what u r teaching is right or not
thank you
MAny thanks for the good job. Please can you do a video on conversion of
regular expression to context free grammar. Please help us as urgent as possible