How do I derive a regular grammars from this regular expression?
Use Thompson's algorithm to convert the regular expression to a NFA.  Then, you can directly read a regular grammar off, given the NFA: each non-terminal represents one state of the NFA.