WELCOME

Suppose you have an array of integers that has to be sorted. How would you implement a function that sorts it? The function should be able to take arrays of any length right? How do you express this in SCL? Typically arguments are type checked before calling the function. In SCL the array length is part of the type. This means that Array[1..10] of BYTE and Array[1..15] of BYTE are actually two different types. In other words - the lengths of the argument / actual argument a

The unconditional jump instruction is here. It is strange to announce such a trivial thing but it was a real challenge to implement. What makes it hard? It is intended to work on a flattened program tree. Flattening the program tree is the actual problem. In version 2512 we have it working with some limitations. But lets start with a short introduction. 'Goto' is a statement that is often avoided since it tends to make the code unreadable/unmaintainable if overused. Typ

How do you arrange the elements of an array in ascending/descending order? This trivial problem has an even more trivial solution - you...

There are two approaches to solving a problem in computing that requires visiting a lot of states. Iterative and recursive. The iterative...

Materials are used in every production line. These are goods of any kind needed to make the final product. It is also important to...