Bihar STET Computer Science – Compiler Design Set 2

Questions 1-5 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 1

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 18.09.2023 (Shift-I) PYQ

Which algorithm is used to convert a Regular Expression directly into a Nondeterministic Finite Automaton (NFA) with $\epsilon transitions$?

Answers for question 1

Question 2

MCQ · Single Correct 1 mark

What is the time complexity of Hopcroft's Algorithm for minimizing a Deterministic Finite Automaton (DFA) with n states and alphabet size k?

Answers for question 2

Question 3

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 12.06.2024 (Shift-I) PYQ

In a Lex specification, how is the 'Definitions' section separated from the 'Rules' section?

Answers for question 3

Question 4

MCQ · Single Correct 1 mark

What action does a Lexical Analyzer take when an input string matches multiple regular expression rules?

Answers for question 4

Question 5

MCQ · Single Correct 1 mark

In Thompson's NFA construction, how many states are introduced for a single character input symbol 'a'?

Answers for question 5
Scroll to Top