parseq.combinators — com.gitlab.vise890/parseq DEVELOP

Combinators for parseq.parsers and similar.

and clj

(and & parsers)

Applies parsers one after another. If any parser fails, it fails.

bind clj

(bind p f)

This is a monadic bind. A.k.a. >>=.

Its type is:

bind :: [Parser a, (a -> Parser b)] -> Parser b

fmap clj

(fmap f p)

Applies function f to the result of p.

Its type is:

fmap :: [Parser a, (a -> b)] -> Parser b

many* clj

(many* p)

Parse p 0 or more times. Similar to * in regular expressions.

many+ clj

(many+ p)

Parse p 1 or more times. Similar to + in regular expressions.

merge clj

(merge parsers)

Applies parsers in order and then merges their results into one big fat map.

one? clj

(one? p)

Optionally parses one p, returning a sequential coll containing it, if found. If p doesn't match, returns an empty coll.

optional clj

Alias to one?

or clj

(or & parsers)

Tries parsers one after another. Returns the result from the first parser that succeeds. If all parsers fail, it fails.

peek clj

(peek p)

Peeks with p (and fails if p fails). Does not consume any input.

return clj

(return v)

A parser that does nothing and always succeeds. It returns the input unchanged and the supplied v as a result.

skip* clj

(skip* p)

Skips 0 or more p.

skip+ clj

(skip+ p)

Skips 1 or more p.

unordered-pair clj

(unordered-pair p1 p2)

Tries p1 followed by p2 or p2 followed by p1. If either combination succeeds, always returns [result1 result2].