WorksheetsATCD - MCQ - IAE1 Portions
Total questions: 15
Worksheet time: 8mins
Finite State Machine is ________tuple machine
4
5
6
7
Push Down Automaton is ________tuple machine
4
5
6
7
Context-sensitive Grammar is accepted by
Deterministic Finite Automata
Non Deterministic Finite Automata
Linear Bounded Automata
Push Down Automata
Identify the type of grammar.
S-->Xa
X-->a
X-->aX
X-->abc
X-->e
(a)
bAa-->aa, S-->s. Identify the type of Grammar
Type 0
Type 1
Type 2
Type 3
Give the regular expression for {0,00,000,....}
0+
0*
Give the regular expression for set of strings over {a,b} that has at most 1 a
(a+b)* a (a+b)*
b* a b*|b*
a*b*c*
(a.b)*a
Give the regular expression for all strings that start with ab and ends with ba
aba*b*ba
ab(ab)*ba
ab(a+b)*ba
a*b*
The_________ performs lexical, syntax and semantic analysis of compilation process
Back End
Front End
Middle
All of these
Misspelling of an identifier falls under ___________ error
Lexical
Syntax
In Turing Machine a->b,R represents
update cell and move tape head right
No update
Move Tape head Right
For the given DFA, identify the 2-equivalence (Minimization of DFA)
{A,B,C,D} {E}
{A,B,C} {D}{E}
{A,C}{B}{D}{E}
{A,B,C,D,E}
5. The Tuples for Push Down Automata is ___________
∑, Q, q0, F, δ
Γ,∑, Q, q0, F, δ,z0
F, Q, Δ, q0, δ
F, Q, Δ, q0, δ,z0
Push Down Automata is used in which phase of compilation
Lexical Analysis
Syntax Analysis
Give the regular expression for {ε,0,00,000,....}
0*
0+
