hixie: grammar fix (whatwg r3774)

hixie: grammar fix (whatwg r3774)

http://dev.w3.org/cvsweb/html5/spec/Overview.html?r1=1.2943&r2=1.2944&f=h
http://html5.org/tools/web-apps-tracker?from=3773&to=3774

===================================================================
RCS file: /sources/public/html5/spec/Overview.html,v
retrieving revision 1.2943
retrieving revision 1.2944
diff -u -d -r1.2943 -r1.2944
--- Overview.html 9 Sep 2009 07:36:12 -0000 1.2943
+++ Overview.html 9 Sep 2009 09:37:53 -0000 1.2944
@@ -2188,7 +2188,7 @@
   <p>The <dfn id="rules-for-parsing-non-negative-integers">rules for parsing non-negative integers</dfn> are as
   given in the following algorithm. When invoked, the steps must be
   followed in the order given, aborting at the first step that returns
-  a value. This algorithm will either return zero, a positive integer,
+  a value. This algorithm will return either zero, a positive integer,
   or an error. Leading spaces are ignored. Trailing spaces and any
   trailing garbage characters are ignored.</p>
 
@@ -2251,7 +2251,7 @@
   non-negative integers</a>, and are as given in the following
   algorithm. When invoked, the steps must be followed in the order
   given, aborting at the first step that returns a value. This
-  algorithm will either return an integer or an error. Leading spaces
+  algorithm will return either an integer or an error. Leading spaces
   are ignored. Trailing spaces and trailing garbage characters are
   ignored.</p>
 
@@ -2367,8 +2367,8 @@
 
   <p>The <dfn id="rules-for-parsing-floating-point-number-values">rules for parsing floating point number values</dfn> are
   as given in the following algorithm. This algorithm must be aborted
-  at the first step that returns something. This algorithm will either
-  return a number or an error. Leading spaces are ignored. Trailing
+  at the first step that returns something. This algorithm will return
+  either a number or an error. Leading spaces are ignored. Trailing
   spaces and garbage characters are ignored.</p>
 
   <ol><li><p>Let <var title="">input</var> be the string being
@@ -2629,7 +2629,7 @@
   <p>The <dfn id="rules-for-parsing-dimension-values">rules for parsing dimension values</dfn> are as given in
   the following algorithm. When invoked, the steps must be followed in
   the order given, aborting at the first step that returns a
-  value. This algorithm will either return a number greater than or
+  value. This algorithm will return either a number greater than or
   equal to 1.0, or an error; if a number is returned, then it is
   further categorized as either a percentage or a length.</p>
 
@@ -3092,7 +3092,7 @@
   </ol><div class="impl">
 
   <p>The rules to <dfn id="parse-a-month-string">parse a month string</dfn> are as follows. This
-  will either return a year and month, or nothing. If at any point the
+  will return either a year and month, or nothing. If at any point the
   algorithm says that it "fails", this means that it is aborted at
   that point and returns nothing.</p>
 
@@ -3111,7 +3111,7 @@
    <li><p>Return <var title="">year</var> and <var title="">month</var>.</li>
 
   </ol><p>The rules to <dfn id="parse-a-month-component">parse a month component</dfn>, given an <var title="">input</var> string and a <var title="">position</var>, are
-  as follows. This will either return a year and a month, or
+  as follows. This will return either a year and a month, or
   nothing. If at any point the algorithm says that it "fails", this
   means that it is aborted at that point and returns nothing.</p>
 
@@ -3157,7 +3157,7 @@
   </ol><div class="impl">
 
   <p>The rules to <dfn id="parse-a-date-string">parse a date string</dfn> are as follows. This
-  will either return a date, or nothing. If at any point the algorithm
+  will return either a date, or nothing. If at any point the algorithm
   says that it "fails", this means that it is aborted at that point
   and returns nothing.</p>
 
@@ -3177,7 +3177,7 @@
    <li><p>Return <var title="">date</var>.</li>
 
   </ol><p>The rules to <dfn id="parse-a-date-component">parse a date component</dfn>, given an <var title="">input</var> string and a <var title="">position</var>, are
-  as follows. This will either return a year, a month, and a day, or
+  as follows. This will return either a year, a month, and a day, or
   nothing. If at any point the algorithm says that it "fails", this
   means that it is aborted at that point and returns nothing.</p>
 
@@ -3243,7 +3243,7 @@
   60 or 61; leap seconds cannot be represented.<div class="impl">
 
   <p>The rules to <dfn id="parse-a-time-string">parse a time string</dfn> are as follows. This
-  will either return a time, or nothing. If at any point the algorithm
+  will return either a time, or nothing. If at any point the algorithm
   says that it "fails", this means that it is aborted at that point
   and returns nothing.</p>
 
@@ -3264,7 +3264,7 @@
    <li><p>Return <var title="">time</var>.</li>
 
   </ol><p>The rules to <dfn id="parse-a-time-component">parse a time component</dfn>, given an <var title="">input</var> string and a <var title="">position</var>, are
-  as follows. This will either return an hour, a minute, and a second,
+  as follows. This will return either an hour, a minute, and a second,
   or nothing. If at any point the algorithm says that it "fails", this
   means that it is aborted at that point and returns nothing.</p>
 
@@ -3344,7 +3344,7 @@
   </ol><div class="impl">
 
   <p>The rules to <dfn id="parse-a-local-date-and-time-string">parse a local date and time string</dfn> are as
-  follows. This will either return a date and time, or nothing. If at
+  follows. This will return either a date and time, or nothing. If at
   any point the algorithm says that it "fails", this means that it is
   aborted at that point and returns nothing.</p>
 
@@ -3466,7 +3466,7 @@
   time zone is UTC.</p>
 
   <p>The rules to <dfn id="parse-a-global-date-and-time-string">parse a global date and time string</dfn> are
-  as follows. This will either return a time in UTC, with associated
+  as follows. This will return either a time in UTC, with associated
   time-zone offset information for round tripping or display purposes,
   or nothing. If at any point the algorithm says that it "fails", this
   means that it is aborted at that point and returns nothing.</p>
@@ -3507,7 +3507,7 @@
    <li><p>Return <var title="">time</var> and <var title="">timezone</var>.</li>
 
   </ol><p>The rules to <dfn id="parse-a-time-zone-offset-component">parse a time-zone offset component</dfn>, given
-  an <var title="">input</var> string and a <var title="">position</var>, are as follows. This will either return
+  an <var title="">input</var> string and a <var title="">position</var>, are as follows. This will return either
   time-zone hours and time-zone minutes, or nothing. If at any point
   the algorithm says that it "fails", this means that it is aborted at
   that point and returns nothing.</p>
@@ -3603,7 +3603,7 @@
   </ol><div class="impl">
 
   <p>The rules to <dfn id="parse-a-week-string">parse a week string</dfn> are as follows. This
-  will either return a week-year number and week number, or
+  will return either a week-year number and week number, or
   nothing. If at any point the algorithm says that it "fails", this
   means that it is aborted at that point and returns nothing.</p>
 
@@ -3672,7 +3672,7 @@
   <hr><p>The rules to <dfn id="parse-a-date-or-time-string">parse a date or time string</dfn> are as
   follows. The algorithm is invoked with a flag indicating if the
   <i>in attribute</i> variant or the <i>in content</i> variant is to
-  be used. The algorithm will either return a <a href="#concept-date" title="concept-date">date</a>, a <a href="#concept-time" title="concept-time">time</a>, a <a href="#concept-datetime" title="concept-datetime">global date and time</a>, or nothing. If
+  be used. The algorithm will return either a <a href="#concept-date" title="concept-date">date</a>, a <a href="#concept-time" title="concept-time">time</a>, a <a href="#concept-datetime" title="concept-datetime">global date and time</a>, or nothing. If
   at any point the algorithm says that it "fails", this means that it
   is aborted at that point and returns nothing.</p>
 
@@ -3764,7 +3764,7 @@
   <p>The <dfn id="rules-for-parsing-simple-color-values">rules for parsing simple color values</dfn> are as given
   in the following algorithm. When invoked, the steps must be followed
   in the order given, aborting at the first step that returns a
-  value. This algorithm will either return a <a href="#simple-color">simple color</a>
+  value. This algorithm will return either a <a href="#simple-color">simple color</a>
   or an error.</p>
 
   <ol><li><p>Let <var title="">input</var> be the string being
@@ -3817,8 +3817,8 @@
   complicated manner, using the <dfn id="rules-for-parsing-a-legacy-color-value">rules for parsing a legacy color
   value</dfn>, which are given in the following algorithm. When
   invoked, the steps must be followed in the order given, aborting at
-  the first step that returns a value. This algorithm will either
-  return a <a href="#simple-color">simple color</a> or an error.</p>
+  the first step that returns a value. This algorithm will return
+  either a <a href="#simple-color">simple color</a> or an error.</p>
 
   <ol><li><p>Let <var title="">input</var> be the string being
    parsed.</li>

Received on Wednesday, 9 September 2009 09:51:59 UTC