Mathias

Actually, Jason, I have been thinking about this a bit more and I find it really hard to come with a good general construct for permutations. The reason is that...

Ok, I see your logic. If the production elements can be complex rules and not just primitives (e.g. Strings or Chars) than most problems seem solvable. The separator rule could...

Actually, you can't generally. But the Permutation rule would support 'withSeparator' to apply one... --- [email protected] http://www.parboiled.org On 21.04.2011, at 14:09, jason-s wrote: > Cool! I like the withSeparator idea,...

If you have a rule like this in your grammar: ``` FirstOf("foo", "foobar") ``` The second alternative will never match! Ever! In fact this rule is equivalent to one just...

Yes, all these things would be nice if they were available. However, IMHO the "FirstOf alternative prefix of later one" error is the most important one, since it can be...

The `ParserInput`, which roughly corresponds to the input buffers of PB1, are not where the meat of the recovery logic lives. PB2 would need an equivalent of the `RecoveringParseRunner` from...

Ok, thanks! A few of the things you want you can already do today. > Printouts when the rule is tried, and where e.g. the remainder of the line, or...

I don't think there is a general reason why call-by-name rule passing shouldn't work. Can you open a ticket for it?

Great! Thanks!

Currently the typing is like this (one of the three possible cases): ``` scala zeroOrMore(RuleN[A :: HNil]): RuleN[Seq[A] :: HNil] ``` or shorter ``` scala zeroOrMore(Rule1[A]): Rule1[Seq[A]] ``` What would...