Fixing up epub issues

These caused rendering issues in the output of Pandoc. Detected via:
* Bluefire Reader
* iBooks
* Calibre editor

Issues:
* `<br>`, apparently
* unbalanced tags
* code with what looked like html `<tags>`, outside of \`\`\` blocks

Author: pronoiac

docs/chapter1.md

@@ -1,9 +1,8 @@
-## Introduction to Lisp {docsify-ignore}
+# Chapter 1 {docsify-ignore}
+## Introduction to Lisp
 
-<blockquote>
-  You think you know when you learn, are more sure when you can write, even more when you can teach, but certain when you can program. <br><br>
-  <footer>— <cite><a title="Alan Perlis">Alan Perlis, Yale University computer scientist</a></cite></footer>
-</blockquote>
+> You think you know when you learn, are more sure when you can write, even more when you can teach, but certain when you can program.  
+> - Alan Perlis, Yale University computer scientist
 
 This chapter is for people with little or no experience in Lisp. Readers who feel confident in their Lisp programming ability can quickly skim the chapter or skip it entirely. This  chapter necessarily moves quickly, so those with little programming experience, or any reader who finds this chapter tough going, should seek out a supplementary introductory text. My recommendations are in the preface. 
 
@@ -47,7 +46,7 @@ such as doing multiplications and divisions before sums and differences. We will
 Sometimes programmers who are familiar with other languages have preconceptions that make it difficult for them to learn Lisp. For them, three points are worth stressing here. First, many other languages make a distinction between statements and expressions. An expression, like `2 + 2`, has a value, but a statement, like `x = 2 + 2`, does not. Statements have effects, but they do not return values. In Lisp, there is no such distinction: every expression returns a value. It is true that some expressions have effects, but even those expressions also return values. 
 
 Second, the lexical rules for Lisp are much simpler than the rules for other languages. In particular, there are fewer punctuation characters: only parentheses, quote marks (single, double, and backward), spaces, and the comma serve to separate symbols from each other. Thus, while the statement `y=a*x+3` is analyzed as seven separate tokens in other languages, in Lisp it would be treated as a single symbol. To get a list of tokens, we would have to insert spaces:
-<br> `(y = a * x + 3)`. 
+`(y = a * x + 3)`. 
 
 Third, while many languages use semicolons to delimit statements. Lisp has no need of semicolons, since expressions are delimited by parentheses. Lisp chooses to use semicolons for another purpose—to mark the beginning of a comment, which lasts until the end of the line: 
 
@@ -1230,22 +1229,22 @@ that automatically indent), a much simpler program is possible:
 "Morton Downey, Jr.," and whatever other cases you can think of. 
 
 &#9635; **Exercise 1.2 [m]** Write a function to exponentiate, or raise a number to an integer power. 
-<br>For example: <code>(power 3 2) = 3<sup>2</sup> = 9.</code>
+For example: <code>(power 3 2) = 3<sup>2</sup> = 9.</code>
 
 &#9635; **Exercise 1.3 [m]** Write a function that counts the number of atoms in an expression. 
-<br>For example: `(count-atoms '(a (b) c)) = 3`. Notice that there is something of an 
+For example: `(count-atoms '(a (b) c)) = 3`. Notice that there is something of an 
 ambiguity in this: 
-<br>should `(a nil c)` count as three atoms, or as two, because it is 
+should `(a nil c)` count as three atoms, or as two, because it is 
 equivalent to `(a () c)`?
 
 &#9635; **Exercise 1.4 [m]** Write a function that counts the number of times an expression 
 occurs anywhere within another expression. 
-<br>Example: <code>(count-anywhere 'a '(a ((a) b) a)) &rArr; 3</code>. 
+Example: <code>(count-anywhere 'a '(a ((a) b) a)) &rArr; 3</code>. 
 
 &#9635; **Exercise 1.5 [m]** Write a function to compute the dot product of two sequences 
 of numbers, represented as lists. The dot product is computed by multiplying 
 corresponding elements and then adding up the resulting products. 
-<br>Example: <code>(dot-product ' (10 20) ' (3 4)) = 10 x 3 + 20 x 4 = 110</code>
+Example: <code>(dot-product ' (10 20) ' (3 4)) = 10 x 3 + 20 x 4 = 110</code>
 
 
 ### 1.12 Answers 

docs/chapter15.md

@@ -769,7 +769,7 @@ or (9(n^)), he uses a fine-grained analysis that computes the constant factors (
 variety of polynomials, an exponentiation algorithm based on the binomial theorem 
 is best. The binomial theorem states that 
 
-(a + b)<sup>n = &Sigma; TK
+(a + b)<sup>n</sup> = &Sigma; TK
 
 
 i=0 

docs/chapter3.md

@@ -1943,7 +1943,7 @@ was printed, along with two possibilities for continuing. The user selected one,
 in a call to make - por r i dge for the new value, and the function succesfully continued. 
 
 <a id='page-90'></a>
-
+```lisp
 > (eat-porridge momma-bear) 
 Error: #<MOMMA BEAR>*s porridge is not just right: 39 
 Restart actions (select using :continue): 
@@ -1954,6 +1954,8 @@ Restart actions (select using :continue):
 Form to evaluate and use to replace (BEAR-PORRIDGE BEAR): 
 (make-porridge :temperature just-right) 
 nil 
+```
+
 It may seem like wasted effort to spend time writing assertions that (if all goes well) 
 will never be used. However, for all but the perfect programmer, bugs do occur, and 
 the time spent antibugging will more than pay for itself in saving debugging time. 

docs/chapter5.md

@@ -1,9 +1,8 @@
+# Chapter 5 {docsify-ignore}
 ## ELIZA: Dialog with a Machine {docsify-ignore}
 
-<blockquote>
-  It is said that to explain is to explain away. <br><br>
-  <footer>— <cite><a title="Joseph Weizenbaum">Joseph Weizenbaum, MIT computer scientist</a></cite></footer>
-</blockquote>
+> It is said that to explain is to explain away.  
+> - Joseph Weizenbaum, MIT computer scientist
 
 This chapter and the rest of part I will examine three more well-known AI programs of
 the 1960s. ELIZA held a conversation with the user in which it simulated a psychotherapist.

docs/chapter8.md

@@ -874,7 +874,7 @@ with each of the factors. If none of them work, we return an expression indicati
 that the integral is unknown. 
 
 <a id='page-256'></a>
-
+```lisp
 (defun integrate (exp x) 
 First try some trivial cases 
 
@@ -919,6 +919,7 @@ and elements that don't."
 (push item no-list))) 
 
 (values (nreverse yes-list) (nreverse no-list)))) 
+```
 
 <a id='page-257'></a>
 Note that the place in integrate where other techniques could be added is