This set of MCQs helps students to learn about finite automata and regular expression, which are used for the designing of lexical analysis of a compiler. and for recognizing the pattern using regular expressions, also for the designing of the combination and sequential circuits using Mealy and Moore Machines
A language L from a grammar G = { VN, Σ, P, S} is?
Maximum number of states of a DFA converted from an NFA with nstates is?
What is the transitional function of a DFA?
What is the transitional function of an NFA?
What are the basic limitations of finite state machine?
Which of the following statement is true for Dead State?
Which of the following statement is true for Moore Machine?
Which of the following statement is true for Mealy Machine?
Which is true for in accessible state?
What is another name for Lexical Analyser?
Lexical Analyser’s Output is given to Syntax Analysis.
Which phase of the compiler is Lexical Analyser?
In Mealy Machine O/P is associated with ____________.
Present state
Next state
Input
None of the mentioned
In a compiler the module that checks every character of the source text is called __________.
The code generator
The code optimizer
The lexical analyzer
The syntax analyzer
The context free grammar is ambiguous if ______________.
The grammar contains non-terminals
Produces more than one parse tree
Production has two non-terminals side by side
None of the mentioned