Given an arbitrary context free grammar G, we define L as below.
L=(0+1)* if G is ambiguous
And
L=j if G is not ambiguous
Which of the following is true?
a. L is a context-free language
b. L is recursive but not r.e.
c. What L is depends on whether we can determine if G is ambiguous or not
d. What L is is undecidable
The answer to the question is available in the PDF file https://assignmentexpert.com/https://assignmentexpert.com/homework-answers/mathematics-answer-38614.pdf
Comments
Dear Sujata Roy. You're welcome. We are glad to be helpful. If you really liked our service please press like-button beside answer field. Thank you!
Thank you.
Leave a comment