1 Crore+ students have signed up on EduRev. Have you? 
Grammar that produce more than one Parse tree for same sentence is
An ambiguous grammar is one for which there is more than one parse tree for a single sentence.
Automaton accepting the regular expression of any number of a ‘ s is
It gives any number of a’s.
Right linear grammar can be translated to the DFAs.
A known fact that type 2 grammar is accepted by PDA.
Given the following statements : (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements ?
Recursive languages are closed under the following operations.
The Kleene star L * of L
the concatenation L * o P of L and P
the union L U P
the intersection L ∩ P.
Assume statements S1 and S2 defined as : S1 : L2L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2 : The set of all Turing machines is countable. Which of the following is true ?
The assumptions of statement S1 and S2 are correct.
When two or more Left and right most derivative occur the grammar turn ambiguous.
All the statements follow the rules.
The context free grammar S → A111S1, A → A0  00 is equivalent to
S> A111
S>00111 (A>00)
S>SS
S>0S1S
S>0S11S0
S>0110.
All of them are true regarding a derivation tree.
PDA accepts CFG.
Regular grammar is CFG. It restricts its rules to a single non terminal on left hand side.
CFG is closed under the above mentioned 3 operations.
CFG consist of terminal non terminal start symbol set of production rules but does not have an end symbol.
15 videos55 docs30 tests

Use Code STAYHOME200 and get INR 200 additional OFF

Use Coupon Code 
15 videos55 docs30 tests








