New Member FAQ | Forums | Earn Revenue


Resources Entrance Ask Experts Exam Papers Jobs English Projects Universities Colleges Courses Schools Training My India



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

website counter



Download Model question papers & previous years question papers

Posted Date: 10 Dec 2008      Posted By: ayyappan      Member Level: Silver

2008 Barathidasan University M.C.A Computer Aplications COMPILER DESIGN Question paper



Course: M.C.A Computer Aplications   University: Barathidasan University




M.C.A DEGREE EXAMINATION, NOVEMBER 2008.

COMPLIER DESIGN
Time:Three Hours Maximum:75 marks

PART A-(10*2=20)
Answer All questions.

1.Define the role of input buffer in lexical analysis

2.Write regular expression to generate identifiers give examples.

3.Define the elements of production.Give examples.

4.Construct of a parse tree to the string-(id+id) using left most derivation.

5.Write the function of syntax directed translation.

6.Write three address code to the statement A=-B*(C+D).

7.Explain the advantage of indirection in symbol table.

8.Write postfix expression to-B+C*P|E

9.List the criteria to the selection of optimizing transformations.

10.Define induction variable.Give examples.

PART B-(5*5=25)
Answer All The question.

11.(a) Draw transition diagrams to floating point numbers.
Or

(b)Write procedure for the construction of NFA from a regular expression

12.(a) Explain top-down parsing.Give example.

(b) Discuss the action of operator-precedence parser to the input id+id.

13.(a)Write semantic actions to the set of procedure.
S->E$
E ->E+E
E->E+E
E->(E)
E->I
I->I digit
I->digit.
Or
(b)Distinguish between parse tree and syntax

14.(a) Explain the reusability concept of symbol table space.
Or
(b)Explain the formate of activation record.

15.(a)Discuss brief lexical phase error.
Or
(b)What do you mean by code motion?Explain.

PART C-(3*10=30)
Answer Any THREE question.

16.Discuss neatly the language for specifying lexical analyzers.

17.Explain the principle of predictive parser.Give an example.

18.Discuss code optimization in detail.

19.Write notes on implementing block structured language.

20What is basis block?Explain the role of flow graph in basis blocks








Return to question paper search

Next Question Paper: University of Madras Examination

Previous Question Paper: Probationary Officers Exam., 2008 - Vijaya Bank ( General Awareness on Socio-Economic Developments)

Related Question Papers:


  • Management of banks and financial institutions


  • COBOL PROGRAMING


  • Geography GEOMORPHOLOGY


  • FABRIC STRUCTURE AND DESIGNING


  • computer graphics


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.



    Advertise Here





    Contact Us   Advertise   Editors    Privacy Policy    Terms Of Use   

    ISC Technologies.
    2006 - 2009 All Rights Reserved.