Compilers Nfa Epsilon Moves Dfa 1 Online Exam Quiz
Compilers Nfa Epsilon Moves Dfa 1 GK Quiz. Question and Answers related to Compilers Nfa Epsilon Moves Dfa 1. MCQ (Multiple Choice Questions with answers about Compilers Nfa Epsilon Moves Dfa 1
Find the pair of regular expressions that are equivalent.
Options
A : (0+1)* and (0*+1*)*
B : (0+1)* and (0+1*)*
C : (0+10)* and (0*+10)*
D : All of the mentioned
Which of the following strings is NOT in the Kleene star of the language {011, 10, 110}?
Options
A : 01
B : 10
C : 110
D : 10011101
Here is a context-free grammar G: S ? AB A ? 0A1 | 2 B ? 1B | 3A which of the following strings are in L (G)?
Options
A : 021300211
B : 022111300211
C : None of the mentioned
D : 021300211 & 022111300211
If string s is accepted by this DFA, which of these strings cannot be suffix of s?
Options
A : 111001
B : 111111
C : 111000
D : 101010
Examine the following DFA: If input is 011100101, which edge is NOT traversed?
Options
A : A B
B : C
C : C D
D : D A
The parse tree below represents a rightmost derivation according to the grammar S ? AB, A ? aS|a, B ? bA. Which of the following are right-sentential forms corresponding to this derivation?
Options
A : aAbAba
B : aababa
C : aABba
D : aSba
The grammar G: S ? SS | a | b is ambiguous. Check all and only the strings that have exactly two leftmost derivations in G.
Options
A : bbb
B : ab
C : All of the mentioned
D : None of the mentioned
For the following grammar: S ? A | B | 2 A ? C0 | D B ? C1 | E C ? D | E | 3 D ? E0 | S E ? D1 | S Identify all the unit pairs.
Options
A : D,C
B : A,B
C : B,C
D : A,C
If is a language, and is a symbol, then, the quotient of and, is the set of strings such that is in: is in. Suppose is regular, which of the following statements is true?
Options
A : L/a is always a regular language
B : L/a is not a regular language
C : All of the mentioned
D : None of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Non Deterministic Finite Automata 1
Compilers Obtaining Regular Expression From Finite Automata 1