retagged by
493 views
0 votes
0 votes

retagged by

1 Answer

0 votes
0 votes
Statement 2 :

ambigous grammer are those , for which there exists a string which is generated by the grammer has more than one parse tree.

They may be distiinct or not doesn't matter,

Because two same parse tree for any string from the same grammer,   count as 2 parse tree not one.

So that's why statement 2 is not correct, because they used distinct word in the statement.

  Statement 3 :

For a given grammer if there is no equivalent unambigous grammer present , then such a grammer is known as inherently ambigous CFG.

Hence, statement 2 is correct

Statement 1 : unambigous grammer , which have exactly one leftmostderivate/rightmostderivate/oneparsetree

Hence, statement 1 is correct too.

Therefore, only 1 and 3 are correct.

Related questions

0 votes
0 votes
0 answers
2
Hradesh patel asked Jan 19, 2017
352 views
# plz check???
0 votes
0 votes
0 answers
3
Hradesh patel asked Jan 19, 2017
320 views
# plz check??? i got 512
2 votes
2 votes
0 answers
4
thehobo03 asked Dec 26, 2016
482 views
Consider the following sets L1 = {apbq | p +q >= 106 }L2 = {ambn | m - n >= 106}Which of the following is a Regular Language? Also how to find the compliment of the given...