User blog:Alemagno12/An Idea

I was watching Pteriforever's Boring Notation, and i got an idea. What about putting the subarrays in the BEAF arrays?

Let & is an array.

Let # is anything.

First type subscript
{#[0]} = {#}

{#[n]} = {#,#,#,...,#,#,#} with n entries

- If # is a linear array, put the entries of the first # first, then let the next entry be the first entry of the second #, then put the rest of the entries of the second #, then repeat but starting with the previous #.

- If # is a higher array, resolve the # until being converted into a linear array.

{#[&]} = Rules of the array apply on the []

Second Type Subscript
{#[0]_2} = {#}

{#[n]_2} = {#[#[...#[#,#]_2...]_2]_2} with n levels

{#[&]_2} = Rules of the array apply on the []_2

Multiple Type Subscript
{#[0]_n} = {#}

{#[n]_(n+1)} = {#[#[...#[#,#]_n...]_n]_n} with n levels

{#[&]_n} = Rules of the array apply on the []_n

{#[#]_1} = {#[#]}