Merge pull request dotnet#468 from vladris/master

Spelling fixes for System.Text.RegularExpressions

src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/Regex.cs

@@ -341,7 +341,7 @@ public int[] GetGroupNumbers()
         }
 
         /*
-         * Given a group number, maps it to a group name. Note that nubmered
+         * Given a group number, maps it to a group name. Note that numbered
          * groups automatically get a group name that is the decimal string
          * equivalent of its number.
          *
@@ -377,7 +377,7 @@ public String GroupNameFromNumber(int i)
         }
 
         /*
-         * Given a group name, maps it to a group number. Note that nubmered
+         * Given a group name, maps it to a group number. Note that numbered
          * groups automatically get a group name that is the decimal string
          * equivalent of its number.
          *

src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/RegexBoyerMoore.cs

@@ -3,7 +3,7 @@
 
 // The RegexBoyerMoore object precomputes the Boyer-Moore
 // tables for fast string scanning. These tables allow
-// you to scan for the first occurance of a string within
+// you to scan for the first occurrence of a string within
 // a large body of text without examining every character.
 // The performance of the heuristic depends on the actual
 // string and the text being searched, but usually, the longer
@@ -141,7 +141,7 @@ internal RegexBoyerMoore(String pattern, bool caseInsensitive, bool rightToLeft,
 
             // The inside of the if statement used to say
             // "_positive[match] = last - beforefirst;"
-            // This is slightly less agressive in how much we skip, but at worst it
+            // This is slightly less aggressive in how much we skip, but at worst it
             // should mean a little more work rather than skipping a potential match.
             while (match != beforefirst)
             {
@@ -266,7 +266,7 @@ internal bool IsMatch(String text, int index, int beglimit, int endlimit)
         }
 
         /// <summary>
-        /// Scan uses the Boyer-Moore algorithm to find the first occurrance
+        /// Scan uses the Boyer-Moore algorithm to find the first occurrence
         /// of the specified string within text, beginning at index, and
         /// constrained within beglimit and endlimit.
         ///

src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/RegexCharClass.cs

@@ -491,7 +491,7 @@ internal void AddCharClass(RegexCharClass cc)
         }
 
         /// <summary>
-        /// Adds a set (specified by its string represenation) to the class.
+        /// Adds a set (specified by its string representation) to the class.
         /// </summary>
         private void AddSet(String set)
         {

src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/RegexInterpreter.cs

@@ -618,7 +618,7 @@ protected override void Go()
                             // with each iteration of the loop, and therefore with every attempted
                             // match of the inner expression.  We'll try to match the inner expression,
                             // then go back to Lazybranchmark if successful.  If the inner expression
-                            // failes, we go to Lazybranchmark | RegexCode.Back2
+                            // fails, we go to Lazybranchmark | RegexCode.Back2
                             int pos;
 
                             TrackPop(2);

src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/RegexMatchTimeoutException.cs

@@ -21,9 +21,9 @@ public class RegexMatchTimeoutException : TimeoutException
         /// <summary>
         /// Constructs a new RegexMatchTimeoutException.
         /// </summary>
-        /// <param name="regexInput">Matching timeout occured during mathing within the specified input.</param>
-        /// <param name="regexPattern">Matching timeout occured during mathing to the specified pattern.</param>
-        /// <param name="matchTimeout">Matching timeout occured becasue matching took longer than the specified timeout.</param>
+        /// <param name="regexInput">Matching timeout occurred during matching within the specified input.</param>
+        /// <param name="regexPattern">Matching timeout occurred during matching to the specified pattern.</param>
+        /// <param name="matchTimeout">Matching timeout occurred because matching took longer than the specified timeout.</param>
         public RegexMatchTimeoutException(string regexInput, string regexPattern, TimeSpan matchTimeout) :
             base(SR.RegexMatchTimeoutException_Occurred)
         {

src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/RegexNode.cs

@@ -76,7 +76,7 @@ internal sealed class RegexNode
         internal const int EndZ = RegexCode.EndZ;                       //          \Z
         internal const int End = RegexCode.End;                         //          \z
 
-        // Interior nodes do not correpond to primitive operations, but
+        // Interior nodes do not correspond to primitive operations, but
         // control structures compositing other operations
 
         // Concat and alternate take n children, and can run forward or backwards

src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/RegexParser.cs

@@ -1175,7 +1175,7 @@ internal RegexNode ScanBasicBackslash()
         }
 
         /*
-         * Scans $ patterns recognized within replacment patterns
+         * Scans $ patterns recognized within replacement patterns
          */
         internal RegexNode ScanDollar()
         {

src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/RegexReplacement.cs

@@ -176,7 +176,7 @@ internal String Replacement(Match match)
         // replace (evaluator), and split.
 
         /// <summary>
-        /// Replaces all ocurrances of the regex in the string with the
+        /// Replaces all occurrences of the regex in the string with the
         /// replacement pattern.
         ///
         /// Note that the special case of no matches is handled on its own:
@@ -255,7 +255,7 @@ internal String Replace(Regex regex, String input, int count, int startat)
         }
 
         /// <summary>
-        /// Replaces all ocurrances of the regex in the string with the
+        /// Replaces all occurrences of the regex in the string with the
         /// replacement evaluator.
         ///
         /// Note that the special case of no matches is handled on its own:

src/System.Text.RegularExpressions/src/System/Text/RegularExpressions/RegexRunner.cs

@@ -339,7 +339,7 @@ private Match TidyMatch(bool quick)
         }
 
         /// <summary>
-        /// Called by the implemenation of Go() to increase the size of storage
+        /// Called by the implementation of Go() to increase the size of storage
         /// </summary>
         protected void EnsureStorage()
         {
@@ -350,7 +350,7 @@ protected void EnsureStorage()
         }
 
         /// <summary>
-        /// Called by the implemenation of Go() to decide whether the pos
+        /// Called by the implementation of Go() to decide whether the pos
         /// at the specified index is a boundary or not. It's just not worth
         /// emitting inline code for this logic.
         /// </summary>
@@ -378,7 +378,7 @@ protected static bool CharInClass(char ch, String charClass)
         }
 
         /// <summary>
-        /// Called by the implemenation of Go() to increase the size of the
+        /// Called by the implementation of Go() to increase the size of the
         /// backtracking stack.
         /// </summary>
         protected void DoubleTrack()
@@ -393,7 +393,7 @@ protected void DoubleTrack()
         }
 
         /// <summary>
-        /// Called by the implemenation of Go() to increase the size of the
+        /// Called by the implementation of Go() to increase the size of the
         /// grouping stack.
         /// </summary>
         protected void DoubleStack()