1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
\DOC some
\TYPE {some : ('a -> bool) -> 'a list -> 'a * 'a list}
\SYNOPSIS
Parses any single item satisfying a predicate.
\DESCRIBE
If {p} is a predicate on input tokens of some kind, {some p} is a parser that
parses and returns any first token satisfying the predicate {p}, and raises
{Noparse} on a first token not satisfying {p}.
\FAILURE
The call {some p} never fails.
\COMMENTS
This is one of a suite of combinators for manipulating ``parsers''. A parser is
simply a function whose OCaml type is some instance of
{:('a)list -> 'b * ('a)list}. The function should take a list of objects of
type {:'a} (e.g. characters or tokens), parse as much of it as possible from
left to right, and return a pair consisting of the object derived from parsing
(e.g. a term or a special syntax tree) and the list of elements that were not
processed.
\SEEALSO
++, |||, >>, a, atleast, elistof, finished, fix, leftbin, listof, many, nothing,
possibly, rightbin.
\ENDDOC
|
