Context-Free Grammars (CFGs): 5 Easy Examples

[@flamediamond8668]

Never thought I'd see a video on such a niche topic, thanks to his video I'm able to do my CS Theory assignments

[@julien8097]

if i ever manage to pass my computer theory class, it'll be thanks to you ! thanks for the video man !

[@senugege]

man i am litterally crying that i couldnt somehow find your channel and videos before, i had an exam last friday and luckily i passed it but... with the least amount of points to pass it, i didnt learn the lecture from any videos or so i only used the resources and lecture videos of the prof and script, as i found a video of you a couple days prior i watched it bc i had nothing to do after the exam month and the lecture seems right now pretty interesting and cool, i think its frankly unimaginable, i have always thought that this lecture is a phase i have to learn it and i will just forget it and dont ever find it interesting or important to even give a bit of time to, thank you for making me like the lecture and making me have a bit of interest, after all you are doing an amazing job with the whole lecture videos and the way you are explaining things are great!!!

[@CLG111]

I have a fighting chance now to pass my midterm because of these videos. Salute to you for making this series.

[@muneebhadul3269]

same bro

[@kin_1997]

very helpfull thank you very much, help in developing skills to think about CFG!

[@HNMCK]

These videos are so helpful! Thank you for taking the time to make them.

[@hansolo4626]

This guy is so goated, best explanations on youtube

[@davidtorres718]

This video was the best at helping me understand basic language theory! I have a test soon and I feel confident I'll do well.

[@vimalathithand917]

Just wonderful ,u r an awsome teacher ! Thanks a lott!!

[@rishabhjain7119]

You are a really good teacher :D

[@akshitjain2906]

legend

[@unexpectedfox]

Thanks for your explanation. It helps me a lot

[@hanaviyano2622]

Thank you very much for making these videos! You have helped me so soooo much!

[@elisabettapassmore781]

so clean and clear

[@Ayesha-uw4dt]

literally the best 10/10

[@n0ne0ne]

hi where are you from?

[@Ayesha-uw4dt]

@@n0ne0ne why do you want to know

[@n0ne0ne]

@@Ayesha-uw4dt I don't know brother I am just looking for some computer scientist friends

[@Bradelbirne]

thank you for this video!

[@30benasabu65]

Sir i think for 0*1*, the production rule must be S->0S | epsilon | P , P-> 1P, E. as a string of zero is possible and belongs to the language and cannot be produced by the rule you had written at 6:05

[@serdarkacka]

You are right; S->ε is necessary for the grammar to produce ε.

[@gloverelaxis]

Just so you know, the Latin/English character "e" is a totally different character to the Greek character "epsilon" (ε) even though they are historically linked and look visually similar. In math notation, it's essential to always use the correct letter case - two variables that use the same letter in both upper- and lower-case are considered separate variables. By writing "ε" as its upper-case equivalent, "Ε", you made that symbol look exactly like the upper-case Latin/English character "E". Because we have already established a convention whereby upper-case Latin characters are only used to name *variables*, and not special characters like the empty string, this "Ε" you used appears to denote a variable that you didn't define anywhere. Your comment confused me for a long while, especially since you wrote the full name "epsilon" earlier!

[@Kerreber]

You can still derive the empty string from S. S=> P => epsilon

[@colonelh.s.l.3834]

Nice video! For your example 2, would it be fine to say S--> 0S | 1S | E?

[@abhijatchauhan956]

In the last problem, for the scenario of having i > j, shouldn't the "a"s be first? The grammar given for that will have some "a"s after b, thereby putting them out of order. What about A_i>j -> aA_i>j | aX, then have X -> aXb | epsilon

[@RohanShrirame-m3z]

So nice vdeo❤

[@excorific7514]

For example 2, could we just do S->AC, A-> 0A | e, C-> 1C | e?

[@dakotahkurtz5011]

awesome. thank you

[@nahomaseged3324]

thanks teacher , but in the last example what if we add more condition which is i!=j or j !=k ?

[@umarbashir1236]

Thank you sir

[@jamescommon478]

For the last question. I think the languages which are: either i or j is equal to 0 are cannot be written by your grammar. Am I right?

[@fuadjaganjac9193]

no.

[@o3o814]

Спасибо братан

[@Phong_1302]

my love from HCM

[@tiananmentank-pj7sf]

shouldnt the first one be a regular?

[@n0ne0ne]

all regular languages are context free

[@bradleetulio4801]

you forgot to account for the case when a is zero or when b is zero as such the cfg can not produce a string like : bc or even ac , so your cfg can produce only in L{a^ib^jc^k i!=j, i and j >0}

[@fuadjaganjac9193]

you can generate "bc" with following the rules: S->A(ibBC->bεC->bC->bcC->bcε->bc and for "ac" is similar: S->A(i>j)C->aXC->aεC->aC->acC->acε->ac

[@RohanShrirame-m3z]

Can u have a mic plz

[@Agadr]

easy

[@Phong_1302]

dcu gioi vc

[@שניליטוב]

Thank you!