Expression Tree Tutorial - Knowledge Base (KB)

Parsing a list of tokens into an expression tree

I want to parse expressions like those in typical Haskell source. I get an input stream, which is already tokenized and annotated with fixity and precedence. The set of operators is not known at compile time and may be arbitrary. The output should be a tr...

Expression evaluation tree in Haskell

In an exam today I was asked to create an expression evaluation tree in Haskell. Usually the answer is as simple as:...data Expr = Value Integer | Add Expr Expr | Sub Expr Expr | Mul Expr Expr ...And to evaluate it, you just ...

Haskell - Reverse polish notation regular expression to expression tree

Im struggling with coming up with algorithm that converts a regular expression (in context of regular languages, there are only 3 operations '.' for concat, '+' for "or" and '*' for iteration) in reverse polish notation to the regular expression tree....F...