Bottom-Up Parsing: LR(0) & SLR(1) Automaton

[@ScareFire]

That’s insane, you’re able to completely isolate the methodologies without having to explain the whole lesson behind it Thank you so much for making all those videos

[@samacker77youtube]

Awesome! Your content is so good. You explain things so easily. Thank you so much. Subscribed!!

[@amirhoushmand9520]

i just want to say u saved me from crying 😐😂 i passed my exam , i looooooooove uuuuuuuuu 😍😍😍😍😍😘😘😘😘

[@mahmodel-attar2856]

u have a message at 1:52 ^^ just kidding ur channel is awesome THANKS ....

[@alexandercharles7709]

Very useful thank you!

[@muhammadatif25]

You said we do not need to remove left factoring. Do we remove left factoring or rather apply it to make it deterministic?

[@juliaschmit1188]

Mifta Sintaha What happens when you have a grammar that has one terminal that repeats itself in two productions as such: A -> nA | C C -> S = S | nS S -> a You start with A' -> .A (i0) A -> .nA A -> .C C -> .S = S C -> .nS S -> .a Then: A' -> .A ------> A' -> A. (i1) ***A -> .nA (when you receive n, you have two variables which can have terminal n ) A -> .C -------> A -> C. (i3?) C -> .S = S ------> C -> S.=S ***C -> .nS -------> ? S -> .a Do I input the terminal n in the same state of two different states (A and C) or are they separated?

[@shikhagwalbans8788]

very nyc n clear tutorial

[@mandardeulkar6010]

very useful!!!

[@CoLinearProductions]

You have a great channel, subscribed :D you might help me pass the Languages and Compilations module, thanks!

[@cathrin9936]

i want CFG topic

[@tadiwamagwenzi3439]

lol please redo this video,

[@ddystopia8091]

Это просто пересказ дракончика