In this post we will look at how to convert java code into DLX code. We will create two functions Perrin and gensum .
The function P(n) computes the nth Perrin number. Perrin numbers are defined by the recursive rules:
P(0) = 3
P(1) = 0
P(2) = 2
P(n) = P(n-2) + P(n-3) for n > 2
So for example: -
P(0) returns 3
P(1) returns 0
P(2) returns 2
P(3) returns 3
The gensum...
