wip: new CCParse

[c-cube]

I'm working, in #380, on a significant refactoring of CCParse, to try and make it easier to parse basic things without writing a .mll and .mly as menhir would require. That can be very basic line oriented formats, IRC logs, competitive programming input problems, etc.

I'd love to get some feedback on the new functions and the changes in how backtracking works. @anuragsoni I think we discussed this recently, in case you're still interested :)

edit: some examples:

• a very simple irc log parser illustrating slices and recurse
• a basic S-expression parser which illustrates recursion and handles quoted strings with escape sequences

[Gbury]

I haven't yet had enough time to look at it in detail, but from what I can tell, there doesn't seem to be an easy way to attach locations to the result of the parsing functions, i.e. locations are only available in the error cases, and not in the success ones.

[c-cube]

Well, this is not designed to write Dolmen, with locations on each node of a sophisticated AST. It's designed for basic parsers, where I don't think locations are important?

[Gbury]

That's probably reasonable, I just wanted to make sure that was a conscious decision, ^^

[anuragsoni]

#380 looks pretty nice! I'll take a closer look at the changes soon, but at a glance I like the proposed api!

[c-cube]

Curious to hear feedback on the slice thing, which is quite new :)
I think it's relatively unusual compared to other parser combinator libraries, afaict.