Explanation:

A grammar is a set of production rules that define the structure of a language. A deterministic finite automaton (DFA) is a mathematical model of computation that recognizes or accepts a language by reading input from left to right and transitioning between states based on the input symbols.

Left linear grammar:
A left linear grammar is a type of grammar in which all the production rules are of the form A → aB or A → a, where A and B are non-terminal symbols, and a is a terminal symbol. In other words, the leftmost symbol in each production rule is a non-terminal symbol.

Right linear grammar:
A right linear grammar is a type of grammar in which all the production rules are of the form A → Ba or A → a, where A and B are non-terminal symbols, and a is a terminal symbol. In other words, the rightmost symbol in each production rule is a non-terminal symbol.

Generic grammar:
A generic grammar is a type of grammar that does not have any specific restrictions on the production rules. It can have production rules of any form.

Explanation of the answer:
The question asks which types of grammars can be translated to deterministic finite automata (DFAs). DFAs are particularly well-suited for recognizing regular languages, which are languages that can be described by regular expressions or generated by regular grammars.

Left linear grammar and right linear grammar:
Both left linear grammar and right linear grammar have specific restrictions on the form of the production rules. These restrictions make it possible to directly translate these types of grammars to DFAs. In both cases, the DFA can have states representing the non-terminal symbols and transitions representing the production rules. The DFA can read the input from left to right and transition between states based on the input symbols, following the rules defined by the grammar.

Generic grammar:
A generic grammar does not have any specific restrictions on the form of the production rules. It can have more complex rules that cannot be directly translated to DFAs. Therefore, a generic grammar cannot always be translated to a DFA.

Conclusion:
Among the given options, only the right linear grammar can always be translated to a DFA. Left linear grammar and generic grammar may not always be translatable to DFAs. Therefore, the correct answer is option 'B' (Right linear grammar).