R->R|T T->lamda is an ambiguous grammar true false

zureignenj72

zureignenj72

Answered question

2022-12-17

R R | T               T λ is an ambiguous grammar
Its true or false

Answer & Explanation

Terry Church

Terry Church

Beginner2022-12-18Added 4 answers

A grammar can only be satisfying the ambiguous grammar condition if we can draw more than one parse tree when a string that can be obtained using the given grammar is taken as example.
Here in the given grammar only string that can be formed using the grammar is an empty string λ
And hence it does not have any other derivation
And so it is not an ambiguous grammar.
And hence the option FALSE is correct.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?