The target code generator takes the intermediate code as the input and generates a target program as output. The target program can take one of the three forms (1) assembly language program; (2) relocatable code; (3) absolute code. The memory organisation of FORTRAN77 runtime environment does not have a stack or a heap for dynamic […]

1.       The term l-value refers to the storage location of an expression and r-value refers to the value of the expression. 2.       In call-by-reference method, the changes made to the formal parameters are reflected in the actual parameters at the caller site. 3.       The template-based approach for code generation produces sub-optimal code in terms of

1.       The ‘display’ scheme helps in resolving non-local variable access in the case of nested procedures in PASCAL. 2.       In ‘call by value-result’ parameter-passing mechanism used in languages like ADA, the final value of the formal parameters is copied back to the actual parameters. 3.       The literals are accessed using the label with a dollar($)

1.       What are the steps in performing loop invariant code motion optimisation using the ud-chain information? 2.       What are the conditions to be satisfi ed in order to move a TAC statement from within the loop to the pre-header? 3.       What are the common steps taken by target code generators for producing efficient code? 4.      

1.       Describe an algorithm for computing next use and liveness properties at each quad level in a basic block. 2.       Describe the data structures and the algorithm for a simple target code generator that retains the values of variables in registers for as long as possible. 3.       What is peep-hole optimisation? Give five examples of

1.       The strength reduction transformations identify and replace costly operations by less expensive counterparts. 2.       The DAG is a data structure used for implementing optimising transformations on the intermediate code across basic blocks. 3.       The loop optimisations in the intermediate code are performed during the local optimisation phase.

1.       The order in which DAG nodes are created from the intermediate code during the DAG construction process is in topologically sorted order. 2.       The leaf nodes in a DAG cannot have any attached identifiers to it. 3.       The input variables to a block manifest as leaves in the DAG during the DAG construction process

1.       The ‘liveness’ data fl ow property helps in performing global dead code elimination and also in making decisions for retaining a variable’s value in a register. 2.       The iterative approach to solving data flow equations is used for resolving the cyclic dependency between the properties of flow graph nodes in the cases of input

1.       A node ‘d’ of a flow graph dominates node ‘n’, if every path from the initial node to ‘n’ goes through ‘d’. 2.       The dominators[head] containing the tail node in a flow graph detects the presence of a back edge. 3.       A pre-header is a basic block introduced during the loop optimisation to hold

1. What are the essential functional differences between 1st generation, 2nd generation, and 3rd generation of networks? 2. Describe what do you understand by Wireless PAN, Wireless LAN and Wireless MAN. 3. What is an ISM band? Why is it called a free band? 4. What are the characteristics of a mobile computing environment?