VU Current Final Term Paper Semester Fall 2013 Total Questions = 52 Total Marks = 80 Total

VU Current Final Term Paper
Semester Fall 2013
Total Questions = 52
Total Marks = 80
Total 1 Mark MCQ = 40
Total 2 Marks Short Questions = 4
Total 3 Marks Short Questions = 4
Total 5 Marks Long Questions = 4

Questions of 2 Marks:
1-what is semantic actions?
2-Brief note on Reducible Flow Graphs
3-A Tree given, Traverse in Postorder
4-What is live variable
5- a code given, Subexpressions eliminate karna the.
Questions of 3 Marks:
1- Translate the following regular expression in simple words: r*
2- Write brief note on Labeling Algorithm
3- Role of Symbol Table
4- main Diff. Between Hopcroft’s Algorithm and Subset Construction Algorithm
Questions of 5 Marks:
1-What kind of data structure is used to represent Basic Blocks?
2-Discuss the issue of Target programs in Code Generation phase?
3- What is LR(K) parsing and discuss main advantage

VU Today's Final Term Paper For Fall 2013
Total Questions = 52 of Total 80 Marks
Total MCQ = 40 Each of 1 marks
Total Short Questions = 4 Each of 2 marks
Total Short Questions = 4 Each of 3 marks
Total Long Questions = 4 Each of 5 marks

Subjective Questions are:

1)S ->{SX} | a 2 Marks

X -> ε| + SY | Yb

Y -> ε| - SXc

Find Non-TerminalsandTerminals

2)why use common sub-expression. 2 Marks

3)Which Information we can get the second section of YACC file. 2 Marks

4)In main memory, what type of information store in data segment. 2 Marks

5)One Question conceptual about get rid. Microsoft use parsing technique and it hava face problem. we will help aboutalternative solution. e.t.c3 Marks

6)Whencompileruse stack forallocationat run time forstoringvariable. 3 Marks

7)Write Basic block 3-address code segment. 3 Marks

1) a = 1

2) b = 2

3) c = a + b

4) d = c - a

8)Difference between Attribute Grammer and Syntax directed translation. 3 Marks

9)Let CFG G= {Vn,Vt,S,P} where Marks 5

Vn = {<goal>, <expression>, <term>, <factor>}

Vt = {a,b,c,-,+}

S = {goal}

Define the production of G and drive the string a-b+c

10)One Question about Lable and Goto Simply describe about uses of those 2 control flow statement. Marks 5

11)DAG representation of Basic Block Marks 5

t1 := a + b

t2 := c + d

t3 := e - t2

t4 := t1 - t3

5 marks questions

1 register allocation using coloring problem

2Add semantic rules to the following grammar to compute the attribute rm, whose value is the rightmost
terminal in the string we parsed. For example, if the string parsed were zxyxy, S.rm would be y.
(5marks)

Mcqskuch past paper main se thy and mostly new book main se thy

Total question 52 thy 40 mcqs and 12 subjective questions thy

1.HowLex different from Flex? (2marks)

2.What are two properties to reducible flw graph? (2 marks)

3.What type of information stored in Lex/Flex input file? (2 marks)

4. Which information we get from the third YACC file? (3 marks)

5. write regular expression for the language of all words that starts and ends with different letters? (3marks)

6. when we use garbage collection with respect to memory management? (3marks)

7. consider the following grammar which generates expression by applying ‘’+’’ to integer and floating points constants. When two integers are added, the result integer otherwise it is a float (5 marks)

E(arrow)E +EIT

T(arrow)num.numInum.

8. Add semantic rules to the following grammar to complete the attributes ‘’rm’’ whose values is the right most terminal in the string we parsed (5marks)

S(arrow)A

{Srm=

A(arrow)A1xy

IBA1y

B(arrow)B1z

9. 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

10. How many place holder positions we can use if production has ‘’K’’ symbol at right hand side at the shift reduce parsing?

Or ek 2 or the yaadnai a rhe….
Best of luck for exams frnds……

CS606 Final term 2012 past pprshere ...!!!

Total Questions 52
Mcqs 40
Subjective 12
Question NO 41: Was a long statement 2 Marks
Question NO 42: Why we use live-variable? 2 Marks
Question NO 43: What are the common sub-expressions? 2 Marks
Question NO 44: What are the characteristics of live-variable? 2 Marks
Question NO 45: Relocation in compiler. 3 Marks
Question NO 46: Third section of YACC represents what kind of information? 3 Marks
Question NO 47: How inherited attribute are different synthezied with respect to grammar attribute? 3 Marks
Question NO 48: Why compiler uses multiple instruction representation? 3 Marks
Question NO 49: Consider grammar SàaSshow that grammar is ambiguous by using two parse tree for the same string. 5 Marks
Question NO 50: How we can implement Syntax directed translator using two pass? 5 Marks
Question NO 51: How register descriptor are used in code generation? 5 Marks
Question NO 52: was a long statement.5Marks
------
Questions of 2 Marks:
1-what is semantic actions?
2-Brief note on Reducible Flow Graphs
3-A Tree given, Traverse in Postorder
4-What is live variable
5- a code given, Subexpressions eliminate karna the.
Questions of 3 Marks:
1- Translate the following regular expression in simple words: r*
2- Write brief note on Labeling Algorithm
3- Role of Symbol Table
4- main Diff. Between Hopcroft’s Algorithm and Subset Construction Algorithm
Questions of 5 Marks:
1-What kind of data structure is used to represent Basic Blocks?
2-Discuss the issue of Target programs in Code Generation phase?
3- What is LR(K) parsing and discuss main advantage
------
- Phases of front end of compiler.
2 - why we use live variable analysis.
3 - Differentiate attribute grammar and syntax-directed grammar.
3 - why compilers use multiple IR.
3 - from given CFG generate string aa+a*
S->SS+ | SS* | a
5 - S->XX
X->XXX | bX | Xb | a
draw parse tree for string bbaaaab
the questions i forget was from attribute grammar and syntax directed and it related topics.
3 - some thing was like write example of attribute grammar.
5 - example of syntax directed ...

Today Final Term Paper Fall 2012

On 21 Feb 2013

Total Questions: 52

Total Marks: 80

Total MCQs: 40 (Each of 1 Mark)

Total Short Questions: 4 (Each of 2 Mark)

Total Short Questions: 4 (Each of 3 Mark)

Total Long Questions: 4 (Each of 5 Mark)

Questions of 3 Marks:
1- Translate the following regular expression in simple words: r*
2- Write brief note on Labeling Algorithm
3- Role of Symbol Table
4- main Diff. Between Hopcroft’s Algorithm and Subset Construction Algorithm

Questions of 5 Marks:
1-What kind of data structure is used to represent Basic Blocks?
2-Discuss the issue of Target programs in Code Generation phase?
3- What is LR(K) parsing and discuss main advantage

my today's paper of cs606 24 feb 2013:
most of the mcqs where from shining star file,
Q: Which information we get from the third YACC file?
Q: Which information we get from the second YACC file?
Q: which algorithm is used to minimize DFA...
Q: ek code statement thibtanatha k LR (1) haiya LL (1)
Q: long qstha what is de-allocation and what issue we can have in this phase explain your answer with reason?
Q: What are the common sub-expressions?
Q: How inherited attribute are different synthezied with respect to grammar attribute?
Q: 4 regular expressions diye the like
a. ab* and 3 or the andqstha k name the string which is used in all of the following grammar.
Q: ek or qstha E wale questions me the E=odd? Btanatha
Orek 2 or the yaadnai a rhe….
Best of luck for exams frnds……
------
Mcqskuch past paper main se thy and mostly new book main se thy
Total question 52 thy 40 mcqs and 12 subjective questions thy
1.How Lex different from Flex? (2marks)
2.What are two properties to reducible flw graph? (2 marks)
3.What type of information stored in Lex/Flex input file? (2 marks)
4. Which information we get from the third YACC file? (3 marks)
5. write regular expression for the language of all words that starts and ends with different letters? (3marks)
6. when we use garbage collection with respect to memory management? (3marks)
7. consider the following grammar which generates expression by applying ‘’+’’ to integer and floating points constants. When two integers are added, the result integer otherwise it is a float (5 marks)
E(arrow)E +EIT
T(arrow)num.numInum.
8. Add semantic rules to the following grammar to complete the attributes ‘’rm’’ whose values is the right most terminal in the string we parsed (5marks)
S(arrow)A
{Srm=
A(arrow)A1xy
IBA1y
B(arrow)B1z
Ix
9. 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
10. How many place holder positions we can use if production has ‘’K’’ symbol at right hand side at the shift reduce parsing?

Old papers Questions...

1. Difference b/w the l-values and r- values
2. Short not on common sub expressions
3. What is the live variable analysis
4. In main memory what type of information is stored
5. What does the compiler consider when apply the optimizations
6. Write the 3 examples of function present transformations
7. Discuss briefly the 1st section of Ycc
8. Eliminate the common sub expressions, 1) A=6(A+B) 2) D=3+7(B+C) 3)A*(B+C)
9. Give the brief description about symbol table
10. Fine the algorithm to DFA on LALR (1)
11. What is the importance of symbol table
12. Make the 3 adress code of given grammer by rules that are given (from old papers
13. Aik table tha match karnatha

definetehgrammer attribute?
define the inherited attribut and synthesized attribute?
write the grammer of inherited and systheized attribute?
where the data is located in the maemory?
what is the role of run time system?
is the dfa recognize teh set of languages?
what is teh purpose of optimization ?
aik tree diatha and said convert it into the inorder?
define about the lexical anayzer of flex?
2nd paper
what is peephole optimization
call by reference
difference b/w attribute grammer and syntax directed translation
what type of information is stored in main memory at data segment
write in simple word some detail of r* where r is regular expression
(CS606rock and cS606ANTLER)ais ka regular expression likhnathaaurbhikuch data diyahowatha but mjysamghnaiaya
different method of attribute grammereveluation method
what is the purpose of front end
itny question he yaadhain

Difference b/w the l-values and r- values
2. Short not on common sub expressions
3. What is the live variable analysis
4. In main memory what type of information is stored
5. What does the compiler consider when apply the optimizations
6. Write the 3 examples of function present transformations
7. Discuss briefly the 1st section of Ycc
8. Eliminate the common sub expressions, 1) A=6(A+B) 2) D=3+7(B+C) 3)A*(B+C)
9. Give the brief description about symbol table
10. Fine the algorithm to DFA on LALR (1)
11. What is the importance of symbol table
12. Make the 3 adress code of given grammer by rules that are given (from old papers
13. Aik table tha match karnatha
40 MCQs and 13 questions
2nd paper
2 pass compiler 3 marks
5 marks making parsing table
5 marks 3 address instructions
regular expressions 3 marks

CS606 paper 25-07-2011
Questions of 2 Marks:
1-what is semantic actions?
2-Brief note on Reducible Flow Graphs
3-A Tree given, Traverse in Postorder
4-What is live variable
5- a code given, Subexpressions eliminate karna the.
Questions of 3 Marks:
1- Translate the following regular expression in simple words: r*
2- Write brief note on Labeling Algorithm
3- Role of Symbol Table
4- main Diff. Between Hopcroft's Algorithm and Subset Construction Algorithm
Questions of 5 Marks:
1-What kind of data structure is used to represent Basic Blocks?
2-Discuss the issue of Target programs in Code Generation phase?
3- What is LR(K) parsing and discuss main advantage.
1. Difference b/w the l-values and r- values
2. Short not on common sub expressions
3. What is the live variable analysis
4. In main memory what type of information is stored
5. What does the compiler consider when apply the optimizations
6. Write the 3 examples of function present transformations
7. Discuss briefly the 1st section of Ycc
8. Eliminate the common sub expressions, 1) A=6(A+B) 2) D=3+7(B+C) 3)A*(B+C)
9. Give the brief description about symbol table
10. Fine the algorithm to DFA on LALR (1)
11. What is the importance of symbol table
12. Make the 3 adress code of given grammer by rules that are given (from old papers
13. Aik table tha match karnatha\