Compilers Finite Automata Regular Expressions 1 Online Exam Quiz
Compilers Finite Automata Regular Expressions 1 GK Quiz. Question and Answers related to Compilers Finite Automata Regular Expressions 1. MCQ (Multiple Choice Questions with answers about Compilers Finite Automata Regular Expressions 1
Which of the following pairs of regular expressions are equivalent?
Options
A : 1(01)* and (10)*1
B : x (xx)* and (xx)*x
C : x+ and x+ x(*+)
D : All of the mentioned
If ? = {a, b, c, d, e, f} then number of strings in ? of length 4 such that no symbol is used more than once in a string is
Options
A : 35
B : 360
C : 49
D : 720
Which one of the following statement is FALSE?
Options
A : Context-free languages are closed under union
B : Context-free languages are closed under concatenation
C : Context-free languages are closed under intersection
D : Context-free languages are closed under Kleene closure
Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?
Options
A : L = O
B : L is regular but not O
C : L is context free but not regular
D : L is not context free
An FSM with __________
Options
A : M can be transformed to Numeral relabeling its states
B : M can be transformed to N, merely relabeling its edges
C : Both of the mentioned
D : None of the mentioned
Number of states of FSM required to simulate behaviour of a computer with a memory capable of storing “m” words, each of length ‘n’.
Options
A : m x 2n
B : 2mn
C : 2(m+n)
D : all of the mentioned
Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least.
Options
A : N2
B : 2N
C : 2N
D : N!
Which of the following are not regular?
Options
A : String of )’s which has length that is a perfect square
B : Palindromes Consisting of 0’s 1’s
C : String of 0’s whose length is a prime number
D : All of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Error Recovery Lr Phase 1
Compilers Error Recovery Lr Phase 2
Compilers Handle Right Sentinel Grammar 1
Compilers Implementation Translation Specified Syntax Directed Definitions Translations 1