Tail calls are a syntactic property of the language
hence there should be no need for a tail recursion
detector beyond a trivial syntactic analysis.  I.e. it
should get 'em all.

E.g. Page 329 of 'Modern Compiler Implementation in
ML'

... the B_i are in tail contexts, but the C_i are not:

 ...
3. if C_1 then B_1 else B_2
 ...

Noel

--- John Max Skaller <skaller@ozemail.com.au> wrote:
> I'm in the process of writing a tail recursion
> detector for 
> Felix...
> 
> My question is: how smart is the Ocaml tail call
> detector?
> Can I optimise the above code like:


__________________________________________________
Do You Yahoo!?
LAUNCH - Your Yahoo! Music Experience
http://launch.yahoo.com
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners