From e27b25878c7825864313a6bbc0ec553e7e9832bf Mon Sep 17 00:00:00 2001 From: Tomas Pecka <peckato1@fit.cvut.cz> Date: Sat, 20 Nov 2021 14:11:00 +0100 Subject: [PATCH] algo: Fix some typos in exported documentation --- alib2algo/src/regexp/convert/ToAutomaton.cpp | 4 ++-- alib2algo/src/regexp/convert/ToAutomaton.h | 4 ++-- alib2algo/src/regexp/convert/ToAutomatonDerivation.cpp | 4 ++-- alib2algo/src/regexp/convert/ToAutomatonDerivation.h | 2 +- alib2algo/src/regexp/convert/ToAutomatonGlushkov.cpp | 4 ++-- alib2algo/src/regexp/convert/ToAutomatonGlushkov.h | 2 +- alib2algo/src/regexp/convert/ToAutomatonThompson.cpp | 4 ++-- alib2algo/src/regexp/convert/ToAutomatonThompson.h | 2 +- alib2algo/src/regexp/convert/ToGrammarRightRGDerivation.cpp | 4 ++-- alib2algo/src/regexp/convert/ToGrammarRightRGDerivation.h | 2 +- alib2algo/src/regexp/convert/ToGrammarRightRGGlushkov.cpp | 4 ++-- alib2algo/src/regexp/convert/ToGrammarRightRGGlushkov.h | 2 +- alib2algo/src/rte/convert/ToPostfixPushdownAutomaton.h | 2 +- .../src/rte/convert/ToPostfixPushdownAutomatonGlushkovNaive.h | 2 +- 14 files changed, 21 insertions(+), 21 deletions(-) diff --git a/alib2algo/src/regexp/convert/ToAutomaton.cpp b/alib2algo/src/regexp/convert/ToAutomaton.cpp index bbfd40e0fa..be8be96187 100644 --- a/alib2algo/src/regexp/convert/ToAutomaton.cpp +++ b/alib2algo/src/regexp/convert/ToAutomaton.cpp @@ -7,12 +7,12 @@ auto ToAutomatonFormalRegExp = registration::AbstractRegister < regexp::convert: "Converts the regular expression into an automaton (@sa regexp::convert::ToGlushkovAutomaton::convert).\n\ \n\ @param regexp the regular expression\n\ -@return finite automaotn equivalent to original regular expression" ); +@return finite automaton equivalent to original regular expression" ); auto ToAutomatonUnboundedRegExp = registration::AbstractRegister < regexp::convert::ToAutomaton, automaton::NFA < DefaultSymbolType, ext::pair < DefaultSymbolType, unsigned > >, const regexp::UnboundedRegExp < > & > ( regexp::convert::ToAutomaton::convert, "regexp" ).setDocumentation ( "Converts the regular expression into an automaton (@sa regexp::convert::ToGlushkovAutomaton::convert).\n\ \n\ @param regexp the regular expression\n\ -@return finite automaotn equivalent to original regular expression" ); +@return finite automaton equivalent to original regular expression" ); } /* namespace */ diff --git a/alib2algo/src/regexp/convert/ToAutomaton.h b/alib2algo/src/regexp/convert/ToAutomaton.h index 0ca0e86c07..d12de0fd3b 100644 --- a/alib2algo/src/regexp/convert/ToAutomaton.h +++ b/alib2algo/src/regexp/convert/ToAutomaton.h @@ -25,7 +25,7 @@ public: * * \param regexp the regular expression * - * \return finite automaotn equivalent to original regular expression + * \return finite automaton equivalent to original regular expression */ template < class SymbolType > static automaton::NFA < SymbolType, ext::pair < SymbolType, unsigned > > convert ( const regexp::FormalRegExp < SymbolType > & regexp ); @@ -37,7 +37,7 @@ public: * * \param regexp the regular expression * - * \return finite automaotn equivalent to original regular expression + * \return finite automaton equivalent to original regular expression */ template < class SymbolType > static automaton::NFA < SymbolType, ext::pair < SymbolType, unsigned > > convert ( const regexp::UnboundedRegExp < SymbolType > & regexp ); diff --git a/alib2algo/src/regexp/convert/ToAutomatonDerivation.cpp b/alib2algo/src/regexp/convert/ToAutomatonDerivation.cpp index 72a91169a9..6dc66d477c 100644 --- a/alib2algo/src/regexp/convert/ToAutomatonDerivation.cpp +++ b/alib2algo/src/regexp/convert/ToAutomatonDerivation.cpp @@ -4,13 +4,13 @@ namespace { auto ToAutomatonDerivationFormalRegExp = registration::AbstractRegister < regexp::convert::ToAutomatonDerivation, automaton::DFA < DefaultSymbolType, unsigned >, const regexp::FormalRegExp < > & > ( regexp::convert::ToAutomatonDerivation::convert ).setDocumentation ( -"Implements conversion of regular expressions to finite automata usign Brzozowski's derivation algorithm.\n\ +"Implements conversion of regular expressions to finite automata using Brzozowski's derivation algorithm.\n\ \n\ @param regexp the regexp to convert\n\ @return finite automaton accepting the language described by the original regular expression" ); auto ToAutomatonDerivationUnboundedRegExp = registration::AbstractRegister < regexp::convert::ToAutomatonDerivation, automaton::DFA < DefaultSymbolType, unsigned >, const regexp::UnboundedRegExp < > & > ( regexp::convert::ToAutomatonDerivation::convert, "regexp" ).setDocumentation ( -"Implements conversion of regular expressions to finite automata usign Brzozowski's derivation algorithm.\n\ +"Implements conversion of regular expressions to finite automata using Brzozowski's derivation algorithm.\n\ \n\ @param regexp the regexp to convert\n\ @return finite automaton accepting the language described by the original regular expression" ); diff --git a/alib2algo/src/regexp/convert/ToAutomatonDerivation.h b/alib2algo/src/regexp/convert/ToAutomatonDerivation.h index 7c1a4b0fac..349ee8ff1f 100644 --- a/alib2algo/src/regexp/convert/ToAutomatonDerivation.h +++ b/alib2algo/src/regexp/convert/ToAutomatonDerivation.h @@ -26,7 +26,7 @@ namespace convert { class ToAutomatonDerivation { public: /** - * Implements conversion of regular expressions to finite automata usign Brzozowski's derivation algorithm. + * Implements conversion of regular expressions to finite automata using Brzozowski's derivation algorithm. * * \tparam T the type of regular expression to convert * \tparam SymbolType the type of symbols in the regular expression diff --git a/alib2algo/src/regexp/convert/ToAutomatonGlushkov.cpp b/alib2algo/src/regexp/convert/ToAutomatonGlushkov.cpp index 9d57a35b5d..aaebf39d08 100644 --- a/alib2algo/src/regexp/convert/ToAutomatonGlushkov.cpp +++ b/alib2algo/src/regexp/convert/ToAutomatonGlushkov.cpp @@ -4,13 +4,13 @@ namespace { auto ToAutomatonGlushkovUnboundedRegExp = registration::AbstractRegister < regexp::convert::ToAutomatonGlushkov, automaton::NFA < DefaultSymbolType, ext::pair < DefaultSymbolType, unsigned > >, const regexp::UnboundedRegExp < > & > ( regexp::convert::ToAutomatonGlushkov::convert, "regexp" ).setDocumentation ( -"Implements conversion of regular expressions to finite automata usign Glushkov's method of neighbours.\n\ +"Implements conversion of regular expressions to finite automata using Glushkov's method of neighbours.\n\ \n\ @param regexp the regexp to convert\n\ @return finite automaton accepting the language described by the original regular expression" ); auto ToAutomatonGlushkovFormalRegExp = registration::AbstractRegister < regexp::convert::ToAutomatonGlushkov, automaton::NFA < DefaultSymbolType, ext::pair < DefaultSymbolType, unsigned > >, const regexp::FormalRegExp < > & > ( regexp::convert::ToAutomatonGlushkov::convert, "regexp" ).setDocumentation ( -"Implements conversion of regular expressions to finite automata usign Glushkov's method of neighbours.\n\ +"Implements conversion of regular expressions to finite automata using Glushkov's method of neighbours.\n\ \n\ @param regexp the regexp to convert\n\ @return finite automaton accepting the language described by the original regular expression" ); diff --git a/alib2algo/src/regexp/convert/ToAutomatonGlushkov.h b/alib2algo/src/regexp/convert/ToAutomatonGlushkov.h index 90f0303569..62c5ad6e9d 100644 --- a/alib2algo/src/regexp/convert/ToAutomatonGlushkov.h +++ b/alib2algo/src/regexp/convert/ToAutomatonGlushkov.h @@ -30,7 +30,7 @@ namespace convert { class ToAutomatonGlushkov { public: /** - * Implements conversion of regular expressions to finite automata usign Glushkov's method of neighbours. + * Implements conversion of regular expressions to finite automata using Glushkov's method of neighbours. * * \tparam SymbolType the type of symbols in the regular expression * diff --git a/alib2algo/src/regexp/convert/ToAutomatonThompson.cpp b/alib2algo/src/regexp/convert/ToAutomatonThompson.cpp index fb23ed0353..a329d4f87a 100644 --- a/alib2algo/src/regexp/convert/ToAutomatonThompson.cpp +++ b/alib2algo/src/regexp/convert/ToAutomatonThompson.cpp @@ -212,13 +212,13 @@ void regexp::convert::ToAutomatonThompson::Unbounded::visit(const regexp::Unboun namespace { auto ToAutomatonThompsonFormalRegExp = registration::AbstractRegister < regexp::convert::ToAutomatonThompson, automaton::EpsilonNFA < >, const regexp::FormalRegExp < > & > ( regexp::convert::ToAutomatonThompson::convert, "regexp" ).setDocumentation ( -"Implements conversion of regular expressions to finite automata usign Thompson's method of incremental construction.\n\ +"Implements conversion of regular expressions to finite automata using Thompson's method of incremental construction.\n\ \n\ @param regexp the regexp to convert\n\ @return finite automaton accepting the language described by the original regular expression" ); auto ToAutomatonThompsonUnboundedRegExp = registration::AbstractRegister < regexp::convert::ToAutomatonThompson, automaton::EpsilonNFA < >, const regexp::UnboundedRegExp < > & > ( regexp::convert::ToAutomatonThompson::convert, "regexp" ).setDocumentation ( -"Implements conversion of regular expressions to finite automata usign Thompson's method of incremental construction.\n\ +"Implements conversion of regular expressions to finite automata using Thompson's method of incremental construction.\n\ \n\ @param regexp the regexp to convert\n\ @return finite automaton accepting the language described by the original regular expression" ); diff --git a/alib2algo/src/regexp/convert/ToAutomatonThompson.h b/alib2algo/src/regexp/convert/ToAutomatonThompson.h index 62a12b93c5..99ce161a36 100644 --- a/alib2algo/src/regexp/convert/ToAutomatonThompson.h +++ b/alib2algo/src/regexp/convert/ToAutomatonThompson.h @@ -21,7 +21,7 @@ namespace convert { class ToAutomatonThompson { public: /** - * Implements conversion of regular expressions to finite automata usign Thompson's method of incremental construction. + * Implements conversion of regular expressions to finite automata using Thompson's method of incremental construction. * * \tparam SymbolType the type of symbols in the regular expression * diff --git a/alib2algo/src/regexp/convert/ToGrammarRightRGDerivation.cpp b/alib2algo/src/regexp/convert/ToGrammarRightRGDerivation.cpp index 152c52aa00..6b3ed23440 100644 --- a/alib2algo/src/regexp/convert/ToGrammarRightRGDerivation.cpp +++ b/alib2algo/src/regexp/convert/ToGrammarRightRGDerivation.cpp @@ -4,13 +4,13 @@ namespace { auto ToGrammarRightRGDerivationUnboundedRegExp = registration::AbstractRegister < regexp::convert::ToGrammarRightRGDerivation, grammar::RightRG < DefaultSymbolType, unsigned >, const regexp::UnboundedRegExp < > & > ( regexp::convert::ToGrammarRightRGDerivation::convert, "regexp" ).setDocumentation ( -"Implements conversion of regular expressions to regular grammars usign Brzozowski's derivation algorithm.\n\ +"Implements conversion of regular expressions to regular grammars using Brzozowski's derivation algorithm.\n\ \n\ @param regexp the regexp to convert\n\ @return right regular grammar generating the language described by the original regular expression" ); auto ToGrammarRightRGDerivationFormalRegExp = registration::AbstractRegister < regexp::convert::ToGrammarRightRGDerivation, grammar::RightRG < DefaultSymbolType, unsigned >, const regexp::FormalRegExp < > & > ( regexp::convert::ToGrammarRightRGDerivation::convert, "regexp" ).setDocumentation ( -"Implements conversion of regular expressions to regular grammars usign Brzozowski's derivation algorithm.\n\ +"Implements conversion of regular expressions to regular grammars using Brzozowski's derivation algorithm.\n\ \n\ @param regexp the regexp to convert\n\ @return right regular grammar generating the language described by the original regular expression" ); diff --git a/alib2algo/src/regexp/convert/ToGrammarRightRGDerivation.h b/alib2algo/src/regexp/convert/ToGrammarRightRGDerivation.h index 3db3b337c3..c4f5d8b48a 100644 --- a/alib2algo/src/regexp/convert/ToGrammarRightRGDerivation.h +++ b/alib2algo/src/regexp/convert/ToGrammarRightRGDerivation.h @@ -27,7 +27,7 @@ namespace convert { class ToGrammarRightRGDerivation { public: /** - * Implements conversion of regular expressions to regular grammars usign Brzozowski's derivation algorithm. + * Implements conversion of regular expressions to regular grammars using Brzozowski's derivation algorithm. * * \tparam T the type of regular expression to convert * \tparam SymbolType the type of symbols in the regular expression diff --git a/alib2algo/src/regexp/convert/ToGrammarRightRGGlushkov.cpp b/alib2algo/src/regexp/convert/ToGrammarRightRGGlushkov.cpp index bfb4c5f43b..f18b44c84a 100644 --- a/alib2algo/src/regexp/convert/ToGrammarRightRGGlushkov.cpp +++ b/alib2algo/src/regexp/convert/ToGrammarRightRGGlushkov.cpp @@ -4,13 +4,13 @@ namespace { auto ToGrammarRightRGGlushkovUnboundedRegExp = registration::AbstractRegister < regexp::convert::ToGrammarRightRGGlushkov, grammar::RightRG < DefaultSymbolType, ext::pair < DefaultSymbolType, unsigned > >, const regexp::UnboundedRegExp < > & > ( regexp::convert::ToGrammarRightRGGlushkov::convert, "regexp" ).setDocumentation ( -"Implements conversion of regular expressions to finite automata usign Glushkov's method of neighbours.\n\ +"Implements conversion of regular expressions to finite automata using Glushkov's method of neighbours.\n\ \n\ @param regexp the regexp to convert\n\ @return right regular grammar generating the language described by the original regular expression" ); auto ToGrammarRightRGGlushkovFormalRegExp = registration::AbstractRegister < regexp::convert::ToGrammarRightRGGlushkov, grammar::RightRG < DefaultSymbolType, ext::pair < DefaultSymbolType, unsigned > >, const regexp::FormalRegExp < > & > ( regexp::convert::ToGrammarRightRGGlushkov::convert, "regexp" ).setDocumentation ( -"Implements conversion of regular expressions to finite automata usign Glushkov's method of neighbours.\n\ +"Implements conversion of regular expressions to finite automata using Glushkov's method of neighbours.\n\ \n\ @param regexp the regexp to convert\n\ @return right regular grammar generating the language described by the original regular expression" ); diff --git a/alib2algo/src/regexp/convert/ToGrammarRightRGGlushkov.h b/alib2algo/src/regexp/convert/ToGrammarRightRGGlushkov.h index ca3e70b552..6ec0a39128 100644 --- a/alib2algo/src/regexp/convert/ToGrammarRightRGGlushkov.h +++ b/alib2algo/src/regexp/convert/ToGrammarRightRGGlushkov.h @@ -26,7 +26,7 @@ namespace convert { class ToGrammarRightRGGlushkov { public: /** - * Implements conversion of regular expressions to finite automata usign Glushkov's method of neighbours. + * Implements conversion of regular expressions to finite automata using Glushkov's method of neighbours. * * \tparam SymbolType the type of symbols in the regular expression * diff --git a/alib2algo/src/rte/convert/ToPostfixPushdownAutomaton.h b/alib2algo/src/rte/convert/ToPostfixPushdownAutomaton.h index 9526aa7d32..feeed1f870 100644 --- a/alib2algo/src/rte/convert/ToPostfixPushdownAutomaton.h +++ b/alib2algo/src/rte/convert/ToPostfixPushdownAutomaton.h @@ -18,7 +18,7 @@ namespace convert { class ToPostfixPushdownAutomaton { public: /** - * Implements conversion of the tree regular expressions to a pushdown automaton usign Glushkov's method of neighbours. + * Implements conversion of the tree regular expressions to a pushdown automaton using Glushkov's method of neighbours. * * \tparam SymbolType the type of symbols in the regular expression * \tparam RankType the type of symbol ranks in the regular expression diff --git a/alib2algo/src/rte/convert/ToPostfixPushdownAutomatonGlushkovNaive.h b/alib2algo/src/rte/convert/ToPostfixPushdownAutomatonGlushkovNaive.h index f53d37281d..d10872ba92 100644 --- a/alib2algo/src/rte/convert/ToPostfixPushdownAutomatonGlushkovNaive.h +++ b/alib2algo/src/rte/convert/ToPostfixPushdownAutomatonGlushkovNaive.h @@ -29,7 +29,7 @@ class ToPostfixPushdownAutomatonGlushkovNaive { public: /** - * Implements conversion of the regular tree expressions to a real-time height-deterministic pushdown automaton usign algorithm similar to Glushkov's method of neighbours. + * Implements conversion of the regular tree expressions to a real-time height-deterministic pushdown automaton using algorithm similar to Glushkov's method of neighbours. * * \tparam SymbolType the type of symbols in the regular expression * \tparam RankType the type of symbol ranks in the regular expression -- GitLab