CS606 Final Term Past Papers by Rana Abubakar Khan

Rana Abubakar Khan

If you want to learn computer programming then contact with me

JOIN FB GROUP FOR VU HELP

CS606 ///MARCH 3 2017

Q1. Identify, whether the following grammar is LR(1) or LL(1)?

S---Aca | Bcb A---c... B----c

Q2. How a fliw graph can be a Reducible Flow Graph?

Q3. What is LR(1) parsing and discuss main advantage?

Q4. Characteristics of Live variables?

Q5. Which information we get from 1st section of YACC File?

Q6. context free parsing context sensitive parsing?

7. Aik compiler se related tha
8. Traverse the following tree in Inorder. Or sath m tree be dia huwa th Same tree jo k Paper 2012 m 43 Q m ha

MERA AAJ (29-08-2016) KA PAPER.

Zyada mcqs past waly thy, moazz or Zain ki files me se.

Subject me se,

Q1. Discuss properties of reduce flow?

Name the IR closest to program code?

P --> RL(1), Suppose DFA recognize it?

why we break source code to machine language?

kuch code thy, mere waly to 5 marks waly 3 or 3 marks waly 2 code thy, jo me ne ni kiye.....

Is k ilawa kuch practice ha past papers ki jis me me ne Kuch question or un k answer search kiye thy.. Ho saqta ha apko is se faida ho jae...

Wo han,

My File:

SHAAN.

What does the compiler need to consider when applying optimization?

The compiler needs to minimize or maximize some attributes in an executeable program. It is better to minimize the time taken to execute the program. Also to minimize the occupied memory.

Define NFA?

Non finite autometa is autometa theory with finite states . It has an initial state and and trascition state. It is used to automate the things. It does not tell the exact location to which the machine is rotated. It can be converted to dfa.

In Main memory, what type of information is stored in data segement?

In memory the code generated by the intermediate Representation is stored. It include the source file, which contain the tokenized symbol, variable, objects and other parse data. This code is very near to the machine language.

Identify whether the grammer is LR(1) and LL(1)?

S-> Aa|Bb

A->c

B->c

The grammer is LR 1 grammer. It gives the output cach.

Characteristics of Live variables?

Live variable are the variable in an object that can be used for further use.

The characteristics of live variable are;

They help in calculation of each variable in the compiler.

Algorithm to generate LALR(1) DFA?

Answer: Algorithm to generate LALR1 DFA is below:

1. Repeat until all the states have distinct code.
2. Choose two distinct states with same core.