Author: lwall Date: 2009-06-25 00:49:31 +0200 (Thu, 25 Jun 2009) New Revision: 27213
Modified: docs/Perl6/Spec/S05-regex.pod Log: [S05] some clarification requested by moritz++ re ws in longest tokens Modified: docs/Perl6/Spec/S05-regex.pod =================================================================== --- docs/Perl6/Spec/S05-regex.pod 2009-06-24 22:05:25 UTC (rev 27212) +++ docs/Perl6/Spec/S05-regex.pod 2009-06-24 22:49:31 UTC (rev 27213) @@ -2174,8 +2174,10 @@ operator precedence), it is extremely useful for user understanding if at least the token processing proceeds deterministically. So for regex matching purposes we define token patterns as those patterns -containing no whitespace that can be matched without side effects -or self-reference. Basically, Perl automatically derives a lexer +that can be matched without potential side effects or self-reference. +(Since whitespace often has side effects at line transitions, it +is usually excluded from such patterns, give or take a little +lookahead.) Basically, Perl automatically derives a lexer from the grammar without you having to write one yourself. To that end, every regex in Perl 6 is required to be able to
