How to determine whether a language is LL(1) LR(0) SLR(1)

Question

Is there a simple way to determine whether a grammar is LL(1), LR(0), SLR(1)... just from looking on the grammar without doing any complex analysis?

For instance: To

Answer 1

One aspect, "is the language/grammar ambiguous", is a known undecidable question like the Post correspondence and halting problems.