search
Log In
0 votes
212 views
Is true..?

 

In an unambiguous grammar every string has exactly one derivation.
in Theory of Computation 212 views
0
exactly one Leftmost derivation or exactly one Rightmost derivation
0
Thank you:)

1 Answer

1 vote

true

  ambiguous grammar is a  grammar for which there exists a string that can have more than one leftmost derivation or right most derivation or parse tree,

 unambiguous grammar is a  grammar for which every  string has a unique leftmost derivation or right most derivation or parse tree.

Related questions

0 votes
1 answer
1
178 views
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack Then A)Ldf proper subset of Lef. B)Ldf = Lef. C)Lef proper subset of Ldf. D)None .
asked Nov 6, 2018 in Theory of Computation Abhisek Tiwari 4 178 views
0 votes
0 answers
2
106 views
Consider the following CFG 'G' S--> aA/bSS/SS A--> aAb/bAa/AA/ε The language generated by G is: a)Set of all strings with atleast one 'a' b)Set of all strings with atleast two a's c)Set of all strings with atleast one more 'a' than number of b's d)None of these
asked Oct 18, 2018 in Theory of Computation Sambhrant Maurya 106 views
0 votes
0 answers
4
162 views
Consider following PDA WHICH OF FOLLOWING IS TRUE ABOUT LANGUAGE ACCEPTED BY IT ? A. Regular but infinite B. Regular but finite C. DCFL but not regular D. CFL but not DCFL
asked Sep 9, 2018 in Theory of Computation Na462 162 views
...