Context-Free Grammars (CFGs): 5 Intermediate Examples

[@nekytasnim456]

Clear and concise explanation. You deserve more subscribers. Thank you so much!

[@abhinav9936]

@EasyTheory I should be really thankful to you as you helped me ace the Theory of Computer Science exam.. your lesson videos helped me a lot

[@dd1.d]

thank you so much. Your videos are helping me a lot

[@mrboss3952]

Great video, really informative. Any video you might suggest about DFAs and NFAs, on drawing them with examples?

[@EasyTheory]

Edit: I have several examples that are really old on the channel about creating DFAs and NFAs - may want to check the "intro theory" playlist.

[@bloodthirstybutcher8365]

dude my test was last friday if you had posted it earlier 😭😭😭

[@EasyTheory]

Should have reminded me ;)

[@rollbacked]

I have a question, what if the case were that n >= 1? Is it still context free?

[@sc5shout]

If in the last example instead of i

[@gauravghosh6562]

no it won't , then you would have to remember the S->Sc and X->Xb productions rest all will be same

[@robwindey9223]

Could it be that example 3 is still missing X -> X1|X0 to be able to generate all possible strings with this X rule?

[@pateldhyey3063]

In the first example s can also be lambda/epsilon

[@saumickpradhan2767]

S -> X where X is Lambda is taking care of that my friend

[@melihathevlogger3737]

thank you

[@vimalathithand917]

Thanks !

[@rocksbox156]

How did you know that L = {0^n1^n2^n} wasn't a context free language?

[@akshitjain2906]

legend

[@juicewar]

Hello, can someone let me know if my CFG for generating non palindromes is correct, thank you!
S -> 1A0 | 0A1
A -> ε | A0 | A1

[@rahuljaswal9270]

GOD

[@Sheriff_Schlong]

PLease come to my college and show my professor how t ofreaking teach bruhhhh :'}
Great video

[@CLG111]

In that last example the explanation could have been better. It was confusing.

[@surferriness]

Imagine:
everytime you produce b, you produce ( a | epsilon )
everytime you produce c, you produce ( a | epsilon )
so for any word in this language, counting occurences by stacking the yielded terminals:
'( a | epsilon )' and 'c'
'( a | epsilon )' and 'c'
.
.
.
'( a | epsilon )' and 'c'
'( a | epsilon )' and 'b'
'( a | epsilon )' and 'b'
.
.
.
'( a | epsilon )' and 'b'
+
______________________
=> total number of 'a'