Consider a block-structured language in which a name can be declared to be an Integer or a real. Suppose that expressions are represented by a terminal expr and that the only statements are assignments. conditionals. whiles, and sequences of statements. Assuming that integers are allocated one word and that Teals are allocated two words. give a syntax-directed algorithm (based on a reasonable grammar for declarations and blocks) to determine bindings from names to words that can be used by an activation of a block, Does your allocation use the minimum number of words adequate for any execulion of the block.