If G is a context-free grammar such that it has the productions of the form
$$ X \rightarrow \alpha Y ,X \rightarrow \alpha $$
How can I show that L(G) is a regular language
If G is a context-free grammar such that it has the productions of the form
$$ X \rightarrow \alpha Y ,X \rightarrow \alpha $$
How can I show that L(G) is a regular language