Trending ▼   ResFinder  

PUNJAB TECHNICAL UNIVERSITY MCA - III (SEM 5) SEP 2010 : Compiler Design

2 pages, 28 questions, 0 questions with responses, 0 total responses,    0    0
mca_india
   		+Fave Message
ProfileTimelineUploadsQ & A
 Home > mca_india >

Formatting page ...

Roll No. ...................... Total No. of Questions : 13] [Total No. of Pages : 02 Paper ID [A0529] (Please fill this Paper ID in OMR Sheet) MCA (503B) (S05) (LE) (Sem. - 5th) COMPILER DESIGN Time : 03 Hours Maximum Marks : 75 Instruction to Candidates: 1) Section - A is Compulsory. 2) Attempt any Nine questions from Section - B. Section - A Q1) (15 2 = 30) a) What are advantages and disadvantages of LR parser? b) What is Lexical Analysis? c) What is recursive descent parsing? d) Why type checking is performed? e) How is a DFA different from a NFA? f) What is a Context Free Grammar? g) What do you mean by register allocation? h) What is the importance of operator precedence? i) What is an activation tree? j) What is a synthesized attribute? k) How are context free grammars different from regular expressions? l) What are L-attributed definitions? m) What are syntax trees? n) o) A-544 List various compiler tools. What are S-attributed definitions? P.T.O. Section - B (9 5 = 45) Q2) Discuss the steps that a compiler takes to process a program. Q3) Discuss analysis-synthesis model of compilation. Explain the difficulties in lexical analysis. Q4) Construct the parse tree for the sentence: not (true or false) by applying both top-down and bottom-up parsing. Also show their implementation details. Grammar is as follows : Bexpr -> bexpr or bterm | bterm Bterm -> bterm and bfactor | bfactor Bfactor -> not bfactor | (bexpr) | true | false Q5) How a parser generator can be used to facilitate the construction of the front end of a compiler? Q6) Define LR grammar. Discuss canonical LR parsing tables and LALR parsing tables. Q7) Explain the effect of applying grammar transformation on the semantic actions of that grammar. Give suitable examples. Q8) (a) What are the methods to evaluate semantic rules? Discuss. (b) What is an annotated parse tree? Construct an annotated parse tree for the expression 2 * 7 + 5n? Q9) What do you mean by code generation? Discuss in detail various problems in code generation. Q10) Write quadruples, triples and indirect triples for the expression : - (( A / B ) + B ) * ( C + ( D * E )) (A + B + C) Q11) Discuss the construction of DAG of a given basic block. What are the applications of DAG? Discuss. Q12) Explain the modules to show the following : (a) Top-down evaluation of S-attributed definitions. (b) Predictive parsing of inherited attributes. Q13) What is a directed acyclic graph? Discuss the procedure for constructing a directed acyclic graph. kbkb A-544 2

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

Additional Info : Mca - III (sem 5) September 2010 Question Paper - Compiler Design
Tags : mca exam papers, mca question papers, ignou mca question papers, ptu mca question papers, mca sample question paper, mca mumbai university question papers, mca exam syllabus, mca exam question paper, online mca exam papers, online mca exam preparation, mumbai university mca question papers, ignou university mca question papers  


© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

mca_india chat