Scribd
Upload
60 views2 pages

CS2006 2 Sem

This document appears to be an exam for a System Programming course, containing multiple choice and long answer questions. The questions cover topics like: 1) The purpose and components of a symbol table in an assembler 2) The process of macro expansion 3) The differences between Non-deterministic Finite Automata and Deterministic Finite Automata 4) How to construct an SLR parsing table and perform parsing actions 5) Implementing three-address code and code optimization techniques like common subexpression elimination.

Uploaded by

Aditya Biswas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views2 pages

CS2006 2 Sem

This document appears to be an exam for a System Programming course, containing multiple choice and long answer questions. The questions cover topics like: 1) The purpose and components of a symbol table in an assembler 2) The process of macro expansion 3) The differences between Non-deterministic Finite Automata and Deterministic Finite Automata 4) How to construct an SLR parsing table and perform parsing actions 5) Implementing three-address code and code optimization techniques like common subexpression elimination.

Uploaded by

Aditya Biswas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Reg. No.

M. Tech. DEGREE EXAMINATION, MAY 2017


Second Semester

CS2OO6 _ SYSTEM PROGRAMMING


(For the candidates admined during the academic year 201 5-2016 onwards)

Time: Three Hours Max. Marks: 100

Answer ALL Questions


PART-A(f0 x2=20 Marks)
1. What is the need of SYMTAB in assembler?
2. Depict diagrammatically how a language is processed.
3. Mention the task involved in macro expansion.
4. Define: Absolute loader.
5. Compare NFA and DFA,
6. Write the components of context free grammar.
7. List the properties of an operator Grammar.
8. What are the problems with top down parsing?
9. Write the three address code and post fix notation for the
expression a * -(b+c).
10. What optimization can you prcpose for the following
code.
a:b*c
x:b*c+5

. Page I of 3 23MF'2CS2006
PART-B(5x16=80Marks)
11.a. Write the functions performed in Pass I and Pass II of a
b. Construct SLR parsing table lbr the following grarnmar,
two pass assembler. Explain pass II of two pass assembler
,S -+ CC
with an example,
C-+cC
(oR) C-+d
b. Write short notes on : and show the parsing action for the string cdcd.
(i) Search Data Structure
(iD Assemblerdirectives 15. a, What is three address code? Mention its types? How
would you implement thee address statements? Explain
12. a. Explain in detail about the data structure used for design with suitable example.
of a macro preprocessor,
(oR)
(oR) b.i. Discuss the various issues in the design of code generator
b.i. Compare Linking Loader and Linkage editor. with example. (12 Marks)

ii. Explain program relocation concept with suitable example. 11. Define: Common sub expression elimination and dead
code elimination with example. (4 Marks)
13. a. How would you get a DFA from a regular expression?
Obtain DFA for the regular €xpression. **r.'1.
(%)(%)(%)
(oR)
b, Discuss in detail about the analysis and synthesis stages of
a compiler with suitable example.

14. a. Define: First and follow. Conshuct the predictive parser


for the grammar,
s-rltl(r), 7-+7,,91s and show the behavior of the
parser for the input string (a, (a, a)).

(oR)
Page 2 of3 23MF2CS2006 Page 3 of3 23M!2CS2006

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy