typos: dictionnary -> dictionary

* doc/org/upgrade2.org, tests/python/prodexpt.py,
tests/python/product.ipynb, NEWS: Fix typos.
* tests/sanity/style.test: Add a check for this.

NEWS

@@ -3514,7 +3514,7 @@ New in spot 0.0f (2003-08-01):
   * Tgba's output algorithms (save(), dotty()) now non-recursive.
   * During products, succ_iter will optimize its set of successors
     using information computed from the current product state.
-  * BDD dictionnaries are now shared between automata and.  This
+  * BDD dictionaries are now shared between automata and.  This
     gets rid of all the BDD-variable translating machinery.
 
 New in spot 0.0d (2003-07-13):

doc/org/upgrade2.org

@@ -46,7 +46,7 @@ experience of updating a couple of projects that are using Spot.
      used to require visitors.
 
   5. Allocated object that are large or expected to have a long life
-     (such as automata, BDD dictionnaries, accepting runs) are now
+     (such as automata, BDD dictionaries, accepting runs) are now
      [[#shared_ptr][returned using shared pointers]].
 
   6. Spot used to be centered around the concept of TGBA
@@ -587,7 +587,7 @@ for (auto i: aut->succ(s))
   }
 #+END_SRC
 
-- Each =twa= now has a BDD dictionnary, so the =get_dict()= method is
+- Each =twa= now has a BDD dictionary, so the =get_dict()= method is
   implemented once for all in =twa=, and should not be implemented
   anymore in sub-classes.
 

tests/python/prodexpt.py

@@ -1,6 +1,6 @@
 # -*- mode: python; coding: utf-8 -*-
-# Copyright (C) 2016  Laboratoire de Recherche et Développement
+# Copyright (C) 2016-2017 Laboratoire de Recherche et Développement de l'Epita
-# de l'Epita
+# (LRDE).
 #
 # This file is part of Spot, a model checking library.
 #
@@ -20,7 +20,7 @@
 import spot
 
 # make sure that we are not allowed to build the product of two automata with
-# different dictionnaries.
+# different dictionaries.
 
 aut1 = spot.translate('Xa')
 aut2 = spot.translate('Xb', dict=spot.make_bdd_dict())

tests/python/product.ipynb

@@ -732,7 +732,7 @@
       "\n",
       "We will build an automaton of type `twa_graph`, i.e., an automaton represented explicitely using a graph.  In those automata, states are numbered by integers, starting from `0`.  (Those states can also be given a different name, which is why the the `product()` shows us something that appears to be labeled by pairs, but the real identifier of each state is an integer.)\n",
       "\n",
-      "We will use a dictionnary to keep track of the association between a pair `(ls,rs)` of input states, and its number in the output."
+      "We will use a dictionary to keep track of the association between a pair `(ls,rs)` of input states, and its number in the output."
      ]
     },
     {
@@ -2064,4 +2064,4 @@
    "metadata": {}
   }
  ]
-}
+}

tests/sanity/style.test

@@ -1,7 +1,7 @@
 #! /bin/sh
 # -*- coding: utf-8 -*-
-# Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016
+# Copyright (C) 2009-2017 Laboratoire de Recherche et Développement de
-# Laboratoire de Recherche et Développement de l'Epita (LRDE).
+# l'Epita (LRDE).
 # Copyright (C) 2004, 2005 Laboratoire d'Informatique de Paris 6
 # (LIP6), département Systèmes Répartis Coopératifs (SRC), Université
 # Pierre et Marie Curie.
@@ -84,6 +84,10 @@ for dir in "$TOP/spot" "$TOP/bin" "$TOP/tests"; do
     $GREP -i 'accepting cond' $file &&
       diag 'accepting -> acceptance'
 
+    # Check this before stripping comments and strings.
+    $GREP -i 'dictionnar[yi]' $file &&
+      diag 'dictionnary -> dictionary'
+
     $GREP -i 'version 2 of the License' $file &&
       diag 'license text should refer to version 2'
     $GREP -i 'Temple Place' $file &&