Ambiguities

Ambiguities

Lex always chooses the pattern which represents the longest

possible input string.

If two patterns represent the same string, the first pattern

in the list presented to lex is chosen.

use:

int

[a-z]+

Previous slide

Next slide

Back to the first slide

View Graphic Version