Also make the test section names more clear

I redesigned the algorithm to make it similar to NPDA run implementation, most
importantly to handle cycles, also not even the very basic test that I
introduced didn't pass.

Additionaly, the graphStructuredStacks used to track the pushdown store and output were
incorrectly parametrized with InputSymbolType instead of PushdownStoreSymbolType
and OutputSymbolType.

NPDA execution through BFS-like simulation. Only exposed via Accept algo.

The variable i can be constructed from the begin and current iterator to the
input.

The ToAutomaton should be an aggregate/alias for the default algorithms.

Also add getTransition from state and transition to state to NPDA.

The algorithm generated rules of the automaton with the top of the pushdown
store symbol on the right, which is according to the algorithm, however, the
representation of PDAs and every PDA processing algorithm assumes the top of the
pushdown store is on the left.

The IsLanguageEmpty algorithm returned wrong result (the opposite boolean) because of wrong use of the set::count method. Also use set::contains to make the code clearer.

So we easily know what version of cppcheck and clang-tidy
are we running. Compiler version is announced by CMake.

Recently we moved infrastructure repositories under a new path. Docker
registries have therefore moved too.  Reflect this in our CI settings.

Tomáš Pecka authored 4 years ago and Tomáš Pecka committed 4 years ago

Fixes a bug where wrong CMake variable was checked. Instead of checking
for existence of variable VERSION_STRING the code checked for existence
of variable "value_of(VERSION_STRING)".