Consider the following lexical specification $($same as above$).$

INT: $(0+1)(0+1)*$

FLOAT: $(0+1)(0+1)*.(0+1)*+(0+1)*.(0+1)(0+1)*$

KEYWORD: $1111$

What would be the first two tokens produced by a scanner given the following input string? Use the scanning algorithm seen in class. List each token as an ordered pair without any spaces, like $($lexeme$,$TYPE$).$ For example $(00\mathrm{.}1,$FLOAT$).$

$11111111.\mathrm{.}1111$