Syntax Directed Translation||Translation scheme to convert infix to postfix expression

#SyntaxDirectedTranslation #SDTforinfixtopostfixconversion #SDTexamples

[@akfreefire7059]

Absoluely stunner sir.i cant even get half marks in mid,but i prepared your videos for sem,i aced the exam.thank you so much sir.love you sir.🎉❤😊.keep going.i want a somany concepts from your sir😊

[@SudhakarAtchala]

So nice of you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@shivanirao9607]

I watch many videos for this topic but sir you explain it very well thank you

[@SudhakarAtchala]

Plz go through my playlists once. Definitely you will like more videos. Hai shivani rao,Thanks for your encouragement and support towards our channel.Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.

[@parchurimaheshbabu]

Sir thumbnail 🔥🔥🔥

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@beingcheercool]

You are doing really great work sir 😊
God will definitely help you 🙏

[@SudhakarAtchala]

So nice of you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@Harshitha_Gonella]

kudos to your hardwork sir..ur explaination is simply awesome sir💥thanks a lot sir🙏
and I have already subscribed to you long ago😊

[@SudhakarAtchala]

All the best

[@ostrich1233]

What is the difference between annotated and depenncy?
Only numbering?

[@jahnavimulakalapati5076]

topic is very clear sir. thanku

[@SudhakarAtchala]

Thanku. Plz subscribe to the channel and share with your friends.

[@justadashofblue]

lovely explanation sir! thankyou for the video!🥰

[@SudhakarAtchala]

Most welcome 😊. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@prabhuram2839]

hi sir, tq for the nice explanation. I have one doubt, here the semantic rule contains, E--> E+T{semantic actions} but in Creation of syntax tree contains E.node, T.node. is it ok to use either representation? tq

[@SudhakarAtchala]

Ya

[@amirtharani4339]

Very excellent explanation sir please remaining heading is procedure for the Nonterminal,optimizing the translator and the complete program

[@SudhakarAtchala]

As soon as possible. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@ayanavnambiar]

Thank you soo much sir.

[@SudhakarAtchala]

Most welcome Ayana.

[@mahimasejwal4902]

Sir both methods were same , constructing the parse tree and parsing it top down left right ??? And sir the grammar will be given or it has to be constructed by us?

[@SudhakarAtchala]

We have to construct the grammar

[@SudhakarAtchala]

Hai Sejwal, plz go through my videos once. Definitely you will like more videos. Thanks
for your encouragement and support towards our channel. Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.

[@vinaykumarreddygajjala9577]

sir is semantic actions given along with productions or we need to write them by our own #SDTTranslation

[@SudhakarAtchala]

It's better to practice. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@nikitasinha8181]

Thank u so much sir

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks

[@rohanhegde108]

respect++

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@arunakapoor9159]

❤❤

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@omkarhiwant5157]

Nice sir 🎉

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@linuxdoesnotsuck]

Both are same methods right?only grammar is different....sorry i understand now..........you didn't remove the left recursion in first example,directly you go with parse tree even though their exit a left recursion in the grammar...but for the second grammar you eliminated left recursion right?

[@RohitSharma-wx9rk]

You can do it without eliminating left recursion

[@saisravani2625]

SIR HOW TO DO FOR PREFIX

[@OrugantiKalyan]

❤

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@theshahzorahmed6967]

sir how we will be knowing the production rules for construction of SDT

[@SudhakarAtchala]

This is a direct question. converting infix to postfix. so you have to remember this. for some questions directly production rules will be given in exam. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...

[@536vidya2]

Both sdt and sdd are same or not

[@SudhakarAtchala]

they are different vidya. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@jahnavimulakalapati5076]

could u add the topic intermediate code generation

[@SudhakarAtchala]

ya definitely I will upload on 12th

[@jahnavimulakalapati5076]

@@SudhakarAtchala thanku sir

[@satyasai7781]

Sir grammar exam lo istara?

[@SudhakarAtchala]

It is better to remember grammar also. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@shaziyasultana4373]

Sir plz upload videos of 5th unit completely plzzzzz

[@SudhakarAtchala]

Can you post unit 5 syllabus. So that i will try to upload videos on them

[@101yashu]

sir why didnt u solve left recursion in first example

[@SudhakarAtchala]

It's our choice. We can perform the translation without eliminating left recursion also.

[@101yashu]

@@SudhakarAtchala thank you for such quick replay sir but pls upload backpatch ing