Lec-48: Convert Context free language to Context free grammar with examples | TOC

preview_player
Показать описание

In this video we have discussed Convert Context free language to Context free grammar with examples i.e. Convert CFL to CFG.

►Theory of Computation (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Software Engineering:
►Artificial Intelligence:
►Computer Networks:
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Programming in C :
►Data Structure:
►Computer Architecture :
►Graph Theory (Complete Playlist):
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Рекомендации по теме
Комментарии
Автор

Lols we take admissions in the best universities and then a day before exam we are here to learn from you.. huge respect for Indian teachers on YouTube.
From 🇵🇰

iqrasaleem
Автор

I love the way you teach... Your content.. Examples gives a general idea of how actually the things work... All these shows your great efforts behind the scene... Hats off to you sir.

rashmidhawan
Автор

Loved the way you teach and help millions of people out there without discrimination. You provide extreme quality education free of cost at a very high level which many institutions can't even reach <3 Love from Pakistan, Karachi

ahmedansari
Автор

You explain everything in a really simple way thanks man for your hard work

omyrazeem
Автор

Brother.. U r great. U r my sir .. Today I'm gonna score 80-90% marks in my 5th sem exam... Till yesterday I didn't get anything in mind. . Once I saw ur video, only at once I understand everything.. Every credit goes to u my dear bro❤❤thx alot... I'm feeling it's waste of paying fees to clg.. Rather than it, I prefer ur videos.. Love u bro from Hyderabad 🤗❤

gamersden
Автор

S -> Abb ; A -> aAb | e
4:49 मुझे यह अधिक पसंद है (अभी के लिए)
8:50 हाँ, यही वाले तरीका लगाया मैंने भी उपरोक्त हेतु

yash
Автор

Write two CFG’s for the regular expression (a + b)*

attiqurrahman
Автор

Sir please start teaching java programming 😊

sakshikale
Автор

Sir mera paper hai 17 september ko conversion of CFG to CNF is per jaldi se lecture record ker dein plz

ammarijaz
Автор

In the last question if it was a^n b^m c^m d^n, n, m>=1 . How would we solve it?

shyamtayal
Автор

14:17 The paliandrome representation of CFG can be S → aSa | bSb | a | b | ϵ ?

anesp.a
Автор

How to design CFG for string starting with ab ?

haritapopat
Автор

Give a context free grammar for the following language:
L1= {0i1i+n+k0k: n, k≥0, i>0}

Homeage_style
Автор

can q6 be written as S -> aS | Sb | a | b | lambda

ARSAGAMING
Автор

Sir can you help me explain the conversation for L={0^n11}

MaitreyeDas-nrlo
Автор

sir please iska pushdown automata bna dijiye
{w ∈ {a, b}*
| #a (w) ≤ 2#b(w)}.

Amit-gdtk
Автор

sir Can u convert E -> E + T/T
T -> T * F/F
F -> ( E )/Id
To gnf gribach normal form

rayeesahmed
Автор

Hi sir l am here after 5th term result.
I got 90 marks out of 100 in TOC.
That's because of you.
Thank you for such a great effort.
Your Chanel is a great blessing for CS students.

salmaibrar
Автор

I Love You Sir! Huge fan of you! Respect from Hyderabad.

vijaypulugari
Автор

Sir, I have a doubt in question 5 that if m=1 & n=0 so it should be
S= a S b | a

jitenadvani