Super Recursion Function

Super Recursion Function, denoted as: /#/

Definition
In the function, the numbers are entries, and "," or "[#]" are spaces.

/a, b/ = a^b                                                                                  /a[#]#[#]b[#]c/ = /a[#]#[#]/a[#]#[#]/a[#]#[#]...[#]c-1/[#]c-1/[#]c-1/ where there's b in the middle and there are /a, #, b, c-1/ arrays                                                          /#[#]1/ = /#/

"," are similar to "[1]"

/a[n+1]b/ = /a[n]a[n]...[n]a/ where there are /a[n+1]b-1/ entries                /a[1[1]2]b/ = /a[/a[1[1]2]b-1/]b/                                                      As same as above. /a[1]_(n+1)b/ = /a[a[a[...]_(n)a]_(n)a]_(n)a/ with /a[1]_(n+1)b-1/ arrays               As same as above, again. /a[1]__b/ = /a[1]_(a[1]_(a[1]_(...)b)b)b/                                              /a[1]___b/ = /a[1]__... like in the left...

Examples
/2, 5/                                                                                  32

/2, 2, 2/                                                                              /2, /2, /2, /2, 2////                                                                    2^^5

/2, 2, 3/                                                                                  /2, /2, /2, /2, /2, ... /2, 2, 2/ ... /, 2/, 2/, 2/, 2/ with 2^^5 arrays

/5[2]5/ = /5, 5, 5, .../ where there are /5[2]4/ entries