In the design of a typical compiler for a programming language, how are context$-$free grammars $($CFGs$)$ and finite automata $($DFA$/$NFA$)$ commonly utilized?

Both CFGs and DFA$/$NFA are exclusively used for semantic analysis.

CFGs are used for lexical analysis to recognize tokens, and DFA$/$NFA are used for syntax analysis to generate parse trees.

DFA$/$NFA are used for lexical analysis to recognize tokens, and CFGs are used for syntax analysis to define the structure of valid sentences.

DFA$/$NFA are used to optimize the generated machine code, while CFGs handle both lexical and syntax analysis.