We can also answer this by placing each option at its correct position in the standard compiler pipeline (lexical analysis, syntax analysis, semantic analysis, intermediate code generation, optimization, code generation) and checking which one sits immediately after lexical analysis:
Only one of these outputs actually belongs to the first phase of the pipeline; the rest belong to phases that come after it and rely on its output.
Therefore, the correct answer is A stream of tokens.
Consider the control flow graph shown. Which one of the following choices correctly lists the set of live variables at the exit point of each basic block? 
Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions: \[ \text{letter} \;\;\rightarrow\;\; [A\!-\!Za\!-\!z] \] \[ \text{digit} \;\;\rightarrow\;\; [0\!-\!9] \] \[ \text{id} \;\;\rightarrow\;\; \text{letter (letter | digit)}^* \] Which one of the following Non-deterministic Finite-state Automata with $\epsilon$-transitions accepts the set of valid identifiers? (A double-circle denotes a final state). 