Reflow and revision

Author: JJ

doc/Language/grammar_tutorial.pod6

@@ -43,17 +43,17 @@ Grammars are a special kind of class. You declare and define a grammar exactly
 as you would any other class, except that you use the I<grammar> keyword instead
 of I<class>.
 
-    =begin code :skip-test
-    grammar G { ... }
-    =end code
+=begin code :skip-test
+grammar G { ... }
+=end code
 
-Grammars are made up of methods that define a regex, a token, or a rule.
-These are all varieties of different types of match methods. Once you have a
-grammar defined, you call it and pass in a string for parsing.
+As such classes, grammars are made up of methods that define a regex, a token,
+or a rule. These are all varieties of different types of match methods. Once you
+have a grammar defined, you call it and pass in a string for parsing.
 
-    =begin code :preamble<grammar G{};my $string;>
-    my $matchObject = G.parse($string);
-    =end code
+=begin code :preamble<grammar G{};my $string;>
+my $matchObject = G.parse($string);
+=end code
 
 Now, you may be wondering, if I have all these regexes defined that just return
 their results, how does that help with parsing strings that may be ahead
@@ -122,7 +122,6 @@ C<'clever_text_keyword'> B<must> be the first thing in the string, or
 the grammar parse will fail and we'll get an empty match. This is great for
 recognizing a malformed string that should be discarded.
 
-
 =head1 Learning by example - a REST contrivance
 
 Let's suppose we'd like to parse a URI into the component parts that make up a