Tomáš Pecka authored 4 years ago and Jan Trávníček committed 4 years ago

Although #pragma once is not a standard, compilers nowadays usually
support it. We don't have any tricky build system so we should be OK.

This also fixes many errors regarding using reserved identifiers (names
starting with double underscore).

removal of an unnecessary recursion, addition of forgotten move, removal of
unnecessary const qualifier, change int to -> size_t

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.

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.

Remove CMakeLists.txt generator scripts from build phase. Replaced with
CMake's GLOB that can re-run every time the build is invoked. We can
also drop the Python dependency now.

Removed header installs which will be redesigned in future commits.