• Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Default User Avatar

    The haskell reference solution takes minutes to pass the python tests - the performance requirements are very different.
    (the haskell reference, and presumably many submitted solutions, including my own, choke on nested expressions, presumably they end up doing a bunch of horrific backtracking - can they (parser combinator solutions) be written to be fast?)

  • Custom User Avatar

    Kotlin translation. Please, review and approve (the author might be inactive).

  • Custom User Avatar

    Python version is so broken I passed by pressing attempt a couple of times until I saw green and just clicked "submit". One of those cases where you push to prod and quit I guess.

    The comments below mention all the proglems I was going to mention so can this kata be removed? Clearly in so many years nobody thought it needs fixing.

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    It should be tested that the user does not verify double Or correctness by simply checking that the first character on the right side is "(":

    • "a|b|c" - parser thinks this input is wrong
    • "a|(b|c)" - parser thinks this input is correct
    • "a|(b|c)|d" - parser thinks this input is also correct because "(" comes after "|", although the input is invalid
  • Custom User Avatar

    It is not stated whether deeply nested stuff like "(((a)))|((b))" is valid, and it must be tested.

  • Custom User Avatar

    It is not stated what to do with cases where left and right parts of Or are identical. Not tested either.

  • Custom User Avatar

    Stuff like "(a*)*" is not tested.

  • Custom User Avatar

    It should be stated that every step in a stringified recipe must end with "\n".

  • Default User Avatar

    Java tests.
    Parsing "(((eqbn.)riwfj)((.gud)|(zw))z)":
    expected: Str<(((eqbn.)riwfj)((.gud)|(zw))z)>
    but was: Str<(((eqbn.)riwfj)((.gud)|(zw))z)>

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    Pretty easy but description is unclear
    I advice to add (abc) case as example to the description because it's unobvious how to nest adds if the sequence is longer than 2 characters

  • Default User Avatar

    Working on this in C#. Instructions aren't too clear in general, but I'm passing all of the basic tests. I'm failing random string tests where there is an open paren '(' in the string, but not a matching close paren ')'. I am recognizing this as an error and returning nothing, but the test case seems to be expecting something.

    Also - I had one test case where it started something like this "+5(S......" and the result said that it was expecing "(+5)" - literally those 4 characters and nothing else. That certainly isn't correct. That one was unusually and I'm not certain what else in the test case caused that. Usually when there are unmatched open parens, it doesn't get rid of things, but it's not really predictable either. Not sure what in the random string test case triggered this, but you may want to look at the random string test case and make sure they are properly handling parens... Thanks.

  • Default User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Loading more items...