Parser.Fix.Simple

Simple fix-expression parser

If in doubt, just use parsefix

Documentation

data TokenType

Constructors

TokenPlain

Plain, i.e. operand

TokenLParenth

TokenRParenth

TokenOper Fixity Integer

Operator, with fixity and precedence

Instances

Eq TokenType

data Fixity

Fixity/Associativity

Constructors

Prefix

InfixLeft

InfixRight

InfixNull

Postfix

Instances

Eq Fixity

parsefix :: (t -> a, t -> a -> a, t -> a -> a -> a) -> (t -> TokenType) -> [t] -> a

Shunt and Fold

foldfix :: (t -> a, t -> a -> a, t -> a -> a -> a) -> (t -> TokenType) -> [t] -> a

Fold expression in postfix form

shunt :: (t -> TokenType) -> [t] -> [t]

Change from infix to postfix form

Precedence at start is zero