Unit - I: Introduction to Finite Automata

1-Mark Questions

1. Define finite automata.

2. Explain the difference between DFA and NFA.

3. What is the role of epsilon transitions in NFA?

4. Define the language of a DFA.

5. Explain the process of converting an NFA to a DFA.

6. What is the significance of structural representations in automata theory?

7. Define alphabets, strings, and languages in the context of automata theory.

8. Explain the concept of complexity in automata theory.

9. What is the pumping lemma for regular languages?

10. Explain the application of finite automata in text search.

1. Describe the steps involved in converting an NFA with epsilon transitions to an NFA without
epsilon transitions.

2. Explain the process of converting a regular expression to a finite automaton.

3. Discuss the significance of the pumping lemma in proving a language is not regular.

4. Describe the construction of a DFA from an NFA using the subset construction method.

5. Explain the role of finite automata in lexical analysis in compiler design.

6. Discuss the differences and similarities between DFA and NFA.

7. Explain the concept of nondeterminism in finite automata.

8. Describe the steps involved in the minimization of DFA.

9. Explain the application of finite automata in pattern matching.

10. Discuss the role of finite automata in the design of lexical analyzers.
 Unit - II: Regular Expressions, Pumping Lemma for Regular Languages, Context-Free
Grammars

1-Mark Questions

1. Define regular expressions.

2. Explain the algebraic laws for regular expressions.

3. What is the pumping lemma for regular languages?

4. Define context-free grammars (CFGs).

5. Explain the difference between leftmost and rightmost derivations.

6. What is a parse tree?

7. Define ambiguity in grammars and languages.

8. Explain the role of regular expressions in lexical analysis.

9. What is the significance of the pumping lemma in automata theory?

10. Explain the concept of regular languages.

1. Describe the process of converting a finite automaton to a regular expression.

2. Explain the proof of the pumping lemma for regular languages.

3. Discuss the construction of a regular expression from a finite automaton.

4. Explain the concept of ambiguity in context-free grammars and how to resolve it.

5. Describe the steps involved in the construction of a parse tree for a given string.

6. Explain the role of context-free grammars in compiler design.

7. Discuss the differences between regular languages and context-free languages.

8. Explain the significance of regular expressions in text processing.

9. Describe the process of converting a regular expression to a finite automaton.

10. Explain the concept of regular languages and their closure properties.
 Unit - III: Push Down Automata, Turing Machines, Undecidability

1-Mark Questions

1. Define a pushdown automaton (PDA).

2. Explain the components of a PDA.

3. What is the significance of the stack in a PDA?

4. Define a Turing machine.

5. Explain the concept of undecidability.

6. What is the halting problem?

7. Define recursively enumerable languages.

8. Explain the role of PDAs in parsing.

9. What is the significance of Turing machines in computability theory?

10. Explain the concept of acceptance by final state in PDAs.

1. Describe the construction of a PDA from a context-free grammar.

2. Explain the proof of the equivalence between PDAs and CFGs.

3. Discuss the concept of undecidability and its implications in computer science.

4. Explain the construction of a Turing machine for a given problem.

5. Describe the proof of the halting problem being undecidable.

6. Explain the role of PDAs in the parsing phase of compiler design.

7. Discuss the differences between PDAs and Turing machines.

8. Explain the concept of recursively enumerable languages and their properties.

9. Describe the construction of a PDA for a given context-free language.

10. Explain the significance of Turing machines in the theory of computation.

1-Mark Questions

1. Define the structure of a compiler.

2. Explain the role of the lexical analyzer.

3. What is the significance of input buffering in lexical analysis?

4. Define tokens in the context of lexical analysis.

5. Explain the role of the lexical analyzer generator Lex.

6. Define syntax analysis.

7. Explain the difference between top-down and bottom-up parsing.

8. What is LR parsing?

9. Define context-free grammars.

10. Explain the role of the parser in compiler design.

1. Describe the phases of a compiler and their roles.

2. Explain the process of lexical analysis and the role of the lexical analyzer.

3. Discuss the significance of input buffering in lexical analysis.

4. Explain the construction of a lexical analyzer using Lex.

5. Describe the process of syntax analysis and the role of the parser.

6. Explain the differences between top-down and bottom-up parsing.

7. Discuss the construction of an LR parser.

8. Explain the role of context-free grammars in syntax analysis.

9. Describe the process of writing a grammar for a given language.

10. Explain the significance of parsing in compiler design.

1-Mark Questions

1. Define syntax-directed translation.

2. Explain the concept of syntax-directed definitions (SDDs).

3. What is the significance of evaluation orders in SDDs?

4. Define three-address code.

5. Explain the role of intermediate code generation.

6. Define run-time environments.

7. Explain the concept of stack allocation of space.

8. Define heap management.

9. Explain the significance of access to nonlocal data on the stack.

10. Define variants of syntax trees.

1. Describe the process of syntax-directed translation and its significance in compiler design.

2. Explain the implementation of L-attributed SDDs.

3. Discuss the role of syntax-directed translation schemes in compiler design.

4. Explain the generation of three-address code from an abstract syntax tree.

5. Describe the significance of intermediate code generation in compiler design.

6. Explain the concept of run-time environments and their role in program execution.

7. Discuss the implementation of stack allocation of space in run-time environments.

8. Explain the concept of heap management and its significance in run-time environments.

9. Describe the process of accessing nonlocal data on the stack.

10. Explain the significance of variants of syntax trees in compiler design.