Consider two binary operators $` \uparrow '$ and $‘ \downarrow ’$ with the precedence of operator $\downarrow$ being lower than that of the operator $\uparrow$. Operator $\uparrow$ is right associative while operator $\downarrow$ is left associative. Which one of the following represents the parse tree for expression $(7 \downarrow 3 \uparrow 4 \uparrow 3 \downarrow 2)$
Answer is B.
To make the parse tree start compiling the identifiers into blocks based on associativity and precedence.
Grouping: $(7 \downarrow (3 \uparrow(4 \uparrow 3))) \downarrow2 $
Tree can be made by opening inner braces and move towards braces.
@sahil you can see my response sheet...