Language containing all unambiguous grammars
The language $L$ clearly exists &mdash; you just defined it!

It’s not hard to check that your language is co-r.e., that is, you can enumerate ambiguous grammars. Since it’s not recursive, it cannot be r.e.