Tutorial Questions on ATCD
TUTORIAL-1
Q1. For the given NFA which of the following is the equivalent DFA:
Q2. Consider the following NFA and answer the following:
a) Compute the ε-closure of each state.
b) Convert the automaton to a DFA.
Q3. Consider the following ε-NFA and do the following:
a) Compute the ε-closure of each state.
b) Convert the automaton to a DFA.
Q4. Constructure the Finite Automata from the following 5-tuple notation:
Q5. Convert the given ε-NFA to its equivalent DFA:
TUTORIAL-2
Q1. Illustrate the construction of Non Deterministic Finite Automata for the Regular Expression: (a+b)*a
Q2. Construct the regular expression for the language over the set S={0,1} that can have a set of all strings containing no three consecutive 0’s
Q3. Construct a CFG to generate the binary strings that are Palindromes ex: 010, 00100, 101, 11011
Q4. Identify the language generated by the following CFG: S-->Aab; A-->Aab|b
Q5. Construct the NFA for the regular expression r = ((01+10)*00)*
Q6. Constructure the Finite Automata using 5-tuple notation for the regular expression 1*01(0+11)*
TUTORIAL-3
Q1. Give the formal definition of PDA.
Q2. 
Q3.
Q4.
Q5. Explain different types of Turing Machine.
TUTORIAL-4
Q1. Explain different steps involved in a typical language processing system with a neat diagram.
Q2. Identify the difference between compiler & assembler. Retrieve the phases of a typical compiler?
Q3. Explain the concept of a “pass” in compiler design. How do multiple passes contribute to the overall translation process?
Q4. List out the phases of compiler? What is the role of lexical analysis in constructing a compiler?
Q5. Tabulating the difference between lexemes, patterns and tokens. How do you recognize tokens in Lexical Analysis?
Q6. Discuss the contents and structure of a symbol table. What types of information are stored for each identifier?
Q7. Explain the translation process at each phase of compiler for the given expression d:=b+c*60
TUTORIAL-5
Q1. Write three-address code for the expression:
a+b*c-d/e
Q2. Compare and contrast the three main runtime storage organization techniques:
i) Static Allocation
ii) Stack Allocation
iii) Heap Allocation
Q3. Explain the procedure to translate Control Statements into Three Address Code with example.
Q4. Distinguish between Syntax Directed Definition and Syntax Directed Translation.
Q5. Define Three Address Codes. Outline the three address code representation for the following expression:
x + -y * (-y + z)
Q6. Define Loop unrolling and Loop jamming. Also explain constant folding.
