TOC Lec 23 - Introduction to Context free grammar, Derivation, Parse tree, Ambiguity

omg amazing explanation

She is god🙏

Thankyou maam

Thank you so muchh mam😘

Nice 👍

Awesome g

Thank you so much mam

S->SS+|SS*|a. Solve this question please mam

Simplest way I've ever seen someone explaining this. Thanks.

Thanks

thats was amazing

Hey really liked ur video !! Can u plz help me with this question? M stuck.
Consider the following grammar in which A, B, and S are nonterminal symbols, S is the starting symbol, a and b are terminal symbols.
S → A | SB
A → Aa | aa | Aab | aB | bb
B → aac | ac

a.) Show a rightmost derivation for aacab.
b.) Using the procedure to remove left recursion, transform the grammar into an equivalent non-left recursive grammar.
c.) Show a rightmost derivation for aacab, again, using the new rules created in step b.

Cool

In this video ,the concept is wrong in ambiguity portion. change that.

You have kept it minimal and simple. thank you

You are incredible! Thank you posting these lectures.

Thank you chechi

Thanks

Worst explanation ever.

thankyou maam ...ur awsome

construct a CFG for the language L = {a^ib^jc^i:i,j>0} over the alphabet {a,b,c}. Use leftmost ,rightmost derivation to generate strings "aabbbcc".

i'm from pakistan mam u are too good your teaching way amaizing

Good explanation. I have my exams and I didn't understand this CFG and all until I saw this video. Thank you. May God bless You. All the best for your future.

Please help me to speak in Tamil with this video

Where did you got the input

Nice and clear thankyou

Very clearly understood thankyou

what an english !

nyc bt fast

really fantastic sister .go ahed,best of luck.

good explanation