Uncategorized

1.       In semantic analysis, the global variables declared in the input source are converted to symbol table entries. How are the symbol table entries translated into corresponding declarations in x86 assembly language by the target code generator? Illustrate by example for   (a) simple variables   (b) arrays. 2.       How do you generate target code for arithmetic […]

Illustrate by example, the calling and return sequences in C runtime environment. Explain the terms (a) Actual parameters. (b) Formal parameters. Illustrate with an example. Explain (a) call-by-reference and (b) call-by-value parameter-passing mechanisms. Illustrate with an example. Explain (a) call-by-value-result and (b) call-by-name parameter-passing mechanisms. Illustrate with an example. How do the run-time environments of

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.       How are local variables resolved to memory addresses during the translation of intermediate code to target code by the code generator? Draw the stack layout showing the local variables. 2.       How are numeric and string literals in the intermediate code translated to the target code? Illustrate with an example each.

1.       How do you generate target code for indexed TAC operators in a template-based code generation approach? Illustrate with examples for   (a) L_INDEX_ASSIGN   (b) R_INDEX_ASSIGN. 2.       How do you generate target code for comparison TAC operators in a template-based code generation approach? Illustrate with examples for any three comparison operators. 3.       How do you generate

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.       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.       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.       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.       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