Re: Reduced lookahead requirements in the lexer?
Tuesday, February 18, 2003 11:18 AM
It all has to do with how the nextToken() rule is synthesized out of all of the non-protected lexer rules. Take a look at the generated code and I think you'll get the idea. It also has to do with linear approximate lookahead and how lookahead tests are combined. You might want to look at FAQ entries about linear approximation.