Sergey Igushkin

The tokens you declare with delegation are matched in the same order as declared. So if the tokenizing is ambiguous (which is often the case) then the tokens declared earlier...

@barsan-ds I'm not quite sure I understand your use case. Is it similar to the [operator table in `jparsec`](https://github.com/jparsec/jparsec/wiki/Tutorial#operatortable)? If not, could you please provide a more concrete example with...

Not yet. There's no built-in features that allow defining operator rules like this. Though I considered adding something like that (and especially with support for left recursion removal), and I...

@pragmaticpandy Thanks a lot for looking into it! I like the idea overall, but what actually bothers me is that anonymous tokens (or tokens collected from the grammar's parsers in...

I couldn't find a way to do that preserving type safety. My `and` combinators are based on generated tuples and functions for adding another component, for each number of components...

Normally this is implemented as so-called 'lexer modes' which the lexer switches upon encountering a token of a specific type. A popular example is switching to the comment tokenizing mode...

@NiKlimenko I'm currently doing some ongoing work on the library in my spare time which also includes an update to Kotlin 1.3.40, as well as some API changes and performance...

@IARI, in the 0.3.5 update, I've added reflex option transformation to embedded flags. Before 0.3.5, you could also just add the reflex embedded flags into the pattern string.

Thanks for the report. I agree, this is rather counter-intuitive, but this behavior does not contradict the design. Note that `OrCombinator` always prefers the first alternative that got parsed successfully....

By the way, `0.3.2` makes `Parsed.remainder` public. I'll take a look at the idea of bind combinator some time soon.