2 files changed, 3 insertions, 3 deletions

diff --git a/src/library/scala/Enumeration.scala b/src/library/scala/Enumeration.scala
index 283c60beeb..4d223828ce 100644
--- a/src/library/scala/Enumeration.scala
+++ b/src/library/scala/Enumeration.scala
@@ -345,7 +345,7 @@ abstract class Enumeration(initial: Int, names: String*) {
   /** create an empty 32 bit enumeration set */
   def Set32 = new Set32
 
-  /** create a bit enumeration set according ot underlying */
+  /** create a bit enumeration set according to underlying */
   def Set32(underlying: Int) = new Set32(underlying)
 
   /** An enumeration bit set that can handle enumeration values with ids up
@@ -366,7 +366,7 @@ abstract class Enumeration(initial: Int, names: String*) {
   /** create an empty 64 bit enumeration set */
   def Set64 = new Set64
 
-  /** create a bit enumeration set according ot underlying */
+  /** create a bit enumeration set according to underlying */
   def Set64(underlying: Long) = new Set64(underlying)
 
   /** used to reverse engineer bit locations from pre-defined bit masks */
diff --git a/src/library/scala/List.scala b/src/library/scala/List.scala
index 48d986f0e8..99ebbcbb5f 100644
--- a/src/library/scala/List.scala
+++ b/src/library/scala/List.scala
@@ -538,7 +538,7 @@ sealed abstract class List[+A] extends Seq[A] with Product {
   /** Reverse the given prefix and append the current list to that.
    *  This function is equivalent to an application of <code>reverse</code>
    *  on the prefix followed by a call to <code>:::</code>, but more
-   *  efficient (and tail recursive).
+   *  efficient.
    *
    *  @param prefix the prefix to reverse and then prepend
    *  @return       the concatenation of the reversed prefix and the current list.