@Arjun Sir I have the below doubts -
For ex, if an expression would have been
y = add(a, b ) + sub( c, d ) + div( e/f );
where add, sub or div are functions. The order becomes compiler dependent as which function to invoke first is a choice.
But if expression is (a + b) + (c + d) + (e+d).
After the grammar creates a syntax tree and converts it into postifix notation using SDT.
the expression would be come = ab+ + cd+ + ed+
= ab+cd++ + ed+
The order of evaluation becomes fixed in this case isnt it?