intrinsic.texi (Bessel_jn, Bessel_yn): Fix typo.

2010-08-19  Tobias Burnus  <burnus@net-b.de>

        * intrinsic.texi (Bessel_jn, Bessel_yn): Fix typo.
        * * simplify.c (gfc_simplify_bessel_yn): Change recursive
        into recurrence.

From-SVN: r163365

gcc/fortran/ChangeLog

 2010-08-19  Tobias Burnus  <burnus@net-b.de>
 
+	* intrinsic.texi (Bessel_jn, Bessel_yn): Fix typo.
+	* * simplify.c (gfc_simplify_bessel_yn): Change recursive
+	into recurrence.
+
+2010-08-19  Tobias Burnus  <burnus@net-b.de>
+
 	PR fortran/36158
 	PR fortran/33197
 	* check.c (gfc_check_bessel_n2): New function.

gcc/fortran/intrinsic.texi

@@ -1661,7 +1661,7 @@ The return value is a scalar of type @code{REAL}. It has the same
 kind as @var{X}.
 
 @item @emph{Note}:
-The transformational function uses a recurrance algorithm which might,
+The transformational function uses a recurrence algorithm which might,
 for some values of @var{X}, lead to different results than calls to
 the elemental function.
 
@@ -1821,7 +1821,7 @@ The return value is a scalar of type @code{REAL}. It has the same
 kind as @var{X}.
 
 @item @emph{Note}:
-The transformational function uses a recurrance algorithm which might,
+The transformational function uses a recurrence algorithm which might,
 for some values of @var{X}, lead to different results than calls to
 the elemental function.
 

gcc/fortran/simplify.c

@@ -1261,7 +1261,7 @@ gfc_simplify_bessel_n2 (gfc_expr *order1, gfc_expr *order2, gfc_expr *x,
       return result;
     }
 
-  /* Use the faster but more verbose recursion algorithm. Bessel functions
+  /* Use the faster but more verbose recurrence algorithm. Bessel functions
      are stable for downward recursion and Neumann functions are stable
      for upward recursion. It is
        x2rev = 2.0/x,