The duplicate R%% may not give error, why should it? But is surely throws off a normal triple loop count, see here with inner most R%% repalced with Q%% (attached) = many many more loops!
It shouldn’t, as it may be intentional. QB64 can’t know how you’re coding.
For example, let’s use a sorted array of 10,000 elements with values between 1 and 10...
Now, there’s going to be lots of duplicates, right?
What if we only need to do something once for each unique value?
FOR x = 1 TO UBOUND(array)
PRINT array(x)
‘Do lots of other stuff if you want
FOR X = X TO UBOUND(array)
IF array(x + 1) <> array(x) THEN EXIT FOR
NEXT
NEXT
The above increments X on purpose, so only unique values are printed and processed... it’s not a glitch at all, and works 100% as intended.
How is the IDE supposed to know this is good and proper, while the original isn’t?
Sometimes, we just have to find and debug our mistakes ourselves.