www.jntuworld.

com

Code No: A107320502

Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. II Sem., I Mid-Term Examinations, February 2011
COMPILER DESIGN
Objective Exam
Name: ______________________________ Hall Ticket No.
A

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

Choose the correct alternative:

1.

The context sensitive grammar can be identified by

a) TM
b) PDA
c) FA
d) LBA

2.

Necessary condition for construction of predictive parser is

a) Avoid ambiguous grammar b) left factor the recursive grammar
c) both a and b
d) none

3.

The action table in LR parser have ------------- value .

a) shift b) accept
c) error
d) all

4.

----------- are the constructed data types.

a) arrays b) structures
c) pointer

D
L

R
O
d) all

5.

There are ------ representations used for these address code.

a) 1
b) 2
c) 3
d) 4

6.

------------- file consists of tabular representation of the transmission diagrams Constructed for
expressions of specification file
[
a) lex.yy.c
b) x.l
c) a.out
d) none

7.

W
U

T
N

Interpreter is a type of
a) Preprocessor
b) compiler

c) translator

d) all

8.

In which parsing input symbols are placed at leaf nodes for successful parsing is
a) top down
b) bottom up
c) universal
d) predictive

9.

-------- converts high level language to machine level language

a) Compiler
b) translator
c) interpreter
d) none

10.

While performing type checking ------ special basic types are needed.
a) 1
b) 2
c) 3
d) 4

Cont..2

www.jntuworld.com

www.jntuworld.com

Code No: A107320502

:2:

Set No.1

II

Fill in the blanks:

11.

A right most derivation in reverse often called a canonical reduction sequence is obtained by -----

12.

LALR stands for ------------------

13.

A LEX is a source program consists of 2 parts, a sequence of auxiliary definitions and --------

14.

The table management or book keeping portion of compiler keeps track of the names used by
program and -------------

15.

The RHS rule is directly converted into the program symbol by symbol in -------------

16.

Polish notation is also called as ---------------- notation .

17.

Among all the LR (1) parsers , the strongest is --------------

18.

The constructed data types are build using ------------- data types.

19.

The systematic way of expressing type of language construct is called ---------------

20.

The natural hierarchical structures is represented by -------------- trees .

R
O

D
L

W
U

T
N

-oOo-

www.jntuworld.com

www.jntuworld.com
Code No: A107320502
Set No. 2
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. II Sem., I Mid-Term Examinations, February 2011
COMPILER DESIGN
Objective Exam
Name: ______________________________ Hall Ticket No.
A

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

Choose the correct alternative:

1.

----------- are the constructed data types.

a) arrays b) structures
c) pointer

d) all

2.

There are ------ representations used for these address code.

a) 1
b) 2
c) 3
d) 4

3.

------------- file consists of tabular representation of the transmission diagrams Constructed for
expressions of specification file
[
a) lex.yy.c
b) x.l
c) a.out
d) none

4.

Interpreter is a type of
a) Preprocessor
b) compiler

D
L

R
O

c) translator

d) all

5.

In which parsing input symbols are placed at leaf nodes for successful parsing is
a) top down
b) bottom up
c) universal
d) predictive

6.

-------- converts high level language to machine level language

a) Compiler
b) translator
c) interpreter
d) none

7.

While performing type checking ------ special basic types are needed.
a) 1
b) 2
c) 3
d) 4

8.

The context sensitive grammar can be identified by

a) TM
b) PDA
c) FA
d) LBA

9.

Necessary condition for construction of predictive parser is

a) Avoid ambiguous grammar b) left factor the recursive grammar
c) both a and b
d) none

10.

The action table in LR parser have ------------- value .

a) shift b) accept
c) error
d) all

W
U

T
N

Cont..2

www.jntuworld.com

www.jntuworld.com

Code No: A107320502

:2:

Set No.2

II

Fill in the blanks:

11.

The table management or book keeping portion of compiler keeps track of the names used by
program and -------------

12.

The RHS rule is directly converted into the program symbol by symbol in -------------

13.

Polish notation is also called as ---------------- notation .

14.

Among all the LR (1) parsers , the strongest is --------------

15.

The constructed data types are build using ------------- data types.

16.

The systematic way of expressing type of language construct is called ---------------

17.

The natural hierarchical structures is represented by -------------- trees .

18.

A right most derivation in reverse often called a canonical reduction sequence is obtained by -----

19.

LALR stands for ------------------

20.

A LEX is a source program consists of 2 parts, a sequence of auxiliary definitions and --------

D
L

R
O

W
U
-oOo-

T
N

www.jntuworld.com

www.jntuworld.com
Code No: A107320502
Set No. 3
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. II Sem., I Mid-Term Examinations, February 2011
COMPILER DESIGN
Objective Exam
Name: ______________________________ Hall Ticket No.
A

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

Choose the correct alternative:

1.

------------- file consists of tabular representation of the transmission diagrams Constructed for
expressions of specification file
[
a) lex.yy.c
b) x.l
c) a.out
d) none

2.

Interpreter is a type of
a) Preprocessor
b) compiler

c) translator

d) all

D
L

3.

In which parsing input symbols are placed at leaf nodes for successful parsing is
a) top down
b) bottom up
c) universal
d) predictive

4.

-------- converts high level language to machine level language

a) Compiler
b) translator
c) interpreter
d) none

5.

While performing type checking ------ special basic types are needed.
a) 1
b) 2
c) 3
d) 4

6.

The context sensitive grammar can be identified by

a) TM
b) PDA
c) FA
d) LBA

7.

Necessary condition for construction of predictive parser is

a) Avoid ambiguous grammar b) left factor the recursive grammar
c) both a and b
d) none

8.

The action table in LR parser have ------------- value .

a) shift b) accept
c) error
d) all

9.

----------- are the constructed data types.

a) arrays b) structures
c) pointer

10.

R
O

W
U

T
N

d) all

There are ------ representations used for these address code.

a) 1
b) 2
c) 3
d) 4

Cont..2

www.jntuworld.com

www.jntuworld.com

Code No: A107320502

:2:

Set No.3

II

Fill in the blanks:

11.

Polish notation is also called as ---------------- notation .

12.

Among all the LR (1) parsers , the strongest is --------------

13.

The constructed data types are build using ------------- data types.

14.

The systematic way of expressing type of language construct is called ---------------

15.

The natural hierarchical structures is represented by -------------- trees .

16.

A right most derivation in reverse often called a canonical reduction sequence is obtained by -----

17.

LALR stands for ------------------

18.

A LEX is a source program consists of 2 parts, a sequence of auxiliary definitions and --------

19.

The table management or book keeping portion of compiler keeps track of the names used by
program and -------------

20.

The RHS rule is directly converted into the program symbol by symbol in -------------

D
L

R
O

W
U
-oOo-

T
N

www.jntuworld.com

www.jntuworld.com
Code No: A107320502
Set No. 4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. II Sem., I Mid-Term Examinations, February 2011
COMPILER DESIGN
Objective Exam
Name: ______________________________ Hall Ticket No.
A

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

Choose the correct alternative:

1.

In which parsing input symbols are placed at leaf nodes for successful parsing is
a) top down
b) bottom up
c) universal
d) predictive

2.

-------- converts high level language to machine level language

a) Compiler
b) translator
c) interpreter
d) none

3.

While performing type checking ------ special basic types are needed.
a) 1
b) 2
c) 3
d) 4

4.

The context sensitive grammar can be identified by

a) TM
b) PDA
c) FA
d) LBA

5.

Necessary condition for construction of predictive parser is

a) Avoid ambiguous grammar b) left factor the recursive grammar
c) both a and b
d) none

6.

The action table in LR parser have ------------- value .

a) shift b) accept
c) error
d) all

7.

----------- are the constructed data types.

a) arrays b) structures
c) pointer

R
O

D
L

W
U

T
N

d) all

8.

There are ------ representations used for these address code.

a) 1
b) 2
c) 3
d) 4

9.

------------- file consists of tabular representation of the transmission diagrams Constructed for
expressions of specification file
[
a) lex.yy.c
b) x.l
c) a.out
d) none

10.

Interpreter is a type of
a) Preprocessor
b) compiler

[
c) translator

d) all
Cont..2

www.jntuworld.com

www.jntuworld.com

Code No: A107320502

:2:

Set No.4

II

Fill in the blanks:

11.

The constructed data types are build using ------------- data types.

12.

The systematic way of expressing type of language construct is called ---------------

13.

The natural hierarchical structures is represented by -------------- trees .

14.

A right most derivation in reverse often called a canonical reduction sequence is obtained by -----

15.

LALR stands for ------------------

16.

A LEX is a source program consists of 2 parts, a sequence of auxiliary definitions and --------

17.

The table management or book keeping portion of compiler keeps track of the names used by
program and -------------

18.

The RHS rule is directly converted into the program symbol by symbol in -------------

19.

Polish notation is also called as ---------------- notation .

20.

Among all the LR (1) parsers , the strongest is --------------

R
O

D
L

W
U

T
N

-oOo-

www.jntuworld.com