Set 1:
1. Short Answer Questions (4×5 marks):
○ Define a compiler and explain its various functions.
○ Describe the role of the lexical analyzer in a compiler.
○ Explain the concept of input buffering in lexical analysis.
○ What are finite automata, and how are they used in lexical analysis?
2. Long Answer Questions (2×10 marks):
○ Discuss the structure of a compiler, detailing each phase and its significance.
○ Explain the process of converting regular expressions to finite automata,
including the steps involved.
3. Application-Based Question (1×20 marks):
○ Given a set of regular expressions, construct the corresponding finite automata
and minimize the DFA. Provide detailed steps and diagrams.
Set 2:
1. Short Answer Questions (4×5 marks):
○ What is the role of the lexical analyzer in a compiler?
○ Explain the concept of input buffering in lexical analysis.
○ Describe the process of recognizing tokens in a source program.
○ What is the significance of regular expressions in lexical analysis?
2. Long Answer Questions (2×10 marks):
○ Discuss the structure of a compiler, detailing each phase and its significance.
○ Explain the process of converting regular expressions to finite automata,
including the steps involved.
3. Application-Based Question (1×20 marks):
○ Given a set of regular expressions, construct the corresponding finite automata
and minimize the DFA. Provide detailed steps and diagrams.
Set 3:
1. Short Answer Questions (4×5 marks):
○ Define a compiler and explain its various functions.
○ Describe the role of the lexical analyzer in a compiler.
○ Explain the concept of input buffering in lexical analysis.
○ What are finite automata, and how are they used in lexical analysis?
2. Long Answer Questions (2×10 marks):
○ Discuss the structure of a compiler, detailing each phase and its significance.
○ Explain the process of converting regular expressions to finite automata,
including the steps involved.
3. Application-Based Question (1×20 marks):
○ Given a set of regular expressions, construct the corresponding finite automata
and minimize the DFA. Provide detailed steps and diagrams.
