Y combinator em grr language

However Grr don't support lambda operator is possible make a fixed point using just replacement string(like the language was constructed).

[Ώ <- s(i)(i)(e(p(s(i)(i)))) : JUST A FIXED POINT 
u(f) <- f(s)(k) : IOTA COMBINATOR
d <- k(i) catch 2 vaues ignore the first and return the second
s(x)(y)(z) <- x(z)(y(z))
k(x)(y) <- x
i(x) <- s(k)(k)(x)
e <- s(k)(k(s(i)))
]

So, yes... macro like c could do something like this if would allow recursion.