Construct DFA from context-free grammar

Question

What is simplest and shortest way to build minimal DFA from context-free grammar (equivalent to regular grammar)? For example, the grammar:

A ::= aB
B ::= {b}

And the automaton:

      a           b
(0) ----> ((1)) <----
            |_______|

I know that there is one-step-algorithm to construct minimal DFA from regular expression, but I can not find similar for context-free grammar.

Thanks for help.