Compiler Design Intermediate code Generation : Abstract syntax tree AST & Polish notation with examples
Пікірлер: 20
@mohanthmane38954 жыл бұрын
Example of abstract syntax tree is wrong. a*b is evaluated first
@tanmaiysethia1762 жыл бұрын
aise teachers ke kaaran indian university bacchon ka chalra !! , god give them evreything
@iamshishir.24 Жыл бұрын
Remember you have to do hard work you have to put efforts you have to wake up in night to let your dream waken up some day, but the right time will define the growth of you career
@revanthvasupalli29103 жыл бұрын
If * has higher precedence ,then it shouldn't be the root of abstract syntax tree .Instead + is to be taken as root. Thank you :)
@thomasdebock19482 жыл бұрын
late but, no the tree is run from bottom to top so this way it does the * first, then the +
@oborofolusho2125 жыл бұрын
My question is towards the end of the postfix, why did you push the second plus(+) to the end? Is there a rule to note?
@ChandanaChandu-wo5dt3 жыл бұрын
Hi mam, y u push the (+) into last in postfix example ,if u don't mind plz again explain that example by taking another example
@ShubhamSoni-wj1vu2 жыл бұрын
I think in your solution postfix answer is wrong.please explain correct knowledge here ...
@ailijic5 жыл бұрын
You are very good at teaching, thank you.
@anubhavsingh69495 жыл бұрын
You are a life saver
@oborofolusho2125 жыл бұрын
Thank you from 2019
@kartiknagarkoti9552 ай бұрын
The content is great..but the sound of marker is annoying
@supersuperhero24497 ай бұрын
Mam hume padha rhi he ya khud, pls explain to kariye
@pranaygarapati43912 жыл бұрын
Madam, the operation * has more precedence it has to be performed first
@imhere19097 ай бұрын
No, you have take from left to right while solving in trees in compiler design