COMPILER DESIGN

LEXICAL ANALYSIS

REGULAR EXPRESSIONS AND FINITE AUTOMATA

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The Transitional function of DFA
A
Q X
B
Q X
C
Q X
D
Q X
Explanation: 

Detailed explanation-1: -A DFA is a collection of 5-tuples same as we described in the definition of FA. Transition function can be defined as: : Q x ∑→Q.

Detailed explanation-2: -A Deterministic Finite Automaton (DFA) is defined as a 5-tuple (Q, , , s, F) consisting of. A finite set Q (the set of states) A finite set of symbols (the input alphabet) A transition function : Q × → Q mapping the current state q ∈ Q and input symbol a ∈ to a new state (q, a) ∈ Q.

Detailed explanation-3: -2. What is the transitional function of a DFA? Explanation: Q is the finite set and let be a finite set of symbols so Q X fives no of states.

Detailed explanation-4: -Formally, a DFA is described by a 5-tuple (Q, , , q0, F) in which Q is a finite set of states, is a finite set of input symbols also known as the alphabet, is a state transition function ( : Q × → Q), q0 is the start state (q0 Q), and F is a set of accept states (F Q).

There is 1 question to complete.