Fix verbatim blocks of Doxygen comments.
* src/ltlast/formula.hh, src/ltlvisit/contain.hh, src/ltlvisit/randomltl.hh, src/ltlvisit/reduce.hh, src/ltlvisit/remove_x.hh, src/ltlvisit/simplify.hh, src/ltlvisit/snf.hh, src/misc/minato.hh, src/misc/optionmap.hh, src/saba/sabacomplementtgba.hh, src/taalgos/emptinessta.hh, src/taalgos/minimize.hh, src/taalgos/tgba2ta.hh, src/tgba/tgbakvcomplement.hh, src/tgbaalgos/cycles.hh, src/tgbaalgos/eltl2tgba_lacim.hh, src/tgbaalgos/gtec/gtec.hh, src/tgbaalgos/gv04.hh, src/tgbaalgos/ltl2taa.hh, src/tgbaalgos/ltl2tgba_fm.hh, src/tgbaalgos/ltl2tgba_lacim.hh, src/tgbaalgos/magic.hh, src/tgbaalgos/minimize.hh, src/tgbaalgos/randomgraph.hh, src/tgbaalgos/se05.hh, src/tgbaalgos/simulation.hh, src/tgbaalgos/tau03.hh, src/tgbaalgos/tau03opt.hh: Surround verbatim blocks with /** ... */ instead of using /// on each line. Otherwise Doxygen will output the leading "///" tokens -- apparently this is a feature. * src/sanity/style.test: Strip multi-line comments before checking code style.
This commit is contained in:
parent
1ec9cebe58
commit
1cd9b204ed
29 changed files with 758 additions and 745 deletions
|
|
@ -37,61 +37,61 @@ namespace spot
|
|||
/// During the visit of \a a, the returned checker stores explicitely all
|
||||
/// the traversed states. The implemented algorithm is the following:
|
||||
///
|
||||
/// \verbatim
|
||||
/// procedure check ()
|
||||
/// begin
|
||||
/// call dfs_blue(s0);
|
||||
/// end;
|
||||
///
|
||||
/// procedure dfs_blue (s)
|
||||
/// begin
|
||||
/// s.color = blue;
|
||||
/// s.acc = emptyset;
|
||||
/// for all t in post(s) do
|
||||
/// if t.color == white then
|
||||
/// call dfs_blue(t);
|
||||
/// end if;
|
||||
/// end for;
|
||||
/// for all t in post(s) do
|
||||
/// let (s, l, a, t) be the edge from s to t;
|
||||
/// if s.acc U a not included in t.acc then
|
||||
/// call dfs_red(t, a U s.acc);
|
||||
/// end if;
|
||||
/// end for;
|
||||
/// if s.acc == all_acc then
|
||||
/// report a cycle;
|
||||
/// end if;
|
||||
/// end;
|
||||
///
|
||||
/// procedure dfs_red(s, A)
|
||||
/// begin
|
||||
/// s.acc = s.acc U A;
|
||||
/// for all t in post(s) do
|
||||
/// if t.color != white and A not included in t.acc then
|
||||
/// call dfs_red(t, A);
|
||||
/// end if;
|
||||
/// end for;
|
||||
/// end;
|
||||
/// \endverbatim
|
||||
/** \verbatim
|
||||
procedure check ()
|
||||
begin
|
||||
call dfs_blue(s0);
|
||||
end;
|
||||
|
||||
procedure dfs_blue (s)
|
||||
begin
|
||||
s.color = blue;
|
||||
s.acc = emptyset;
|
||||
for all t in post(s) do
|
||||
if t.color == white then
|
||||
call dfs_blue(t);
|
||||
end if;
|
||||
end for;
|
||||
for all t in post(s) do
|
||||
let (s, l, a, t) be the edge from s to t;
|
||||
if s.acc U a not included in t.acc then
|
||||
call dfs_red(t, a U s.acc);
|
||||
end if;
|
||||
end for;
|
||||
if s.acc == all_acc then
|
||||
report a cycle;
|
||||
end if;
|
||||
end;
|
||||
|
||||
procedure dfs_red(s, A)
|
||||
begin
|
||||
s.acc = s.acc U A;
|
||||
for all t in post(s) do
|
||||
if t.color != white and A not included in t.acc then
|
||||
call dfs_red(t, A);
|
||||
end if;
|
||||
end for;
|
||||
end;
|
||||
\endverbatim */
|
||||
///
|
||||
/// This algorithm is the one presented in
|
||||
///
|
||||
/// \verbatim
|
||||
/// @techreport{HUT-TCS-A83,
|
||||
/// address = {Espoo, Finland},
|
||||
/// author = {Heikki Tauriainen},
|
||||
/// institution = {Helsinki University of Technology, Laboratory for
|
||||
/// Theoretical Computer Science},
|
||||
/// month = {December},
|
||||
/// number = {A83},
|
||||
/// pages = {132},
|
||||
/// title = {On Translating Linear Temporal Logic into Alternating and
|
||||
/// Nondeterministic Automata},
|
||||
/// type = {Research Report},
|
||||
/// year = {2003},
|
||||
/// url = {http://www.tcs.hut.fi/Publications/info/bibdb.HUT-TCS-A83.shtml}
|
||||
/// }
|
||||
/// \endverbatim
|
||||
/** \verbatim
|
||||
@techreport{HUT-TCS-A83,
|
||||
address = {Espoo, Finland},
|
||||
author = {Heikki Tauriainen},
|
||||
institution = {Helsinki University of Technology, Laboratory for
|
||||
Theoretical Computer Science},
|
||||
month = {December},
|
||||
number = {A83},
|
||||
pages = {132},
|
||||
title = {On Translating Linear Temporal Logic into Alternating and
|
||||
Nondeterministic Automata},
|
||||
type = {Research Report},
|
||||
year = {2003},
|
||||
url = {http://www.tcs.hut.fi/Publications/info/bibdb.HUT-TCS-A83.shtml}
|
||||
}
|
||||
\endverbatim */
|
||||
///
|
||||
emptiness_check* explicit_tau03_search(const tgba *a,
|
||||
option_map o = option_map());
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue