recategorized by
365 views
3 votes
3 votes
Please explain with examples,

1)is every regular grammar is unambiguous?

2) An unambiguous grammar will always generate DCFL?
recategorized by

1 Answer

0 votes
0 votes
i)

$S \rightarrow wS$

$S \rightarrow w/\epsilon$

The language is regular but ambiguous.

ii) Certain but not definite.

Related questions

1 votes
1 votes
1 answer
1
Himanshu1 asked Nov 2, 2015
991 views
Give an example of Unambiguous CFL which is not DCFL .
0 votes
0 votes
0 answers
2
Tuhin Dutta asked Dec 14, 2017
304 views
$a^*\ \ \ and\ \ \ a*$Isn't the above two same?Let $L\ =\ aa^*,\ then\ L^+\ =\ LL^*\ =\ aa^*(aa^*)^*\ =\ aa^*a*\ =\ aa*$I couldn't understand the last and the 2nd last s...
2 votes
2 votes
3 answers
4
Rahul Ranjan 1 asked May 28, 2018
1,391 views
If a grammar( $CFG$ ) has more than one Right most derivation, Can it be called ambiguous ?Or we say a grammar is ambiguous only when it has more than one left most deriv...