# How to define a context free grammar from a regular language?

I wonder how do you clasify S->a (where a is a Terminal Symbol)

It can be right linear,left linear and context free at the same time?

So the only way to distinguish them is to see what productions there are with Non-terminal symbols (like S in this example)

0) If I see S->a it can be (left/right/context-free) impossible to know

1) If I see only production in the form of S->a and S-> aS then it is right lineair

2) If I see only production in the form of S->a and S-> Sa then it is left lineair

3) If I see a mix (left and right) of the form of S-> aS and S-> Sa then I know that it is context free

4) If I see a production with a terminal symbol on the left AND on the right then I also know it is context free : like this S->aSa

Are these 5 statements correct? Am I missing scenario's to define the difference between regular and context free?