Parsed Elements
Parsed Program
Decomposed Form
f0 := P3;
f1 := P1;
f2 := S;
f3 := Replace {f2 <- (f1)};
f4 := Recursion {Base: f1, Step: f3};
f5 := Replace {f4 <- (f1,f0)};
f6 := C0;
main := Recursion {Base: f6, Step: f5};
Compact Form
Recursion {
Base:
C0,
Step:
Replace {
Recursion {
Base:
P1,
Step:
Replace {
S
<- (
P1
)}
}
<- (
P1,
P3
)}
}Parsed Parameters
[3,4]
Computation State
Ongoing Computation
Head:
Recursion {
Base:
P1,
Step:
Replace {
S
<- (
P1
)}
}
Args:
( Head:
Recursion {
Base:
P1,
Step:
Replace {
S
<- (
P1
)}
}
Args:
( Head:
Recursion {
Base:
P1,
Step:
Replace {
S
<- (
P1
)}
}
Args:
( Head:
C0
Args:
( 4
),
Head:
P3
Args:
( Head:
Recursion {
Base:
C0,
Step:
Replace {
Recursion {
Base:
P1,
Step:
Replace {
S
<- (
P1
)}
}
<- (
P1,
P3
)}
}
Args:
( 0,
4
),
1,
4
)
),
Head:
P3
Args:
( Head:
Recursion {
Base:
C0,
Step:
Replace {
Recursion {
Base:
P1,
Step:
Replace {
S
<- (
P1
)}
}
<- (
P1,
P3
)}
}
Args:
( 1,
4
),
2,
4
)
),
Head:
P3
Args:
( Head:
Recursion {
Base:
C0,
Step:
Replace {
Recursion {
Base:
P1,
Step:
Replace {
S
<- (
P1
)}
}
<- (
P1,
P3
)}
}
Args:
( 2,
4
),
3,
4
)
)