scala.util.parsing.combinator.testing
the type of input elements
The fatal failure case of ParseResult: contains an error-message and the remaining input
The failure case of ParseResult: contains an error-message and the remaining input
The parser input is an abstract reader of input elements
A common super-class for unsuccessful parse results
A parser whose ~ combinator disallows back-tracking
A base class for parser results
The root class of parsers
The success case of ParseResult: contains the result and the remaining input
An extractor so NoSuccess(msg, next) can be used in matches
The parser that matches an element in the domain of the partial function f'
If
f' is defined on the first element in the input, f' is applied to it to produce
this parser's result
A parser that matches only the given list of element es'
accept(es) succeeds if the input subsequently provides the elements in the list
es'
A parser that matches only the given element e'
The method is implicit so that elements can automatically be lifted to their parsers
A parser generator that, roughly, generalises the rep1sep generator so that q', which parses the separator,
produces a left-associative function that combines the elements it separates
A parser generator that, roughly, generalises the rep1sep generator so that q', which parses the separator,
produces a left-associative function that combines the elements it separates
A parser generator that generalises the rep1sep generator so that q', which parses the separator,
produces a right-associative function that combines the elements it separates
Wrap a parser so that its failures become errors (the | combinator will give up as soon as it encounters an error, on failure it simply tries the next alternative)
A parser that matches only the given element e'
elem(e) succeeds if the input starts with an element
e'
A parser matching input elements that satisfy a given predicate
A parser that results in an error
A parser that always fails
A parser generator for guard expressions
A parser that matches a literal string
Wrap a parser so that its failures&errors become success and vice versa -- it never consumes any input
A parser generator for optional sub-phrases
Parse some prefix of reader in' with parser
p'
Parse some prefix of character sequence in' with parser
p'
Parse some prefix of reader in' with parser
p'
Parse all of character sequence in' with parser
p'
Parse all of reader in' with parser
p'
Parse all of reader in' with parser
p'
A parser generator delimiting whole phrases (i
positioned' decorates a parser's result with the start position of the input it consumed
A parser that matches a regex string
A parser generator for repetitions
A parser generator for non-empty repetitions
A parser generator for non-empty repetitions
A parser generator for non-empty repetitions
A parser generator for a specified number of repetitions
A parser generator for interleaved repetitions
A parser that always succeeds