Scribd
Upload
3 views9 pages

SPCC Questions

The document outlines various topics related to software and programming, including comparisons between application and system software, system programming, and types of assembly language statements. It also covers concepts related to macro processors, loaders, code optimization techniques, and compiler phases, providing examples and flowcharts where applicable. Additionally, it includes exercises on parsing, intermediate code representation, and attributes in syntax analysis.

Uploaded by

sukhdeepsingh.badshani.st
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views9 pages

SPCC Questions

The document outlines various topics related to software and programming, including comparisons between application and system software, system programming, and types of assembly language statements. It also covers concepts related to macro processors, loaders, code optimization techniques, and compiler phases, providing examples and flowcharts where applicable. Additionally, it includes exercises on parsing, intermediate code representation, and attributes in syntax analysis.

Uploaded by

sukhdeepsingh.badshani.st
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Chap 1

1. Compare Application Software and System Software. – 1


Difference between Application software and System software - 1
Differentiate between Application and System Software. - 1

2. Define "System Programming". Differentiate software & application software. Between


system – 1

3. Compare between Compiler and Interpreter. – 1


4. Exaplain in detail Device Drivers , Debugger , OS - 1
5.

Chap 2

6. State and explain the types of assembly language statements with examples. – 2
State and explain with examples, different types of statements used in assemblers with
respect to system programming. – 2

7. Explain forward reference concept with example. – 2/3


8. Explain in brief "forward reference problem". handles forward reference problem in single
pass Explain how TII assembler. - 2

9. Explain with flowchart design of two pass assembler. – 2


Draw a neat flowchart of pass-1 of two pass assembler design – 2
Explain with flowchart design of two pass assembler. - 2
Draw the flowchart of pass 1 of assembler and explain its working with the databases. - 2
Draw and explain the flowchart of Pass 1 of two pass assembler with suitable example. - 2

Chap 3

10. Explain conditional macro with suitable example. - 3


Explain MACRO and MACRO Expansion with example. - 3

11. Explain the working of a Single-pass macro processor with neat flowchart. – 3
Explain the working of a Single-pass macro processor with neat flowchart. - 3
Explain with help of a flowchart, the first pass of two-pass macro processor. – 3
Draw a neat flowchart of two pass macro processor. Explain with the help of example - 3

12. Explain advanced macro facilities with suitable examples. – 3


Short note on Macro facilities – 3
Explain different features of macros with suitable example. - 3

Chap 4

13. Explain the functions of a Loader. – 4


What are the functions of Loader? – 4
What are the functions of a Loader? Enlist the loader schemes. – 4

14. Explain absolute loader. State its advantages and disadvantages. - 4

15. Explain Direct Linking Loader in Detail. – 4


Explain Direct Linking Loader in suitable example. – 4
Explain Direct Linking Loader in Detail. – 4
Explain the design of direct linking loader. - 4
Discuss the databases used in direct linking loader. – 4

16. Explain Dynamic Linking Loader in Detail. – 4

17. What is relocation and linking concept in Loaders – 4

18. Compare Dynamic loading and Dynamic linking with example - 4

Module 5 and 6

1. Construct operator precedence Parser for the grammar: -2


E→E+E | E * E |a.
Parse the string "a+a*a" using the same parser.
2. Construct Three address code for the following program - 4
i = 1;
x = 0;
while(i<=n){
x = x + 1;
i = i + 1;
}
3. Design LL(1) parsing table for the given grammar: - 2
S->iCtSE|a
E->eS|e
C -> b
Also state that whether the given grammar is LL(1) or not.
4. Explain with suitable example code optimization techniques. - 5
5. Explain different issues in code generation phase of compiler. - 6
6. Explain DAG with suitable example. - 4
7. Explain the different phases of a compiler with suitable example. - 1
8. Compute FIRST and FOLLOW for the following gran - 1
S->Aa
A->BD
B->b|e
D->d|e
9. What are different ways of intermediate code representation? Explain with example. – 4
10. B – 2

11. A – 4
B-1
12. Explain different Code Optimization Techniques in detail. - 5
13. What is three-address code? Generate three-address code for - 4
while (a<b) do

if(c<d) then

x:=y+z

else

x:y-z

14. Construct SLR parser for the following grammar and parse the input - 2
"()()": S->(S)S|e.

15. Explain the concept of basic blocks and flow graph with example the three-address code. - 6
16. Explain the phases of a compiler. Discuss the action taken in various phases to compile the
statement: - 1
a=b*c+10, where a,b,c are of type real
17. B. Write short note on:
18. Syntax-directed Translation, - 3
19. What is code optimization? Explain with example, the following code optimization
techniques: - 5
(i) Common sub-expression elimination
(ii) Code motion
(iii) Dead code elimination
(iv)Constant propagation
20. Test whether following grammar is LL(1) or not. If it is LL(1), construct parsing table for same:
-2
S->1AB|e
A->1AC|0C
B->0S
C->1
21. Compare Bottom-Up and Top-Down Parser. - 2
22. Construct Three address code for the following program - 4
23. For(i=0;i<10;i++)
{
If (5)
a-b+c*3;
else
xy+z;
}
24. Design LL(1) parsing table for the given grammar: - 2
S->Ad
A->aB|BC
B->b
C->e|Epsilon
Also state that whether iven grammar is LL(1) or not.
25. What are the different ways of representing Intermediate code? - 4
Explain with suitable example.
26. Explain different issues in code generation phase of compiler. - 6
27. Construct DAG for the following expression - 2
x=m+p/q-t+p/q*y

28. Explain the different phases of a compiler with suitable example. - 1


29. Write a short note on Peephole Optimization. – 5 (concept of code optimization and code
generation)
30. Explain the different phases of compiler with suitable example? - 1
31. What are the different ways of representing Intermediate code? Explain with example - 4
32. Compare Pattern, Lexeme and token with example – 4

33. B – 5
C-2
1. Construct operator precedence Parser for the grammar: -2
E→E+E | E * E |a.
Parse the string "a+a*a" using the same parser.
2. Construct Three address code for the following program - 4
i = 1;
x = 0;
while(i<=n){
x = x + 1;
i = i + 1;
}
3. Design LL(1) parsing table for the given grammar: - 2
S->iCtSE|a
E->eS|e
C -> b
Also state that whether the given grammar is LL(1) or not.
4. Explain with suitable example code optimization techniques. - 5
5. Explain different issues in code generation phase of compiler. - 6
6. Explain DAG with suitable example. - 4
7. Explain the different phases of a compiler with suitable example. - 1
8. Compute FIRST and FOLLOW for the following gran - 1
S->Aa First(s) = {b,d,a} Follow(S) = {$}
A->BD First(s) = {b,d,e} Follow(A) = {a}
B->b|e First(s) = {b,e} Follow(B) = {d,a}
D->d|e First(s) = {d,e} Follow(D) = {a}
9. What are different ways of intermediate code representation? Explain with example. – 4

10. B – 2
11. A – 4
B-1
12. Explain different Code Optimization Techniques in detail. - 5
13. What is three-address code? Generate three-address code for - 4
while (a<b) do

if(c<d) then

x:=y+z

else

x:y-z

14. Construct SLR parser for the following grammar and parse the input - 2
"()()": S->(S)S|e.

15. Explain the concept of basic blocks and flow graph with example the three-address code. -
6
16. Explain the phases of a compiler. Discuss the action taken in various phases to compile the
statement: - 1
a=b*c+10, where a,b,c are of type real
17. Write short note on:
18. Syntax-directed Translation, - 3
19. What is code optimization? Explain with example, the following code optimization
techniques: - 5
(i) Common sub-expression elimination
(ii) Code motion
(iii) Dead code elimination
(iv)Constant propagation
20. Test whether following grammar is LL(1) or not. If it is LL(1), construct parsing table for
same: - 2
S->1AB|e
A->1AC|0C
B->0S
C->1
21. Compare Bottom-Up and Top-Down Parser. - 2
22. Construct Three address code for the following program - 4
23. For(i=0;i<10;i++)
{
If (5)
a-b+c*3;
else
xy+z;
}
24. Design LL(1) parsing table for the given grammar: - 2
S->Ad
A->aB|BC
B->b
C->e|Epsilon
Also state that whether iven grammar is LL(1) or not.
25. What are the different ways of representing Intermediate code? - 4
Explain with suitable example.
26. Explain different issues in code generation phase of compiler. - 6
27. Construct DAG for the following expression - 2
x=m+p/q-t+p/q*y

28. Explain the different phases of a compiler with suitable example. - 1


29. Write a short note on Peephole Optimization. – 5 (concept of code optimization and code
generation)
30. What are the different ways of representing Intermediate code? Explain with example - 4
31. Compare Pattern, Lexeme and token with example – 4

32. B – 5
C–2
33. Explain the role of: Finite Automata in Lexical Analysis, Context Free Grammar in Syntax
Analysis
34. Write short note on the following: LEX, Data Structure used in Lexical Analysis
35. Explain synthesized and inherited attributes with example.
36. Compare S-attribute and L-attribute

You might also like