greedy1

fun <S, A> greedy1(parser: Parser<S, A>): Parser<S, List<A>>

Creates a parser that matches the longest sequence of matches of the given parser, but requires at least one match.

Return

A parser that matches the longest sequence of matches of the given parser, but requires at least one match.

Parameters

parser

The parser to match greedily.