[selectors] Make the algos use the new grammar terms. Some minor Bikeshed/spelling fixes too.

Author: tabatkins

selectors/Overview.bs

@@ -3243,7 +3243,7 @@ Evaluating a Selector</h3>
 	before something <em>is</em> exposed.
 
 
-<h3 id='parse-selector'>
+<h3 id='parse-selector' algorithm>
 Parse A Selector</h3>
 
 	This section defines how to <dfn export>parse a selector</dfn> from a string <var>source</var>.
@@ -3252,7 +3252,7 @@ Parse A Selector</h3>
 
 	<ol>
 		<li>
-			Let <var>selector</var> be the result of parsing <var>source</var> against the <code>complex_selector_list</code> grammar.
+			Let <var>selector</var> be the result of parsing <var>source</var> as a <<selector-list>>.
 			If it does not match the grammar,
 			return failure.
 
@@ -3268,7 +3268,7 @@ Parse A Selector</h3>
 			return <var>selector</var>.
 	</ol>
 
-<h3 id='parse-relative-selector'>
+<h3 id='parse-relative-selector' algorithm>
 Parse A Relative Selector</h3>
 
 	This section defines how to <dfn export>parse a relative selector</dfn> from a string <var>source</var>,
@@ -3278,7 +3278,7 @@ Parse A Relative Selector</h3>
 
 	<ol>
 		<li>
-			Let <var>selector</var> be the result of parsing <var>source</var> against the <code>scope_relative_selector_list</code> grammar.
+			Let <var>selector</var> be the result of parsing <var>source</var> as a <<relative-selector-list>>.
 			If it does not match the grammar,
 			return failure.
 
@@ -3297,7 +3297,7 @@ Parse A Relative Selector</h3>
 			Return <var>selector</var>.
 	</ol>
 
-<h3 id='match-against-tree'>
+<h3 id='match-against-tree' algorithm>
 Match a Selector Against A Tree</h3>
 
 	This section defines how to <dfn export>match a selector against a tree</dfn>.
@@ -3310,7 +3310,7 @@ Match a Selector Against A Tree</h3>
 		<li>
 			A <a>scoping method</a> and <a>scoping root</a>.
 			If not specified,
-			the selector defaults to being unscoped.
+			the <var>selector</var> defaults to being unscoped.
 
 		<li>
 			A set of <a>:scope elements</a>,
@@ -3334,7 +3334,7 @@ Match a Selector Against A Tree</h3>
 			and return the result.
 	</ol>
 
-<h3 id='match-against-element'>
+<h3 id='match-against-element' algorithm>
 Match a Selector Against an Element</h3>
 
 	This section defines how to <dfn export>match a selector against an element</dfn>.
@@ -3368,7 +3368,7 @@ Appendix A: Guidance on Mapping Source Documents &amp; Data to an Element Tree</
 	<em>This section is informative.</em>
 
 	The element tree structure described by the DOM is powerful and useful,
-	but generic enough to model pretty much any langauge that describes tree-based data
+	but generic enough to model pretty much any language that describes tree-based data
 	(or even graph-based, with a suitable interpretation).
 
 	Some languages, like HTML, already have well-defined procedures