The terminating exception handler for elipsis is not needed since if no handler
hits, we just run out of handlers and handling there is the same.

even though the count result casted to boolean is semantically the same, contains is more expressive

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

This reverts commit bc91e284.

Parser can't parse automata string inputs where a state containing a
pair is also a final state.

 NFA a b c d
 ><<(InitialStateLabel), 0> <a, 1> <b, 2> <c, 3> -
 <<a, 1> <a, 1> - - -
 <b, 2> - <b, 2> <c, 3> -
 <c, 3> - - - <d, 4>
 <<d, 4> - - - -

Jan Trávníček authored 3 years ago and Jan Trávníček committed 3 years ago

breaking change!

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

MP algorithm was always resetting the pattern index to 0 whereas it should be
reused. This revealed that Spos should also take into account node wildcards
otherwise the presumed not-necessary-to-be-parsed part of the pattern does not
have to be matching the pattern. Which caused the computation of what does not
need to be matched to underflow.

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

a step forward to remove any need for container extensions