o e. gande Java is implemented based on O a. The use of hardware interpreter of O b. The use of software interpreter O c. The use of firmware interpreter d. a orc O e. a ando a If x is defined as: x: record a: real; b: integer end andy is defined as: y: record m: real; n:integer end Then a. x and y have structural equivalence b. x and y have name equivalence c. X and y are not equivalent d. 2 and y have name and structural equivalence e none of the mentioned In simple call return mechanism the return address is the pair( CIP, CEP) and is stored in the activation of the called subprogram Select one: O True False The copy rule can be applied if the subprogram is recursive. Select one: True False Co routines Select one: A non of the mentioned B. Can be implemented as ordinary subprograms C. can not be implemented as simple cal return mechanism D. cannot be recursive Clear my choice Major storage for ML, LISP and Prolog is a heap. Get storage - allocate(x) free storage - free(x) Problem: Dangling and garbage are occurred when we use the code O a allocate (x); x=y: tree xha O b. allocate(x), allocate(x) O c. a and b respectively d.b and a respectively e none of the mentioned