We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

CS606 ALL Current Final Term Papers Spring 2016 And Past Final Term Papers at One Place from 20 August 2016 to 2 September 2016

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 3062

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Attachments:

Replies to This Discussion

ALL Current Final Term Papers Spring 2016 And Past Final Term Papers at One Place from 20 August 2016 to 2 September 2016

 

Share Your Current Mid Term Papers (Questions/Pattern) 20 August 2016 to 02 September2016  to help each other. Thanks

 

Solved Mid Terms Papers By MOAAZ & Other Students

 

Click On the below link to download

 

Solved Final Term Papers

Slaam Friends.

Mera aaj (29-08-2016) ka paper.

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

Subject me se, 

1. 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?

Answer:

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.
  3. Merge these states by a new state having union of all items.
  4. New state points all previous states.

 

 

 

Which  information we get from 3rd section of YACC File?

Answer:

The first information we get about it’s definition

2nd   percentage. Rules percentage.

3rd c/C++ statements.

 

 

How can complier transformation improve program?

Answer:

Compiler transformation improves program, by reducing its unnecessary attributes. The main requirement of a program is to reduce the run time of program. Another less necessaaary is to occupy less memory on program. The garbage collection should work perfect way.

 

LL Parse table ?

 

 

 

 

 

INT and BOOl main sy bhi tha 5 marks ka ?

 

 

For each instruction, show which variable are live variable are live imidiately after instruction execution

(5marks)

1. A=7

2. B=A+2

3. C=A+B

4.D=C+B

5.B=C+B

 

Answer

 

Live {A}

 A=7

 Live {A}

 B=A+2

Live{A,B}

 C={A+B}

Live{C,B}

 D=C+B

 Live={C,B}

 B={C+B}

Live={ A,B,C}

 

 

tree was given and preorder was asked?

 


what is non determininstic fa?

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

 


productions were given and canonical collection set was asked to built using productions.

 

 


action table and goto table were given we were asked to show in stack and input buffer

when we use garbage collection for memory management?

Answer:

It is an automatic memory management tool. We use the garbage collection for memory management to reduce the extra memory occupied by the program at run time and the objects that are no longer exist in program. It allocate and deallocate the memory to a program.  


if on right hand side of production there are k symbols then how many positions are there for place holder?

Answer:

If the right hand side of production there are k symbols then the position on the placeholder will be k+1.


production was given to determine whether this is of LR(1) or LL(1) ?

 


code was given and we have to find basic blocks?

 


use of address descriptor in code generation algorithm of 5 marks

Register descriptor provides status (empty , in use ) or the content one or more registers in a program.

While address descriptor provides the specific address to where the current value can be find.

 

 

 

Third section of YACC represents what kind of information?

Answer:

Definitions
 %% rules %%
C/C++ functions

 


How inherited attribute are different synthesized with respect to grammar attribute?

Answer:

Inherited attributes are different then synthesized with respect to the following main reasons.

  1. On the base of direction of flow value.
  2. On the base of parsing tree. (Syn follows bottom up, while inherited follows top down parsing technique.)

 

 

 

(Attributes are distinguished based on the direction of value flow. Attributes of a node whose values are defined wholly in terms of attributes of node’s children and from constants are called synthesized attributes. Values used to compute synthesized attributes flow bottom-up in the parse tree. 

Attributes whose values are defined in terms of a node’s own attributes, node’s siblings and node’s parent are called inherited attributes. Values flow top-down and laterally in the parse tree. The following attributed tree shows the inherited and synthesized attributes for the input signed binary number -101.  )

 

 


how context free parsing is different from context sensitive parsing?

Answer:

 

 

Context Free parsing:

 

It is a formal parsing in which each context is in form of Vàw. Where V in a non terminal and w may be both non terminal and terminal, it’s value may be zero.

 

Context sensitive language is a formal context grammar in which each left hand side and right hand side of production rules is surrounded by the context in case of terminal and non-terminal. In

 

 

Brief note on Reducible Flow Graphs?

 

 

 


For each instruction, show which variable are live variable are live imidiately after instruction execution

 


what are basic operation of shift reduce parser to parser a CFG ? explpain activities how they performe?

Answer:

Shift moves ► one place to the right which shifts a terminal to the left string 

 E + (► int) ⇒ E + (int ►)

In the reduce action, the parser applies an inverse production at the right end of the left string. If E → E + (E) is a production, then 

  E + ( E+(E)►) ⇒ E + ( E ►) 

 

 

 

The basic operation of shift reduce parser in CFG are.

One symbol lookahead and indicates either the value should be shift or reduce. In case of shift a symbol pushes to the stack that is increased by one and lookahead for next symbol. It that symbol needed to reduce then the stack comes to its on position.


LL() table was give. show content of stack and input buffer for parse of string "ab"where s is start symbol?

 

This is just for your help in final exams.

Remember me in your prayers. 

Shaan. :)

Note: (This is Featured Discussion)

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.

&

.•°How to Download past papers from study groups°•.

Please share your current papers......

CS606 FinalTerm MCQs With Refrence Solved By Zain Nasar(Arslan Arshad)

Attachments:

share subjective paper

aoa 80% mcqs were past papers.
Q Which information we get from the second YACC file?
Q Which type of information is store in memory of code segment.
Q why bottom up parser called LR.
INVERSE POSTTREE.

kindly share your own papers of all subject

parisha bs thanks for sharing 

Attention Students: You don’t need to go any other site for current papers pattern & questions. Because all sharing data related to current Final term papers of our members are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links. Just keep visiting http://vustudents.ning.com/ for all latest updates.

kn say pass paper main sy ay a? 

my today papr at 11:00 AM

Third section of YACC represents what kind of information?
How inherited attribute are different synthesized with respect to grammar attribute?
how context free parsing is different from context sensitive parsing?
For each instruction, show which variable are live variable are live imidiately after instruction execution
what are basic operation of shift reduce parser to parser a CFG ? explpain activities how they performe?
LL() table was give. show content of stack and input buffer for parse of string "ab"where s is start symbol?

objective was conceptual.. some objective from moaz file.

BEST of luck :) :)

MCQs kis file se aye ty

RSS

© 2020   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.