Ticket #2511: mini_xml.patch

libs/spirit/doc/qi_and_karma/mini_xml.qbk

@@ -16 +16 @@
 departments, corporations. Then we'll have an AST representation of it all.
 
 In this example (actually two examples), we'll now explore parsers how to create
-ASTs. We will parse a minimalistic XML like language and compile the results
+ASTs. We will parse a minimalistic XML-like language and compile the results
 into our data structures in the form of a tree.
 
 Along the way, we'll see new features:
@@ -61 +61 @@
 
     node = (xml | text)                 [_val = _1];
 
-We'll see what a `mini_xml_node` structure later. Looking at the rule
-definition, we see some alternation goiing on here. An xml `node` is
+We'll see a `mini_xml_node` structure later. Looking at the rule
+definition, we see some alternation going on here. An xml `node` is
 either an `xml` OR `text`. Hmmm... hold on to that thought...
 
     rule<Iterator, std::string(), space_type> start_tag;
@@ -84 +84 @@
 
     !p
 
-It will try the parser, `p`. If it is successful, fail, otherwise, pass. In
+It will try the parser, `p`. If it is successful, fail; otherwise, pass. In
 other words, it negates the result of `p`. Like the `eps`, it does not consume
 any input though. It will always rewind the iterator position to where it
 was upon entry. So, the expression:
@@ -232 +232 @@
   local variable.
 
 There are no actions involved in stuffing data into our `xml` attribute. It's
-all taken cared of thatnks to the auto-rule.
+all taken care of thanks to the auto-rule.
 
 [endsect]