Am 08.03.2012 17:16, schrieb Troels Henriksen:
Christian Maederchristian.mae...@dfki.de writes:
The simplest solution is to parse the prefixes yourself and do not put
it into the table.
(Doing the infixes and | by hand is no big deal, too, and
possibly easier then figuring out the
The simplest solution is to parse the prefixes yourself and do not put
it into the table.
(Doing the infixes and | by hand is no big deal, too, and possibly
easier then figuring out the capabilities of buildExpressionParser)
Cheers C.
Am 07.03.2012 13:08, schrieb Troels Henriksen:
Christian Maeder christian.mae...@dfki.de writes:
The simplest solution is to parse the prefixes yourself and do not put
it into the table.
(Doing the infixes and | by hand is no big deal, too, and
possibly easier then figuring out the capabilities of
buildExpressionParser)
Is there
Consider a simple language of logical expressions:
import Control.Applicative
import Text.Parsec hiding ((|), many)
import Text.Parsec.String
import Text.Parsec.Expr
data Expr = Truth
| Falsity
| And Expr Expr
| Or Expr Expr
| Not Expr
