Just check out if a given string is Slimp or not!!
You don't have to do Slurpy test!! - It is too much of homework~
Someone got already done with this homework in a recursive version.
It is O.K with a recursive version.
A recursive approach will be may easier than a non-recursive approach.
However, please try it with a non-recursive version.
Can we do this homework version with a non-recursive version?
Really, Huh?
If you don't want to use the state machine, that's O.K.
Maybe you can use several "pattern match methods" found by googling!!
However, I want you to do this homework for yourself (But it is not mandatory)
My point is that there is "No Restriction" with this homework..
Give it a try with this homework.
Enjoy yourself with this homework!!
(Probably in a non-recursive version,
[1] The number of "AB" or "AE" or "AD" in a string is the same as the number of "C" in the end part of the string.
[2] When you get to 'C', you need to check out how many 'C' is required to verify the given string is Slimp or not.)
[PS] The sample code included in the word file as attached here is not a correct working code. It is a just reference code for your homework!!
(Updated on Oct. 5, 2015)
