Scribd
Upload
7 views

hiooooooooooooo

The document contains a comprehensive set of questions related to compiler design, language processing, and software concepts. It covers topics such as the stages of a source program's life cycle, definitions of key terms, differences between system and application software, and various data structures. Additionally, it includes questions on assemblers, macro processors, loaders, and grammar analysis, aimed at assessing knowledge in computer science and programming languages.

Uploaded by

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

hiooooooooooooo

The document contains a comprehensive set of questions related to compiler design, language processing, and software concepts. It covers topics such as the stages of a source program's life cycle, definitions of key terms, differences between system and application software, and various data structures. Additionally, it includes questions on assemblers, macro processors, loaders, and grammar analysis, aimed at assessing knowledge in computer science and programming languages.

Uploaded by

mambaraval
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

SS GTU QUESTIONS

1 Explain the various stages of life cycle of a source program with neat diagram.

2 Define the following term.


Compiler
Interpreter
Assembler
Macro
Linker
Loader
System software.

3 What is the difference between System Software and application software.

4 Define Language processing.


List various phases of language processor and explain each phase in detail.

5 Define following term.


Semantic Gap
Execution Gap

6 What is semantic expansion? Explain the cause of large semantic gap.

7 Difference between procedure oriented language and problem oriented language.

8 Describe following data structures: OPTAB, SYMTAB, LITTAB and POOLTAB.

9
Differentiate one pass and two pass assembler. Explain how
forward references are handled in two pass assembler.

10 Explain advanced assembler directives with suitable example.

11 Given the source program:


START 100
A DS 3
L1 MOVER AREG, B
ADD AREG, C
MOVEM AREG, D
D EQU A+1
L2 PRINT D
ORIGIN A-1
C DC ‘5’
ORIGIN L2+1
STOP
B DC ‘19’
END L1
a) Show the contents of the symbol table at the end of Pass I.
b) Explain the significance of EQU and ORIGIN statement in the program and explain how
they are processed by the assembler.
c) Show the intermediate code generated for the program.

12 Differentiate one pass and two pass assembler.

13 Explain forward reference with suitable examples .How to solve it using back -
patching?
14 What is interpreter? Explain benefits of interpreter. Compare interpreter and compiler.

15 Explain classification of debuggers.

16 Explain JVM in detail.

17. What is a macro? Explain recursive macro with example.


18. Explain macro definition and call in detail. Explain the use of expansion time loop.

19. What is a macro preprocessor? List out advantages and disadvantages of macro.
20 Draw a flowchart and explain a simple one pass macroprocessor.
21 Explain design of macro preprocessor.
Define a Macro taking A and B as parameters to compute A=A*B+B*B+A*B.

22 What is the difference between Keyword parameters and positional parameters?

23 Explain lexical and semantic expansion of macro with example.

24 Explain Compile-and-Go loaders with example.


List out advantages of Relocating loader.
25 What is program relocation? How relocation is performed by linker? Explain with example.

26 Explain brief design of absolute loader with suitable example.

27 Differentiate Absolute loader and Direct linking loader.


28 Explain Self relocating program and overlay structure program.

29 Write and explain an algorithm for first pass of a linker.

30 1)Find First and Follow Set from following grammar


S-> Aa|bAc|Bc|bBa
A-> d
B-> d
2)Check grammar is LL(1) or not?
Find First and Follow Set from following grammar
S-> AaAb|BbBa
A-> €
B-> €
Check grammar is LL(1) or not?
31 Define Simple Phrase and Handle. Using Handle and Simple Phrase trace the bottom up
parsing algorithm.
Grammar is :
E →T+ E | T – E | T
T → T *V | T / V | V
V→a | b | c | d
String is : a - b * c + d

32 Explain use of AIF and AGO with example.

33 Define following terms:


1)START 2)END 3)BYTE 4)WORD
34 Explain REPT and IRP statement with proper example.

35 Given following expression: x = -a * b + -a * b


(1) Write three address codes for the expression.
(2) Give triple implementation for the three-address code of the expression.

36 Construct optimized DFA for following Regular Expression.


(1*)*0(0|1)*#

37 Write Quadruple,Triples and Indirect Triples for expression, x=


-a*b+ -a*b
38 Explain types of grammar. Explain Ambiguous grammar with any suitable example.
39 Explain any three Code Optimization Techniques.Discuss the limitations of stack
based memory allocation.

40 Write a regular expression for a language containing both 11 and 00 as substring

Prof. Dr. Dushyantsinh Rathod


SUBJECT COORDINATOR HOD CE

You might also like