Adding a link to the wikipedia page describing BNF.

git-svn-id: https://svn.apache.org/repos/asf/httpd/httpd/trunk@1065758 13f79535-47bb-0310-9956-ffa450edef68

diff --git a/docs/manual/expr.html.en b/docs/manual/expr.html.en
index cc1f3d04ffd933f00c8932fb30af8ac3292bb4a8..89b93954d915e3b899335f87aeffb8c8e7d18f7b 100644 (file)
--- a/docs/manual/expr.html.en
+++ b/docs/manual/expr.html.en
@@ -28,7 +28,7 @@
         This document describes the <em>ap_expr</em> expression parser.
     </p>
   </div>
-<div id="quickview"><ul id="toc"><li><img alt="" src="./images/down.gif" /> <a href="#grammar">Grammar in BNF notation</a></li>
+<div id="quickview"><ul id="toc"><li><img alt="" src="./images/down.gif" /> <a href="#grammar">Grammar in Backus&#8211;Naur Form notation</a></li>
 <li><img alt="" src="./images/down.gif" /> <a href="#vars">Variables</a></li>
 <li><img alt="" src="./images/down.gif" /> <a href="#binop">Binary operators</a></li>
 <li><img alt="" src="./images/down.gif" /> <a href="#unnop">Unary operators</a></li>
@@ -37,8 +37,11 @@
 </ul><h3>See also</h3><ul class="seealso"><li><code class="directive"><a href="./mod/core.html#if">If</a></code></li><li><code class="module"><a href="./mod/mod_rewrite.html">mod_rewrite</a></code></li><li><code class="module"><a href="./mod/mod_include.html">mod_include</a></code></li><li><code class="module"><a href="./mod/mod_setenvif.html">mod_setenvif</a></code></li><li><code class="directive"><a href="./mod/mod_ssl.html#sslrequire">SSLRequire</a></code></li><li><code class="directive"><a href="./mod/mod_filter.html#filterprovider">FilterProvider</a></code></li></ul></div>
 <div class="top"><a href="#page-header"><img alt="top" src="./images/up.gif" /></a></div>
 <div class="section">
-<h2><a name="grammar" id="grammar">Grammar in BNF notation</a></h2>
+<h2><a name="grammar" id="grammar">Grammar in Backus&#8211;Naur Form notation</a></h2>
     
+      <p><a href="http://en.wikipedia.org/wiki/Backus%E2%80%93Naur_Form">Backus&#8211;Naur Form</a> (BNF) is a notation
+      technique for context-free grammars, often used to describe the syntax of languages used in computing.
+      </p>
 <blockquote>
 <pre>
 expr        ::= "<strong>true</strong>" | "<strong>false</strong>"

diff --git a/docs/manual/expr.xml b/docs/manual/expr.xml
index 1b0e1a6f54401fdc40ef33495b7ad04c4f3c8c12..c0a41b9b3baf7dc27e7794ae68a2543d7aabfee6 100644 (file)
--- a/docs/manual/expr.xml
+++ b/docs/manual/expr.xml
@@ -41,7 +41,10 @@
 <seealso><directive module="mod_filter">FilterProvider</directive></seealso>
 
   <section id="grammar">
-    <title>Grammar in BNF notation</title>
+    <title>Grammar in Backus–Naur Form notation</title>
+      <p><a href="http://en.wikipedia.org/wiki/Backus%E2%80%93Naur_Form">Backus–Naur Form</a> (BNF) is a notation
+      technique for context-free grammars, often used to describe the syntax of languages used in computing.
+      </p>
 <blockquote>
 <pre>
 expr        ::= "<strong>true</strong>" | "<strong>false</strong>"