Compounded Let statments

[britlion]

Just following up a few threads. Not sure if this got implemented. It's a /very/ common way to do things like keys:

Code:

LET x=x+(Inkey$="P")-(Inkey$="O")

And depends on the fact that in Sinclair basic, False equates to zero and true equates to 1. This is not stricktly speaking true in Boriel's Basic. It probably should work in sinclair mode.

Perhaps

Code:

x=x+(SGN (key="p") - (SGN (key="o"))

might be the same logical result, given false=0 and I think true is > 0 ?