Exam Details
| Subject | compiler construction (paper – iv) | |
| Paper | ||
| Exam / Course | b.sc. – i (ecs) | |
| Department | ||
| Organization | solapur university | |
| Position | ||
| Exam Date | November, 2018 | |
| City, State | maharashtra, solapur |
Question Paper
B.Sc. III (Semester VI) (CGPA) Examination, 2018
COMPILER CONSTRUCTION (Paper IV)
Day and Date Thursday 1-11-2018 Max. Marks 70
Time 10.30 a.m. to 1.00 p.m.
Instructions All questions are compulsory.
Figures to the right place indicate full marks.
1. Choose the correct alternative 14
The source program into a sequence of atomic unit called
Identifier Token
Keywords None
A reads the input one character at a time.
Lexical analyzer Parser
Symbol table None
A describes the hierarchical structure of programs.
Lexical analyzer Syntax tree
Grammar None
are data structures that hold information about
identifiers.
Tokens Parser
Lexical Analyzer None
The set of words or strings of characters that match a given pattern is called a
Language Lexeme
Regular definition None
A takes as input tokens from the lexical analyzer.
Parser Syntax directed translation
Code generation None
A attribute at a parse tree node is computed from attributes
at its children.
Inherited Synthesized
Both None
Procedure calls and returns are usually managed by a run time stack called
the
Heap Stack Allocation
Control Stack None
is the final phase of a compiler.
Code generation Run time
Both None
10) A is a graphical representation of a program in which the
nodes of the graph are basic block and edges show flow.
Flow graph Loop
DAG None
11) Three address code is sequence of statements of Z op Y.
True False
12) Code generator is not phase of compiler.
True False
13) By value is one type of parameter passing technique.
True False
14) Retract( used to retract lookahead pointer one character.
True False
2. Attempt any seven of the following 14
What is Intermediate code generation
Explain regular definitions.
Consider CFG given below.
S → aAb
A → aA|Bb
B → b
Solve input "aabbb" using Handle of shift reduce parser.
What is L-attributed definition
Explain Stack Allocation.
What is the definition of Backpatching
Explain flow graph.
What is copy propagation
Explain left recursive.
3. Attempt any two of the following 10
Explain Predictive parser. Construct the following grammar.
S → AB|
A → aAB|
B → bA
Write a note on Parameter passing.
Explain loops in flow graph with example.
Explain Input Buffering. 4
4. Attempt any two of the following 14
Explain phases of a compiler.
Write a note on source language issues.
Design and implementation of lexical analyzer explain with suitable
example.
5. Attempt any two of the following 14
Explain Run time storage management.
What is Bottom-up parser How to implement shift reduce parser Solve
the given example using Handle pruning.
S → xPy
P → xP|Qy
Q → y
Explain construction of Syntax tree with example.
COMPILER CONSTRUCTION (Paper IV)
Day and Date Thursday 1-11-2018 Max. Marks 70
Time 10.30 a.m. to 1.00 p.m.
Instructions All questions are compulsory.
Figures to the right place indicate full marks.
1. Choose the correct alternative 14
The source program into a sequence of atomic unit called
Identifier Token
Keywords None
A reads the input one character at a time.
Lexical analyzer Parser
Symbol table None
A describes the hierarchical structure of programs.
Lexical analyzer Syntax tree
Grammar None
are data structures that hold information about
identifiers.
Tokens Parser
Lexical Analyzer None
The set of words or strings of characters that match a given pattern is called a
Language Lexeme
Regular definition None
A takes as input tokens from the lexical analyzer.
Parser Syntax directed translation
Code generation None
A attribute at a parse tree node is computed from attributes
at its children.
Inherited Synthesized
Both None
Procedure calls and returns are usually managed by a run time stack called
the
Heap Stack Allocation
Control Stack None
is the final phase of a compiler.
Code generation Run time
Both None
10) A is a graphical representation of a program in which the
nodes of the graph are basic block and edges show flow.
Flow graph Loop
DAG None
11) Three address code is sequence of statements of Z op Y.
True False
12) Code generator is not phase of compiler.
True False
13) By value is one type of parameter passing technique.
True False
14) Retract( used to retract lookahead pointer one character.
True False
2. Attempt any seven of the following 14
What is Intermediate code generation
Explain regular definitions.
Consider CFG given below.
S → aAb
A → aA|Bb
B → b
Solve input "aabbb" using Handle of shift reduce parser.
What is L-attributed definition
Explain Stack Allocation.
What is the definition of Backpatching
Explain flow graph.
What is copy propagation
Explain left recursive.
3. Attempt any two of the following 10
Explain Predictive parser. Construct the following grammar.
S → AB|
A → aAB|
B → bA
Write a note on Parameter passing.
Explain loops in flow graph with example.
Explain Input Buffering. 4
4. Attempt any two of the following 14
Explain phases of a compiler.
Write a note on source language issues.
Design and implementation of lexical analyzer explain with suitable
example.
5. Attempt any two of the following 14
Explain Run time storage management.
What is Bottom-up parser How to implement shift reduce parser Solve
the given example using Handle pruning.
S → xPy
P → xP|Qy
Q → y
Explain construction of Syntax tree with example.
Other Question Papers
Subjects
- advanced java (paper – iii)
- advanced microprocessor
- compiler construction (paper – iv)
- computer graphics
- core java (old cgpa) (paper – iii)
- data communication and networking – i
- data communication and networking – ii (paper – i)
- data communications and networking – i (paper – i)
- data structures (paper – iv)
- data structures algorithms enginering – ii
- database management system – i (paper – ii)
- database management system – ii (paper – ii)
- dbms using oracle
- descriptive statistics – i
- descriptive statistics – ii
- digital electronics – i
- digital electronics and microprocesor – ii
- discrete structure
- embedded system – i
- embedded system – ii (paper – v)
- english (compulsory) (new) (cbcs)
- fundamental of computer
- golden petals
- introduction to programming using c – ii (paper – iii)
- introduction to web designing (paper – ii)
- linear electronics – i
- linear electronics – ii
- linux operating system (new)
- literary quest
- mathematical algebra
- mathematics(numerical methods)
- microprocesor – ii
- object oriented programming using c++
- object oriented programming using java (paper – i)
- on track – english skills for success
- oop using c++ – ii
- operating system
- operating system – ii (paper – i)
- operations research
- organization of pc – ii
- peripherals and interfacing – ii
- pr obabili ty theory – ii
- probability theory – i (paper – ix)
- programming using “c”
- python – i (paper – v)
- software engineering
- software enginering – ii
- theory of computer science
- theory of computer science (paper – iv)
- visual programming – i
- visual programming and aplication software – i (old)
- visual programming and aplication software – ii(paper – vi)
- web technology and e-commerce – i
- web technology and e-commerce – i (paper – v)
- web technology and e-commerce – ii (paper – v)