6 (Harder) In C, C++, C# and Java there is no Assignment statement as such. Instead, the assignment operators are treated as low precedence infix operators in expressions, and a “statement” like x = y; is really an expression that: (a) computes the value of y; (b) assigns this to x; (c) has an intrinsic value which can then be discarded. This means that it is possible to write useful expressions like x = (y = z + 5); in which the value of z + 5 is first assigned to y and the value of the sub-expression (y = z + 5) is then assigned to x. Because the assignment operator is right associative one can write this concisely as x = y = z + 5;. Suppose that we modified the relevant parts of the grammar for Parva to read

Would this suffice to develop a more C-like compiler? If not, can you find a better alternative? Can the productions be attributed so as to forbid expression “statements”, exemplified by

which seem to be acceptable to the above grammar?