|
definition:
|
parseTkLs :: Pos -> [Token] -> PM [Statement]
parseTkLs pos tks = let (SPM _ pm tk) = parseStatement (newEmptySPM pos tks)
in if tk == []
then liftPM (\st -> [st]) pm
else combinePMs (:) pm (parseTkLs pos tk)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Organizes the wrapping with respect to the internally used Parser Monad.
--- Invokes the parsing process for each single statement.
--- Returns a list of statements (as AST) wrapped in a ParseMonad.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> _}
|
|
name:
|
parseTkLs
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
CPP.ICode.ParsePos.Pos -> [CPP.ICode.Parser.SQL.Token.Token]
-> CPP.ICode.ParseMonad.PM [CPP.ICode.Parser.SQL.AST.Statement]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|