COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Regular expression
|
|
|
Finite Automata
|
|
|
LEX
|
|
|
YACC
|
Detailed explanation-1: -Finite automata is an abstract computing device. It is a mathematical model of a system with discrete inputs, outputs, states and a set of transitions from state to state that occurs on input symbols from the alphabet .
Detailed explanation-2: -The mathematical model of finite automata consists of: Finite set of states (Q) Finite set of input symbols () One Start state (q0)
Detailed explanation-3: -Explanation: Finite state automation is used in Lexical Analyser, Computer BOT (used in games), State charts, etc.
Detailed explanation-4: -Deterministic Finite Automata (DFA). Non-Deterministic Finite Automata (NFA or NDFA).
Detailed explanation-5: -A finite state machine is a triple M = (S, A, t), where S and A are nonempty finite sets and t : S × A → S is a function. Elements of S are called states. There is one distinguished element of S called the initial state. The set A is called the input alphabet, its elements are called letters.