Decidability

Question

L= {<G> | G is CFG and G is NOT ambiguous} .
L is TM recognizable or not even TM recognizable?

Comments

but

1) wheather L(G) is CFL? is decidable

So,

why not we make a TM

which accepts all unambiguous grammar?

---

@srestha Who told that is decidable?

---

when G is DCFG

here  we find ,"if L(G) is CFL" is decidable

right?

--------------------------------------------------------------------------

My question was

 G is CFG

here when we find ,"if L(G) is CFL" is decidable or not?

-----------------------------------------------------------------------------

Moreover , an ambiguous grammar is undecidable.

Does it mean, an unambiguous grammar also need to be undecidable?

Answer 1

as L is  CFG  it is subset of UG

that is TM recoznigable

Comments

who told $L$ is CFL?