| Safe Haskell | Safe-Infered |
|---|
Penny.Liberty.Expressions
- newtype Precedence = Precedence Int
- data Associativity
- data Token a
- = TokOperand a
- | TokUnaryPostfix (a -> a)
- | TokUnaryPrefix Precedence (a -> a)
- | TokBinary Precedence Associativity (a -> a -> a)
- | TokOpenParen
- | TokCloseParen
- newtype Operand a = Operand a
- tokAnd :: Token (a -> Bool)
- tokOr :: Token (a -> Bool)
- tokNot :: Token (a -> Bool)
- evaluate :: Foldable l => l (Token a) -> Maybe a
Documentation
newtype Precedence Source
Precedence can be any integer; the greater the number, the higher the precedence.
Constructors
| Precedence Int |
Instances
Constructors
| TokOperand a | |
| TokUnaryPostfix (a -> a) | |
| TokUnaryPrefix Precedence (a -> a) | |
| TokBinary Precedence Associativity (a -> a -> a) | |
| TokOpenParen | |
| TokCloseParen |
An operand; for example, in the expression 5 4 +, 5 and 4
are operands.
Constructors
| Operand a |