Programming language for symbolic computation with unusual combination of pattern matching features: Tree patterns, associative patterns and expressions embedded in patterns.
I'm analyzing the example in Rosetta Code about arbitraty precision integer.
I was running a different expression based on that one:
@(4^3^2:[ 2 ?)
this should be always true... the position operator ( [ ) is true because is trying to match the 2 char in the string with anything ( ? ). What am I missing here?
Hello Bart,
I'm analyzing the example in Rosetta Code about arbitraty precision integer. I was running a different expression based on that one:
@(4^3^2:[ 2 ?)
this should be always true... the position operator ( [ ) is true because is trying to match the 2 char in the string with anything ( ? ). What am I missing here?