In a certain code language, $\text{STRING}$ is written as \% = * - \ \div$and$ \text{PRAISE}$as$? * @ - \% \times$.Howwilltheword$ \text{GRAPES}$ be written in that code language?

This follows a direct letter-to-symbol substitution scheme. Let's map each letter from the given words:
* From $\text{STRING}$: $\text{S}\to \%$, $\text{T}\to =$, $\text{R}\to \ast$, $\text{I}\to -$, \text{N} \rightarrow \$,$ \text{G} \rightarrow \div$\ast From$ \text{PRAISE}$:$ \text{P} \rightarrow ?$,$ \text{R} \rightarrow *$,$ \text{A} \rightarrow @$,$ \text{I} \rightarrow -$,$ \text{S} \rightarrow \%$,$ \text{E} \rightarrow \times$Now,le{t}^{\prime }ssubstitutethematchingsymbolsfortheword$ \text{GRAPES}$:\ast$ \text{G} \rightarrow \div$\ast$ \text{R} \rightarrow *$\ast$ \text{A} \rightarrow @$\ast$ \text{P} \rightarrow ?$\ast$ \text{E} \rightarrow \times$\ast$ \text{S} \rightarrow \%$Puttingitalltogether,$ \text{GRAPES}$iscodedas$ \div * @ ? \times % $.