| definition: |
parseTerm :: SMTParser SMT.Term
parseTerm = SMT.TConst . SMT.Str <$> parseStr <|> (Parser $ \tokens -> case tokens of
[] -> (runParser eof) tokens
Num n : ts -> Right (ts, SMT.TConst (SMT.Num n))
BVal b : ts -> let s = case b of
True -> "true"
False -> "false"
in Right (ts, SMT.TComb (SMT.Id s) [])
Id s : ts -> Right (ts, SMT.TComb (SMT.Id s) [])
LParen : ts -> (runParser parseParenTerm) ts
t : ts -> (runParser (unexpected t)) ts)
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- parser for terms |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> _}
|
| name: |
parseTerm |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
ParserComb.Parser Language.SMTLIB.Scanner.Token Language.SMTLIB.Types.Term |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |