Applications of NFA Online Exam Quiz
Applications of NFA GK Quiz. Question and Answers related to Applications of NFA. MCQ (Multiple Choice Questions with answers about Applications of NFA
L1= {w | w does not contain the string tr }^ L2= {w | w does contain the string tr}^ Given ?= {t, r}, The difference of the minimum number of states required to form L1 and L2?
Options
A : 0
B : 1
C : 2
D : Cannot be said
Left corner parsing methof uses which of the following?
Options
A : Top down parser
B : Bottom up parser
C : TOP down and Bottom up parser
D : None of the mentioned
Predict the number of transitions required to automate the following language using only 3 states:^ L= {w | w ends with 00}
Options
A : 3
B : 2
C : 4
D : Cannot be said
The total number of states to build the given language using DFA:^ L= {w | w has exactly 2 a's and at least 2 b's}
Options
A : 10
B : 11
C : 12
D : 13
To derive a string using the production rules of a given grammar, we use:
Options
A : Scanning
B : Parsing
C : Derivation
D : All of the mentioned
Which among the following can be an example of application of finite state machine(FSM)?
Options
A : Communication Link
B : Adder
C : Stack
D : None of the mentioned
Which among the following is not an application of FSM?
Options
A : Lexical Analyser
B : BOT
C : State charts
D : None of the mentioned
Which of the following is true for shift reduce parsers?
Options
A : Scans and parses the input in one forward pass over the text, without any backup.
B : A shift command advances in the input stream by one symbol
C : LALR parser
D : All of the mentioned
Which of the following parser performs top down parsing?
Options
A : LALR parser
B : LL parser
C : Recursive Accent parser
D : None of the mentioned
Which of the following parser reaches the root symbol of the tree at last?
Options
A : Top down parser
B : Bottom up parser
C : TOP down and Bottom up parser
D : None of the mentioned
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle
CFG-Eliminating Useless Symbols
Deterministic Finite Automata-Introduction and Definition