(A) True
(B) False
(C) NA
(D) NA
Tag: Theory of Automata
Between the two consecutive joints on a path?
(A) One character can be pushed and one character can be popped
(B) Any no. of characters can be pushed and one character can be popped
(C) One character can be pushed and any no. of characters can be popped
(D) Any no. of characters can be pushed and any no. of characters can be popped
If L1 and L2 are regular languages is/are also regular language(s)?
(A) L1 + L2
(B) L1L2
(C) L1*
(D) All of above
A production in CFG consists of?
(A) One terminal
(B) More than one terminal
(C) One non-terminal
(D) Terminals and non-terminals
Bottem up parsing can be determined similar to that of TOP Down parsing with the change that in this case ,the process is started with the given string and the tree is extended till “S “is?
(A) Regular
(B) Non regular
(C) Obtain
(D) Finite
For a non regular language there exist __ FA.
(A) True
(B) False
(C) NA
(D) NA
The process of finding the derivation of word generated by particular grammar is called?
(A) PLUS TIMING
(B) Parsing
(C) HALT
(D) All of above
A program which is the set of rules which show that which state is to be entered when a letter is read form the?
(A) TAPE
(B) HALT
(C) TM
(D) None of above