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

Рет қаралды 134,888

Sudhakar Atchala

5 жыл бұрын

#SyntaxDirectedTranslation #SDTforinfixtopostfixconversion #SDTexamples

Пікірлер: 56

@parchurimaheshbabu 8 ай бұрын

Sir thumbnail 🔥🔥🔥

@SudhakarAtchala 8 ай бұрын

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

@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 4 жыл бұрын

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

@SudhakarAtchala 4 жыл бұрын

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.

@beingcheercool 2 жыл бұрын

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

@SudhakarAtchala 2 жыл бұрын

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

@ostrich1233 3 жыл бұрын

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

@Harshitha_Gonella 4 ай бұрын

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 4 ай бұрын

All the best

@jahnavimulakalapati5076 5 жыл бұрын

topic is very clear sir. thanku

@SudhakarAtchala 5 жыл бұрын

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 4 жыл бұрын

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 4 жыл бұрын

@ayanavnambiar 3 жыл бұрын

Thank you soo much sir.

@SudhakarAtchala 2 жыл бұрын

Most welcome Ayana.

@amirtharani4339 2 жыл бұрын

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

@SudhakarAtchala 2 жыл бұрын

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

@nikitasinha8181 3 жыл бұрын

Thank u so much sir

@SudhakarAtchala 3 жыл бұрын

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

@OrugantiKalyan 20 күн бұрын

❤

@SudhakarAtchala 20 күн бұрын

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

@saisravani2625 2 жыл бұрын

SIR HOW TO DO FOR PREFIX

@arunakapoor9159 Жыл бұрын

❤❤

@SudhakarAtchala Жыл бұрын

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

@rohanhegde108 Жыл бұрын

respect++

@SudhakarAtchala Жыл бұрын

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

@vinaykumarreddygajjala9577 11 ай бұрын

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

@SudhakarAtchala 11 ай бұрын

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

@omkarhiwant5157 3 ай бұрын

Nice sir 🎉

@SudhakarAtchala 3 ай бұрын

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

@mahimasejwal4902 4 жыл бұрын

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 4 жыл бұрын

We have to construct the grammar

@SudhakarAtchala 4 жыл бұрын

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.

@536vidya2 3 жыл бұрын

Both sdt and sdd are same or not

@SudhakarAtchala 3 жыл бұрын

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

@linuxdoesnotsuck 2 жыл бұрын

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

@jahnavimulakalapati5076 5 жыл бұрын

could u add the topic intermediate code generation

@SudhakarAtchala 5 жыл бұрын

ya definitely I will upload on 12th

@jahnavimulakalapati5076 5 жыл бұрын

@@SudhakarAtchala thanku sir

@theshahzorahmed6967 4 ай бұрын

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

@SudhakarAtchala 4 ай бұрын

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...