Improve markdown guidelines wording

Amongst the changes here is that we do not need to have the hex or html
code (numbers) for open and close parentheses (in links) as there are
names. '(' is & followed by lpar; and the ')' is the same but 'rpar;'
instead. This makes it easier to remember and type and it generates the
same html as well (they are all valid). Now the markdown files are
consistent in this (in some cases hex was used and in others the html
code).

Although many markdown files were updated no html files needed to be
updated as it generates the same html. Even so I ran the appropriate
rules to do so just to verify this.

1992/buzzard.2/README.md

@@ -137,7 +137,7 @@ part.
 
 For more information on what you can do once you've piped [third](%%REPO_URL%%/1992/buzzard.2/third) into
 first, type `help` and consult
-[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) manuals for
+[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) manuals for
 further reference.  Six sample THIRD programs are included in the files
 `demo1.th` through `demo6.th`.  See [buzzard.2.README.html](buzzard.2.README.html)
 for more information.
@@ -157,7 +157,7 @@ tackle this project.
 on smaller machines; `m[]` needs to be at least 2000 long, though.
 
 I say `first` is portable mainly because it uses native types.  Unlike
-[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)), which
+[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)), which
 traditionally allows byte and multi-byte operations, all operations are
 performed on C `int`s.  That means `first` code is only as portable as the same
 code would be in C.  As in C, the result of dividing `-1` by `2` is machine (or
@@ -190,7 +190,7 @@ answer the question "what will this do when I run it".  A reader who has
 deciphered `first` to this point may think they know the answer to this
 question, but they may not know the answer to the more important question, "what
 will this program do when given the right input?"
-[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) aficionados,
+[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) aficionados,
 and especially FORTH implementers, may recognize the similarity of the internal
 compiler format to many FORTH internal representations, and, being aware that
 FORTH interpreters can often be self-compiling, may be suspicious that this
@@ -205,7 +205,7 @@ represents a step backwards, in more ways than one.)
 ### What exactly is `first`, then?
 
 `first` is a tiny interpreter which implements a sufficient pseudo-subset of
-[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) to allow it
+[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) to allow it
 to bootstrap a relatively complete version of FORTH (based loosely on forth79),
 which I call THIRD.  Complete relative to what, I'm not sure.
 
@@ -217,11 +217,11 @@ the design file, design, I give a justification for why each primitive in
 
 THIRD is sorta slow, because `first` has so few primitives that many things that
 are primitives in
-[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) (like swap)
+[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) (like swap)
 take a significant amount of time in THIRD.
 
 When you get the `Ok.` message from `third`, try out some sample
-[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) code
+[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) code
 (`first` has no way of knowing if keyboard input is waiting, so it can't actually prompt
 you in a normal way.  It only prints `'Ok.'` after you define a word).
 
@@ -266,7 +266,7 @@ If you compile the basic THIRD system without the help word (strings take up one
 1000 `int`s (plus the return stack).
 
 Thus THIRD gives you a relatively complete
-[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) system in
+[FORTH](https://en.wikipedia.org/wiki/Forth_(programming_language)) system in
 less than 700 chars of C source + about 1000 `int`s of memory--and it's portable
 too (you could copy over the THIRD memory dump to another machine, in theory).
 If the above numbers seem to you to be mixing apples and oranges (C source and