Given set of grammar rules, how to find if they correspond to Context-free or unrestricted Given set of grammar rules, how to find if they correspond to Context-free or unrestricted?

Just for Understanding (don't solve the below one),
eg: 

\begin{align}
S &amp;\rightarrow B/A, \\
1B &amp;\rightarrow 111B, \\
1A0 &amp;\rightarrow 00
\end{align}
It is undecidable to determine whether the language generated by a given grammar has a context-free grammar.

However, if you are simply asking whether a grammar itself is context-free, look no further than the left hand side of each production. A grammar is context free iff the left hand side of each production is a single non-terminal.