Typos

Author: eliasdiem

ch02/2.2/2.2.md

@@ -95,16 +95,16 @@ the following languages. In each case show that your grammar is correct.
 
 #### Answer
 
-1. proof
+1. Proof
 
-    any string derived from the grammar can be considered to be a sequence consisting of 11 and 1001, where each sequence element is possibly suffixed with a 0.
+    Any string derived from the grammar can be considered to be a sequence consisting of 11 and 1001, where each sequence element is possibly suffixed with a 0.
 
-    let `n` be the set of positions where `11` is placed. `11` is said to be at position `i` if the first `1` in `11` is at position `i`, where `i` starts at 0 and
+    Let `n` be the set of positions where `11` is placed. `11` is said to be at position `i` if the first `1` in `11` is at position `i`, where `i` starts at 0 and
     grows from least significant to most significant bit.
 
-    let `m` be the equivalent set for `1001`.
+    Let `m` be the equivalent set for `1001`.
 
-    the sum of any string produced by the grammar is:
+    The sum of any string produced by the grammar is:
 
     sum
 
@@ -115,7 +115,8 @@ the following languages. In each case show that your grammar is correct.
     This is clearly divisible by 3.
 
 
-2. No. Consider string "10101", it is divisible by 3, but cannot derived from the grammar.
+2. No. Consider the string "10101", which is divisible by 3, but cannot be
+   derived from the grammar.
 
    Readers seeking a more formal proof can read about it below: