# Answer to Question #38614 in Other Math for Sujata Roy

Question #38614

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

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

Expert's answer

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

Assignment Expert31.01.14, 19:10Dear 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!

Sujata Roy30.01.14, 07:17Thank you.

## Leave a comment