Darren New <dne### [at] sanrrcom> wrote:
> No. The compiler does something called typestate analysis (not too 
> unlike data flow analysis) to ensure that once the function returns EOF 
> you don't invoke the read function any more.

  Given that in a Turing-complete language it's impossible to prove
in the generic case whether a certain piece of code is ever executed
or not, that would mean that the language would have to be less
expressive than a Turing machine.

-- 
                                                          - Warp

Post a reply to this message