Code No: NR-RR-320504

NR/RR

Set No. 2

1. (a) List out the data structure to perform Macro Expansion.

2. (a) Write about lexical analyzer generator.

[8]

[8]

[7]

ld .

(b) Write an algorithm for Macro processing.

in

III B.Tech II Semester Supplementary Examinations,May 2010 LANGUAGE PROCESSORS Common to Information Technology, Computer Science And Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????

(b) Construct minimumstate DFAs for the following regular expressions. i. (a+b)* a (a+b)

[3]

iii. (a/b)* a (a/b)(a/b)(a/b).

[3]

or

ii. (a+b)* a (a+b) (a+b)

[3]

uW

3. (a) What are the applications of DAG. Explain how the following expression can be converted in a DAG a+b*(a+b)+c+d [8] (b) Explain how loop invariant components can be eliminated.

[8]

4. (a) Suppose the declaration are generated by the following grammer D→idL | L→,idL/:T | T→integer/real Construct a translation scheme to enter the type of each identifier into the symbol table.

nt

(b) Explain the translator process using the following example id, id: real. [8+8]

5. (a) What are the applications of flow graph.

[6]

Aj

(b) Explain in detail the algorithm for eliminating global redundant sub expression in a given program. [10]

6. (a) Explain the reasons for separation of lexical analysis phase from syntax analysis phase. [6] (b) Write a recursive descent parser for the following grammar. E → E + T|T T → TF|F F → F∗ |a|b

[12]

7. (a) What are self-organizing lists. How this can be used to organize a symbol table. Explain with an example. [8] 1

Code No: NR-RR-320504

NR/RR

Set No. 2

(b) Explain the process of organizing a symbol table for a block structured language. [8] 8. Write short notes on: [8]

(b) type coercion with example

[8]

in

(a) type conversion with example

Aj

nt

uW

or

ld .

?????

2

Code No: NR-RR-320504

NR/RR

Set No. 4

1. (a) List out the data structure to perform Macro Expansion.

[8]

[8]

ld .

(b) Write an algorithm for Macro processing.

in

III B.Tech II Semester Supplementary Examinations,May 2010 LANGUAGE PROCESSORS Common to Information Technology, Computer Science And Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????

or

2. (a) Suppose the declaration are generated by the following grammer D→idL | L→,idL/:T | T→integer/real Construct a translation scheme to enter the type of each identifier into the symbol table. (b) Explain the translator process using the following example id, id: real. [8+8] 3. Write short notes on: (a) type conversion with example

uW

(b) type coercion with example

[8] [8]

4. (a) What are self-organizing lists. How this can be used to organize a symbol table. Explain with an example. [8] (b) Explain the process of organizing a symbol table for a block structured language. [8]

nt

5. (a) Explain the reasons for separation of lexical analysis phase from syntax analysis phase. [6]

Aj

(b) Write a recursive descent parser for the following grammar. E → E + T|T T → TF|F F → F∗ |a|b

6. (a) What are the applications of flow graph.

[12]

[6]

(b) Explain in detail the algorithm for eliminating global redundant sub expression in a given program. [10]

7. (a) What are the applications of DAG. Explain how the following expression can be converted in a DAG a+b*(a+b)+c+d [8] (b) Explain how loop invariant components can be eliminated. 3

[8]

Code No: NR-RR-320504

NR/RR

Set No. 4

8. (a) Write about lexical analyzer generator.

[7]

(b) Construct minimumstate DFAs for the following regular expressions. [3]

ii. (a+b)* a (a+b) (a+b)

[3]

in

i. (a+b)* a (a+b)

iii. (a/b)* a (a/b)(a/b)(a/b).

[3]

Aj

nt

uW

or

ld .

?????

4

Code No: NR-RR-320504

NR/RR

Set No. 1

1. (a) List out the data structure to perform Macro Expansion.

2. (a) What are the applications of flow graph.

[8]

[8]

ld .

(b) Write an algorithm for Macro processing.

in

III B.Tech II Semester Supplementary Examinations,May 2010 LANGUAGE PROCESSORS Common to Information Technology, Computer Science And Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????

[6]

(b) Explain in detail the algorithm for eliminating global redundant sub expression in a given program. [10]

or

3. (a) What are self-organizing lists. How this can be used to organize a symbol table. Explain with an example. [8] (b) Explain the process of organizing a symbol table for a block structured language. [8] 4. Write short notes on:

uW

(a) type conversion with example (b) type coercion with example

5. (a) Write about lexical analyzer generator.

[8] [8] [7]

(b) Construct minimumstate DFAs for the following regular expressions. [3]

ii. (a+b)* a (a+b) (a+b)

[3]

nt

i. (a+b)* a (a+b)

iii. (a/b)* a (a/b)(a/b)(a/b).

[3]

Aj

6. (a) Suppose the declaration are generated by the following grammer D→idL | L→,idL/:T | T→integer/real Construct a translation scheme to enter the type of each identifier into the symbol table. (b) Explain the translator process using the following example id, id: real. [8+8]

7. (a) What are the applications of DAG. Explain how the following expression can be converted in a DAG a+b*(a+b)+c+d [8] (b) Explain how loop invariant components can be eliminated. 5

[8]

Code No: NR-RR-320504

NR/RR

Set No. 1

8. (a) Explain the reasons for separation of lexical analysis phase from syntax analysis phase. [6] [12]

in

(b) Write a recursive descent parser for the following grammar. E → E + T|T T → TF|F F → F∗ |a|b

Aj

nt

uW

or

ld .

?????

6

Code No: NR-RR-320504

NR/RR

Set No. 3

in

III B.Tech II Semester Supplementary Examinations,May 2010 LANGUAGE PROCESSORS Common to Information Technology, Computer Science And Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????

ld .

1. (a) Suppose the declaration are generated by the following grammer D→idL | L→,idL/:T T→integer/real | Construct a translation scheme to enter the type of each identifier into the symbol table. (b) Explain the translator process using the following example id, id: real. [8+8]

[6]

or

2. (a) What are the applications of flow graph.

(b) Explain in detail the algorithm for eliminating global redundant sub expression in a given program. [10]

uW

3. (a) What are self-organizing lists. How this can be used to organize a symbol table. Explain with an example. [8] (b) Explain the process of organizing a symbol table for a block structured language. [8] 4. Write short notes on:

(a) type conversion with example

[8]

(b) type coercion with example

[8]

nt

5. (a) Write about lexical analyzer generator.

[7]

(b) Construct minimumstate DFAs for the following regular expressions. [3]

ii. (a+b)* a (a+b) (a+b)

[3]

Aj

i. (a+b)* a (a+b)

iii. (a/b)* a (a/b)(a/b)(a/b).

[3]

6. (a) What are the applications of DAG. Explain how the following expression can be converted in a DAG a+b*(a+b)+c+d [8] (b) Explain how loop invariant components can be eliminated.

7. (a) List out the data structure to perform Macro Expansion. (b) Write an algorithm for Macro processing. 7

[8] [8] [8]

Code No: NR-RR-320504

NR/RR

Set No. 3

8. (a) Explain the reasons for separation of lexical analysis phase from syntax analysis phase. [6] [12]

in

(b) Write a recursive descent parser for the following grammar. E → E + T|T T → TF|F F → F∗ |a|b

Aj

nt

uW

or

ld .

?????

8