spell check

Author: dham

doc/source/0_preface.rst

@@ -184,7 +184,7 @@ The course Principles of Programming, and the notes on which this book is
 based, were first delivered in spring 2020, when university teaching was
 completely online during the COVID pandemic. I'd like to thank teaching fellow
 Dr Matthew Woolway who worked tirelessly with me on the module and who put
-together many of the tests on the exercies, and the graduate teaching
+together many of the tests on the exercises, and the graduate teaching
 assistants Miguel Boland, Sophia Vorderwuelbecke and Connor Ward whose
 professionalism in delivering the course in very complex circumstances was
 outstanding. Pulling out all the stops to deliver the written and video

doc/source/1_introduction.rst

@@ -123,7 +123,7 @@ references in this book are to that version.
 Within Python 3, there is a minor version release approximately every year.
 Once released, this receives security updates for 5 years. At the time of
 writing, Python 3.10 is the newest release version, and Python 3.6 is the
-oldest version that still recieves security fixes. The user-facing differences
+oldest version that still receives security fixes. The user-facing differences
 between minor Python versions are usually fairly minimal, so for the purposes
 of this book it doesn't matter which of the currently supported versions of
 Python you use. 

doc/source/2_programs_in_files.rst

@@ -75,7 +75,7 @@ IPython can now be run by simply typing:
 
     (PoP_venv) $ ipython
 
-This will result in output simiar to the following:
+This will result in output similar to the following:
 
 .. code-block:: ipython3
 

doc/source/4_style.rst

@@ -846,8 +846,8 @@ instead of:
 
 .. _repetition:
 
-Avoid repetitition
-..................
+Avoid repetition
+................
 
 Programmers very frequently need to do *nearly* the same thing over and over.
 One obvious way to do this is to write code for the first case, then copy and

doc/source/5_abstract_data_types.rst

@@ -724,7 +724,8 @@ Here we have introduced in some detail a few relatively simple abstract data
 types that illustrate the distinction between the mathematical properties of a
 type and the concrete details of its implementation. There are many other
 abstract data types, some of which you will have already met, and we will
-encouter a few more in this course. For context, here are a few other examples.
+encounter a few more in this course. For context, here are a few other
+examples.
 
 set
     A set is an unordered collection of objects with the property that objects

doc/source/6_exceptions.rst

@@ -618,7 +618,7 @@ the exception matches the list of exceptions is executed. For example:
     In this case, the except block will match any exception which is raised in
     the corresponding try block. Using unconstrained except blocks like this is
     a somewhat dangerous strategy. Usually, the except block will be designed
-    to deal with a particular type of exeptional circumstance. However, an
+    to deal with a particular type of exceptional circumstance. However, an
     except block that catches any exception may well be triggered by a completely
     different exception, in which case it will just make the error more
     confusing by obscuring where the issue actually occurred.

doc/source/8_debugging.rst

@@ -612,7 +612,7 @@ course in a perfect world where we have full test suite coverage of all
 functionality, and the test suite is run on every commit, this situation will
 never occur. However the reality is that test coverage is never complete, and
 there will always be untested functionality in any non-trivial piece of
-software. Regressions are a particularly vexxing form of bug: there is little
+software. Regressions are a particularly vexing form of bug: there is little
 more frustrating to be coming up to a deadline and to discover that something
 that used to work no longer does.
 

doc/source/9_trees_and_directed_acyclic_graphs.rst

@@ -645,7 +645,7 @@ operators but different for terminals.
         def __repr__(self):
             return type(self).__name__ + repr(self.operands)
 
-    This approch is valid because the string representation of a :class:`tuple`
+    This approach is valid because the string representation of a :class:`tuple`
     is a pair of round brackets containing the string representation of each
     item in the tuple.
 
@@ -1053,7 +1053,7 @@ algorithm.
             if unvisited_children:
                 push e onto stack # Not ready to visit this node yet.
                 # Need to visit children before e. 
-                push all unvisted_children onto stack
+                push all unvisited_children onto stack
             else:
                 # Any children of e have been visited, so we can visit it.
                 visited[e] = visitor(e, *(visited(o) for o in e.operands))

doc/source/a2_git.rst

@@ -298,7 +298,7 @@ formal course which the instructor has set up using GitHub classroom, or you
 are doing the exercises by yourself in private study. If you're using GitHub
 classroom as a part of a formal course where the instructor will be using
 GitHub classroom then follow the instructions in :numref:`accept_classroom`.
-If you're working on the exercises by yourself then follow the instructiosn in
+If you're working on the exercises by yourself then follow the instructions in
 :numref:`accept_template`.
 
 .. container:: vimeo