Documentation

Unquotes a string if possible, otherwise, this is just an identity.

> unquote "\"string\""
"string"

> unquote "something else"
"something else"

Checks if a string-encoded Haskell expression is atomic.

> atomic "123"
True
> atomic "42 + 1337"
False
> atomic "'a'"
True
> atomic "[1,2,3,4,5]"
True
> atomic "(1,2,3,4,5)"
True

FIXME: The current implementation may produce false positives:

> atomic "'a' < 'b'"
True
> atomic "\"asdf\" ++ \"qwer\""
True
> atomic "[1,2,3] ++ [4,5,6]"
True

but this does not cause problems for (all?) most cases.

Returns the operator precedence of an infix string.

> outernmostPrec "1 + 2"
Just 6

Returns whether the given String represents a negative literal.

> isNegativeLiteral "1"
False
> isNegativeLiteral "-1"
True
> isNegativeLiteral "-x"
False
> isNegativeLiteral "1 - 3"
False

Check if a function / operator is infix

isInfix "foo"   == False
isInfix "(+)"   == False
isInfix "`foo`" == True
isInfix "+"     == True

Is the given string a prefix function?

> isPrefix "abs"
True

> isPrefix "+"
False

Is the string of the form `string`

Transform an infix operator into an infix function:

toPrefix "`foo`" == "foo"
toPrefix "+"     == "(+)"

Returns the precedence of default Haskell operators

Returns an infinite list of variable names based on the given template.

> variableNamesFromTemplate "x"
["x", "y", "z", "x'", "y'", ...]

> variableNamesFromTemplate "p"
["p", "q", "r", "p'", "q'", ...]

> variableNamesFromTemplate "xy"
["xy", "zw", "xy'", "zw'", "xy''", ...]

Cycles through a list of variable names priming them at each iteration.

primeCycle ["x","y","z"]

"x","y","z","x'","y'","z'","x''","y''","z''","x'''",...