How to handle consecutive delimiters about superpower HOT 6 CLOSED

@marklauter This works simply perfect!

Thank you very much for your time and help, highly appreciated.

Looks like I should start reading Graham Hutton's and Erik Meijer's paper as well - I wish you some enlightening moments reading it.

Once again - thank you!

from superpower.

I'm not 100% sure, but I think it's up to the "this parser" to be able to parse an empty or zero result.
parser.ManyDelim..
^ parser must be able to succeed with something like "" or "\0" input. Based on the error, I'd guess this is the TgwComCon parser.

This is based on my read of the ManyDelim... method

        public static TextParser<T[]> ManyDelimitedBy<T, U>(this TextParser<T> parser, TextParser<U> delimiter)
        {
            if (parser == null) throw new ArgumentNullException(nameof(parser));
            if (delimiter == null) throw new ArgumentNullException(nameof(delimiter));

            return parser.Then(first => delimiter.IgnoreThen(parser).Many().Select(rest => ArrayEnumerable.Cons(first, rest)))
                .OptionalOrDefault(Array.Empty<T>());
        }

from superpower.

Thank you @marklauter. I think you are totally correct.
I've tried that, but failed.
Could you please give me an example / idea of how to parse such an empty result?

from superpower.

Full disclosure, I'm new to parser combinators and am still working my way through Graham Hutton's and Erik Meijer's 1996 paper, but I will attempt a sample today after work.

from superpower.

I wrote a very simple tokenizer with a "null value" parser that recognizes consecutive ';' characters. The semicolons can be separated by whitespace. Readme shows output. I hope it's useful.

https://github.com/marklauter/superpower-delimited-combinator

from superpower.

I'm so glad this idea worked for you. Happy parsing.

from superpower.