Lecture 21/65: Equivalence of CFGs and PDAs (part 1)

  Рет қаралды 36,769

hhp3

hhp3

Күн бұрын

Пікірлер: 24
@cranberry_sam
@cranberry_sam 6 жыл бұрын
My test is at 4 today, watching these videos help me understand far more than the professor that I pay for. Thank you
@davidtaylor8144
@davidtaylor8144 9 жыл бұрын
Thanks prof i really feel like this just as efficient if not more than sitting in a lecture. I appreciate your dedication to teaching the untaught.
@JZ_42
@JZ_42 9 жыл бұрын
This explains in a much better way than what my textbook does. Thank you so much.
@The2bdkid
@The2bdkid 5 жыл бұрын
This is where you would not want the terminals and stack language to share symbols right? Also in a rule with multiple options, like "A -> 0 | 1A" how would you match against that easily?
@poisonedbanana
@poisonedbanana 8 жыл бұрын
At 5:21, I think "non-terminals" should be replaced with "terminals".
@sunacha1746
@sunacha1746 5 жыл бұрын
Thank you so much professor! You are saving my life!
@doubleyoubee11
@doubleyoubee11 7 жыл бұрын
4:46... Left-most derivation. Why does A terminate at epsilon and never terminate at 0? Shouldn't the derived string be 2210epsilon? Or am I missing something because of the ordering? I see: A--> 0A | ε so I would first take A --> 0A which would turn into : [STATE] ε,A-->A [STATE] ε,ε-->0 [STATE] So shouldn't we have 2210 after all that? (and not simply 221?)
@doubleyoubee11
@doubleyoubee11 7 жыл бұрын
I think it just clicked. It is not 2210 because the zero does not matter. The zero does not matter because of the epsilon. Correct, correct?
@aaronweiss3294
@aaronweiss3294 6 жыл бұрын
Those are two rules, and the grammar is non deterministic, you can take whichever you like, every time A comes up. Dr. Porter simply decided not to use the left rule in this particular derivation arbitrarily. 2210 would also be an accepted string.
@saeshd
@saeshd 9 жыл бұрын
just pick ONE example and finish it for the love of jesus.
@Kokurorokuko
@Kokurorokuko 10 ай бұрын
what do you mean?
@saeshd
@saeshd 10 ай бұрын
this was 8 years ago how dare you do this to me@@Kokurorokuko
@Kokurorokuko
@Kokurorokuko 10 ай бұрын
​You gotta be ready to defend your words, bro, even 8 years later
@omargonalfa
@omargonalfa 9 жыл бұрын
Thank you, great explanation !!
@TooMuchThought
@TooMuchThought 4 жыл бұрын
So amazingly helpful, thank you so much!!
@hamedkavousi1706
@hamedkavousi1706 8 жыл бұрын
Thank you very much sir. It was really insightful and cleared some points to me.
@richardurena5867
@richardurena5867 8 жыл бұрын
Thank you for making this video!
@assermahmoud8571
@assermahmoud8571 9 жыл бұрын
thank you it is very good lectures, i want the full course please
@assermahmoud8571
@assermahmoud8571 9 жыл бұрын
i need to know the applications of this field and also i want the recent papers in LL(1)parser if possible, please
@shaunmike
@shaunmike 9 жыл бұрын
rania mahmoud you can find applications of these all over the net
@silajitsaha3369
@silajitsaha3369 6 жыл бұрын
Same as Neso Academy
@skwisgaarskwigelf331
@skwisgaarskwigelf331 6 жыл бұрын
I can understand this video. I can't understand shit from Neso Academy.
@gauravrajghimire6396
@gauravrajghimire6396 9 жыл бұрын
is ur nam really harry porter???? very helpful though thanx
Lecture 22/65: Equivalence of CFGs and PDAs (part 2)
26:56
Context Free Grammar to Pushdown Automaton Conversion (CFG to PDA)
24:21
Sigma girl VS Sigma Error girl 2  #shorts #sigma
0:27
Jin and Hattie
Рет қаралды 124 МЛН
Ozoda - Alamlar (Official Video 2023)
6:22
Ozoda Official
Рет қаралды 10 МЛН
Lecture 20/65: PDAs: Pushdown Automata
18:54
hhp3
Рет қаралды 99 М.
Equivalence of CFG and PDA (Part 1)
22:49
Neso Academy
Рет қаралды 752 М.
Lecture 41/65: Halting Problem: A Proof by Reduction
10:21
4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
1:09:23
MIT OpenCourseWare
Рет қаралды 78 М.
Context-Free Grammar to Pushdown Automaton Conversion (CFG to PDA)
9:15
Pumping Lemma for Context-Free Languages: Four Examples
48:49
Easy Theory
Рет қаралды 58 М.