I have a grammar that is quite ambiguous. Ambiguities aren't solved easily because the grammar is quite complex and the task of resolving ambiguity is probably not possible. Ambiguities are supposed to be solved later after establishing some context in which it can be resolved. The biggest source of parsing failures I have because in the alignment of the matching rules a short match often prevents a long match from being found. And I wonder if I can look for the longest match with petit parser. Combining parsers with / always finds the first matching and | does not find anything if more than one rule matches. Any advize how to do this with petit? Norbert _______________________________________________ Moose-dev mailing list Moose-dev(a)iam.unibe.ch https://www.iam.unibe.ch/mailman/listinfo/moose-dev

thanks, it works. Do you plan to integrate that in petit parser? I wonder if it would be feasible to implement yet another binary selector for another parser. I use /> at the moment.

Norbert _______________________________________________ Moose-dev mailing list Moose-dev(a)iam.unibe.ch https://www.iam.unibe.ch/mailman/listinfo/moose-dev