This is the core component for token-based parsers.
@requires lexical a component providing the tokens consumed by the parsers in this component.
The input-type for these parsers
Tokens is the abstract type of the `Token's consumed by the parsers in this component
lexical is the component responsible for consuming some basic kind of input (usually character-based) and turning it into the tokens understood by these parsers.
||phrase [t](p : Parser[t]) : Parser[t]|
|Methods inherited from Parsers|
|commit, commit, not, elem, elem, accept, accept, accept, failure, fail, success, success, discard, log, log, rep, rep, repsep, rep1, rep1, repN, rep1, repN, rep1sep, rep1sep, chainl1, chainl1, chainr1, opt, opt, positioned, positioned|
|Methods inherited from AnyRef|
|getClass, hashCode, equals, clone, toString, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized|
|Methods inherited from Any|
|==, !=, isInstanceOf, asInstanceOf|
typeTokens <: Tokens
vallexical : Tokens
A parser generator delimiting whole phrases (i.e. programs).
phrase(p) succeeds if
p succeeds and
no input is left over after
p -the parser that must consume all input for the resulting parser to succeed.
pconsumed all the input.