note ViciousFrank I know my post is a little late... <br/><br/> Maybe we have a disctinction in our definition of "static parsing", but I think that no language can actually be statically unparseable as long there is a finite number of parsing rules. Under this condition, there should be a finite number of possible derivations for a certain number of generated symbols. In Kennedy's example : <br/><br/> <code>whatever / 25 ; # / ; die "this dies!";</code> <br/><br/> Two interpretations are possible. There should not be any problem if the compiler find the two ways and produces a check branching to the two interpretations. Something like this: <br/> <pre>if (is_nullary(whatever)) { whatever / 25; } else { whatever (/ 25 ; # /); die "this dies!"; }</pre> When we think about it, the Perl interpreter already does this. So technicaly, parsing Perl is not a undecidable problem. You only proved that there could not be a single way to parse Perl - and yes, it is a problem for text editor's syntax-highlighting. 663393 663393