Code No: A107320502 Set No. 1 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III B.Tech. II Sem., II Mid-Term Examinations, March – 2011 COMPILER DESIGN Objective Exam

Code No: A107320502                                                                  Set No. 1

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III B.Tech. II Sem., II Mid-Term Examinations, March – 2011

COMPILER DESIGN Objective Exam

A

Name:                                              Hall Ticket No.

Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.

I 1.	Choose the correct alternative: ----- data structure gives intermediate performance to implement symbol tables.	[	]
	a)  hash tables  b) trees       c) both                d)    linear list
2.	------ analyzer  phase refers  symbol table for type conflict issue . a) semantic             b)    syntactic    c)  lexical    d)   none	[	]
3.	The method that merges the bodies of 2 loops is a) loop nesting   b) constant folding    c) loop ramming   d) none	[	]
4.	The   machine --------- code optimization can be applied to intermediate representation. a) Independent   b) dependent       c)   both          d) none	[	]

5.         -------- is are used as the key to accessing the scope information from symbol table.          [          ]

a) procedure name    b) nesting depth   c)  both     d)  none

6.         Common expressions can be obtained from                                                                          [          ]

a)  DAG         b) tree    c) record                d)  none

7.         If every time the variable x changes values in a loop L then variable  x is called                 [          ]

a) Assignment     b) subscript     c) induction variable   d) none

8.         Producing ---------- code as o/p allows sub program to be compiled separately.                  [          ]

a) Re locatable machine   b) absolute machine   c) both          d) none

9.         In IBM systems/370 machine integer multiplication and division involves.                         [          ]

a) stack     b)   register pairs    c) heap      d) arrays

10.       Instruction involving only register operands are ------ than those involving memory operands

[          ]

a) slow      b) faster      c) equal     d) none

Cont…..2

Code No: A107320502                                   :2:                                       Set No.1

II      Fill in the blanks:

11.       -------------------optimization is a form of  local  optimization .

12.       In DAG, interior nodes are labeled by ----------------  symbol .

13.       --------------- is a situation where hash function results in same location for storing the names.

14.       For a --------------, we need to be able to add new information for a given name.

15.       Dynamic allocation of storage area with VSAM files is accomplished by ----------------

16.       Induction   variable   elimination   is   an important technique used in ------------

17.       Assignment of   form f: = g is called ---------------- assignment.

18.       A ordinary  variable  whose value follows  the control  variable  of a loop  in a  linear  relationship called ------------------  variable.

19.       Variable   descriptors  are also known as ---------------------- variables

20.       The   ---------------- phase converts intermediate optimized cod into a sequence of machine instruction .

-oOo-

Code No: A107320502                                                                  Set No. 2

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III B.Tech. II Sem., II Mid-Term Examinations, March – 2011

COMPILER DESIGN

Objective Exam

A

Name:                                              Hall Ticket No.

Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.

I       Choose the correct alternative:

1.         The   machine --------- code optimization can be applied to intermediate representation.    [          ]

a) Independent   b) dependent       c)   both          d) none

2.         -------- is are used as the key to accessing the scope information from symbol table.          [          ]

a) procedure name    b) nesting depth   c)  both     d)  none

3.         Common expressions can be obtained from                                                                          [          ]

a)  DAG         b) tree    c) record                d)  none

4.         If every time the variable x changes values in a loop L then variable  x is called                 [          ]

a) Assignment     b) subscript     c) induction variable   d) none

5.         Producing ---------- code as o/p allows sub program to be compiled separately.                  [          ]

a) Re locatable machine   b) absolute machine   c) both          d) none

6.         In IBM systems/370 machine integer multiplication and division involves.                         [          ]

a) stack     b)   register pairs    c) heap      d) arrays

7.         Instruction involving only register operands are ------ than those involving memory operands

[          ]

a) slow      b) faster      c) equal     d) none

8.         -------- data structure gives intermediate performance to implement symbol tables.            [          ]

a)  hash tables  b) trees       c) both                d)    linear list

9.	------ analyzer	phase refers  symbol table for type conflict issue .	[	]
	a) semantic	b)    syntactic    c)  lexical    d)   none

10.       The method that merges the bodies of 2 loops is                                                                   [          ]

a) loop nesting   b) constant folding    c) loop ramming   d) none

Cont…..2

Code No: A107320502                                   :2:                                       Set No.2

II      Fill in the blanks:

11.       For a --------------, we need to be able to add new information for a given name.

12.       Dynamic allocation of storage area with VSAM files is accomplished by ----------------

13.       Induction   variable   elimination   is   an important technique used in ------------

14.       Assignment of   form f: = g is called ---------------- assignment.

15        A ordinary  variable  whose value follows  the control  variable  of a loop  in a  linear  relationship called ------------------  variable.

16.       Variable   descriptors  are also known as ---------------------- variables

17.       The   ---------------- phase converts intermediate optimized cod into a sequence of machine instruction .

18.       -------------------optimization is a form of  local  optimization .

19.       In DAG, interior nodes are labeled by ----------------  symbol .

20.       --------------- is a situation where hash function results in same location for storing the names.

-oOo-

Code No: A107320502                                                                  Set No. 3

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III B.Tech. II Sem., II Mid-Term Examinations, March – 2011

COMPILER DESIGN

Objective Exam

A

Name:                                              Hall Ticket No.

Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.

I       Choose the correct alternative:

1.         Common expressions can be obtained from                                                                          [          ]

a)  DAG         b) tree    c) record                d)  none

2.         If every time the variable x changes values in a loop L then variable  x is called                 [          ]

a) Assignment     b) subscript     c) induction variable   d) none

3.         Producing ---------- code as o/p allows sub program to be compiled separately.                  [          ]

a) Re locatable machine   b) absolute machine   c) both          d) none

4.         In IBM systems/370 machine integer multiplication and division involves.                         [          ]

a) stack     b)   register pairs    c) heap      d) arrays

5.         Instruction involving only register operands are ------ than those involving memory operands

[          ]

a) slow      b) faster      c) equal     d) none

6.         ----- data structure gives intermediate performance to implement symbol tables.                [          ]

a)  hash tables  b) trees       c) both                d)    linear list

7.	------ analyzer  phase refers  symbol table for type conflict issue . a) semantic             b)    syntactic    c)  lexical    d)   none	[	]
8.	The method that merges the bodies of 2 loops is a) loop nesting   b) constant folding    c) loop ramming   d) none	[	]
9.	The   machine --------- code optimization can be applied to intermediate representation.	[	]

a) Independent   b) dependent       c)   both          d) none

10.       -------- is are used as the key to accessing the scope information from symbol table.          [          ]

a) procedure name    b) nesting depth   c)  both     d)  none

Cont…..2

Code No: A107320502                                   :2:                                       Set No.3

II      Fill in the blanks:

11.       Induction   variable   elimination   is   an important technique used in ------------

12.       Assignment of   form f: = g is called ---------------- assignment.

13.       A ordinary  variable  whose value follows  the control  variable  of a loop  in a  linear  relationship called ------------------  variable.

14.       Variable   descriptors  are also known as ---------------------- variables

15.       The   ---------------- phase converts intermediate optimized cod into a sequence of machine instruction .

16.       -------------------optimization is a form of  local  optimization .

17.       In DAG, interior nodes are labeled by ----------------  symbol .

18.       --------------- is a situation where hash function results in same location for storing the names.

19.       For a --------------, we need to be able to add new information for a given name.

20.       Dynamic allocation of storage area with VSAM files is accomplished by ----------------

-oOo-

Code No: A107320502                                                                  Set No. 4

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III B.Tech. II Sem., II Mid-Term Examinations, March – 2011

COMPILER DESIGN

Objective Exam

A

Name:                                              Hall Ticket No.

Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.

I       Choose the correct alternative:

1.         Producing ---------- code as o/p allows sub program to be compiled separately.                  [          ]

a) Re locatable machine   b) absolute machine   c) both          d) none

2.         In IBM systems/370 machine integer multiplication and division involves.                         [          ]

a) stack     b)   register pairs    c) heap      d) arrays

3.         Instruction involving only register operands are ------ than those involving memory operands

[          ]

a) slow      b) faster      c) equal     d) none

4.         ----- data structure gives intermediate performance to implement symbol tables.                [          ]

a)  hash tables  b) trees       c) both                d)    linear list

5.	------ analyzer  phase refers  symbol table for type conflict issue . a) semantic             b)    syntactic    c)  lexical    d)   none	[	]
6.	The method that merges the bodies of 2 loops is a) loop nesting   b) constant folding    c) loop ramming   d) none	[	]
7.	The   machine --------- code optimization can be applied to intermediate representation.	[	]

a) Independent   b) dependent       c)   both          d) none

8.         -------- is are used as the key to accessing the scope information from symbol table.          [          ]

a) procedure name    b) nesting depth   c)  both     d)  none

9.         Common expressions can be obtained from                                                                          [          ]

a)  DAG         b) tree    c) record                d)  none

10.       If every time the variable x changes values in a loop L then variable  x is called                 [          ]

a) Assignment     b) subscript     c) induction variable   d) none

Cont…..2

Code No: A107320502                                   :2:                                       Set No.4

II      Fill in the blanks:

11.       A ordinary  variable  whose value follows  the control  variable  of a loop  in a  linear  relationship called ------------------  variable.

12.       Variable   descriptors  are also known as ---------------------- variables

13.       The   ---------------- phase converts intermediate optimized cod into a sequence of machine instruction .

14.       -------------------optimization is a form of  local  optimization .

15.       In DAG, interior nodes are labeled by ----------------  symbol .

16.       --------------- is a situation where hash function results in same location for storing the names.

17.       For a --------------, we need to be able to add new information for a given name.

18.       Dynamic allocation of storage area with VSAM files is accomplished by ----------------

19.       Induction   variable   elimination   is   an important technique used in ------------

20.       Assignment of   form f: = g is called ---------------- assignment.

-oOo-

Code No: A107320502                                                         Set No. 1

COMPILER DESIGN KEYS

I       Choose the correct alternative

1.         B

2.         A

3.         C

4.         A

5.         C

6.         A

7.         C

8.         C

9.         B

10.       B

II      Fill in the blanks:

11.       PEEP HOLE

12.       OPERATOR

13.       COLISION

14.       SYMBOL TABLE

15.       CONTROL SPLITS

16.       LOOP OPTIMIZATION

17.       COPY STATEMENTS

18.       INAVARIANT

19.       ADDRESS

20.       CODE   GENERATION

-oOo-