A lexical analyzer uses the following token definitions
ο· πππ‘π‘ππβ[π΄βππβπ§]
ο· πππππ‘β[0 β9]
ο· ππβπππ‘π‘ππ (πππ‘π‘ππ | πππππ‘)*
ο· ππ’ππππβπππππ‘+
ο· π€π β(πππππ | π‘ππ | πππ€ππππ)+
For the string given below,
π₯1 23ππ 78 π¦ 7π§ π§π§5 14π΄ 8π» π΄ππππ·
the number of tokens (excluding π€π ) that will be produced by the lexical analyzer
is __________. (answer in integer)
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). 