alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

org: run a spell checker on the documentation

Browse source 
* doc/org/autcross.org, doc/org/autfilt.org, doc/org/citing.org,
doc/org/compile.org, doc/org/concepts.org, doc/org/csv.org,
doc/org/dstar2tgba.org, doc/org/genaut.org, doc/org/genltl.org,
doc/org/hierarchy.org, doc/org/hoa.org, doc/org/index.org,
doc/org/install.org, doc/org/ltl2tgba.org, doc/org/ltl2tgta.org,
doc/org/ltlcross.org, doc/org/ltlfilt.org, doc/org/ltlgrind.org,
doc/org/ltlsynt.org, doc/org/oaut.org, doc/org/randaut.org,
doc/org/randltl.org, doc/org/satmin.org, doc/org/tut.org,
doc/org/tut01.org, doc/org/tut02.org, doc/org/tut03.org,
doc/org/tut04.org, doc/org/tut10.org, doc/org/tut11.org,
doc/org/tut12.org, doc/org/tut20.org, doc/org/tut21.org,
doc/org/tut22.org, doc/org/tut23.org, doc/org/tut24.org,
doc/org/tut30.org, doc/org/tut31.org, doc/org/tut50.org,
doc/org/tut51.org, doc/org/tut52.org, doc/org/tut90.org,
doc/org/upgrade2.org: Run ispell-buffer on all these.
* bin/autfilt.cc, python/spot/__init__.py: Fix typos in
help texts noticed while spell-checking the org files.
This commit is contained in:
Alexandre Duret-Lutz 2020-07-21 22:15:54 +02:00
parent 0fbc83e9c2
commit f3b8bf8e56
45 changed files with 317 additions and 194 deletions
Download patch file Download diff file Expand all files Collapse all files

15
doc/org/upgrade2.org
View file

@ -79,7 +79,7 @@ experience of updating a couple of projects that are using Spot.
=tgba_explicit_string= used to encode a TGBA using a graph whose
state was named using LTL formulas, integers, or strings) are
replaced by a =twa_graph= class in which the representation is
more complact and efficient, but where states are necessarily
more compact and efficient, but where states are necessarily
numbered. Many algorithms have been rewritten on top of this
=twa_graph= class, and this simplified them a lot.
@ -360,7 +360,7 @@ removed, ~8200 lines added), and brings some nice benefits:
- LTL/PSL formulas are now represented by lightweight formula
objects (instead of pointers to children of an abstract
formula class) that perform reference counting automatically.
- There is no hierachy anymore: all operators are represented by
- There is no hierarchy anymore: all operators are represented by
a single type of node in the syntax tree, and an enumerator is
used to distinguish between operators.
- Visitors have been replaced by member functions such as =map()=
@ -665,3 +665,14 @@ for (auto i: aut->succ(s))
| ~tgba_succ_iterator::current_acceptance_conditions()~ | ~twa_succ_iterator::acc()~ | |
| ~tgba_succ_iterator::current_condition()~ | ~twa_succ_iterator::cond()~ | |
| ~tgba_succ_iterator::current_state()~ | ~twa_succ_iterator::dst()~ | |
# LocalWords: utf html cpp BuDDy ptr TGBA tgba twa tgba renamings
# LocalWords: reimplemented cpp SRC bdd bddx BuDDy bvec bvecx fdd
# LocalWords: fddx dstarparse eltlparse iface kripke adhoc ltlast
# LocalWords: kripkeparse ltlenv ltlparse ltlvisit config sabaalgos
# LocalWords: neverparse saba taalgos tgbaalgos dualize tgbaparse
# LocalWords: libbdd libbddx lspot lbddx lbdd namespace ptr xargs
# LocalWords: typedefs sed aut taa tgta acc buchi myalgorithm succ
# LocalWords: iter num dst cond BDDs arg dstar dtgba dupexp bfs dfs
# LocalWords: instantiator hoaf lbtt tl simplifier boolean psl str
# LocalWords: lbt sclatex utg utf neverclaim scc