Tail Recursion

How do i make this function tail recursive in java


public int fib(int n)
{
  return( n <= 1 ? n : fib(n-1) + fib(n-2) );
}

boost is a pile of shit.
Want to do the exact same thing as printf() but have it be a hundred times slower, both in compile time and execution time?  No problem, just add 36275 source files _{yes, that's the actual number of source files in the current boost distribution (378MB of source) sure hope there aren't any typos!} to your project and use boost::format().  Optimized!