New parsing algorithm for the attractor-cycle notation. The previous convoluted solution did not always work for more than 9 states. Breaking change: the implementation now strictly follows the context-free grammar specification, thus the expression "[1|2,3,4]" is now treated as malformed. Adding more tests for the notation. Technical function SgpDecTestInstall2 added to get some information on memory usage of tests.