# 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 &\rightarrow B/A, \\ 1B &\rightarrow 111B, \\ 1A0 &\rightarrow 00 \end{align}

• Since it is undecidable to check if a set of grammar rues is context-free or not, there is no algorithm to accomplish the task. That is, it will forever be an art or research to understand or find whether they are context-free or not, although we might increase our heuristic indefinitely. – Apass.Jack Dec 20 '18 at 0:23
• @vamsikrishna Is your question about whether a set of rules qualifies syntactically as valid CFG rules or whether they are equivalent to a CFG? (In the latter case, refer to Apass.Jack's comment.) – dkaeae Dec 20 '18 at 8:28