COMPILER DESIGN

LEXICAL ANALYSIS

REGULAR EXPRESSIONS AND FINITE AUTOMATA

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is wrong in the given definition? Def:({q0, q1, q2}, {0, 1}, , q3, {q3})
A
The definition does not satisfy 5 Tuple definition of NFA
B
There are no transition definition
C
Initial and Final states do not belong to the Graph
D
Initial and final states can’t be same
Explanation: 

Detailed explanation-1: -What is wrong in the given definition? Explanation: q3 does not belong to Q where Q= set of finite states.

There is 1 question to complete.