User blog:JHeroJr/Dash-Solidus Cascading-E Notation

Dash-Solidus Cascading-E Notation, or -/E^. Rules: Theoretically, this could be implicated in any notation, and if it was implicated in set theory, I'm sure it would have some rules like this:
 * 1) The dash (—) is a delimiter that you add to the end of any expression so that it is in the form En&n&n&...n&n&n&n—, where each n is a separate number and each & is a delimiter. Call this x.
 * 2) You copy the original expression without the dash, and call it z.
 * 3) The value of x is equal to the value of z, except any delimiter that can appear more than once in a row, as #### with the hyperion, and also any digit and any E symbol, is replaced with a string of z copies of that hyperion. The dash, of course, may not be duplicated in this way (except when we get to the dash bracket function), but you can have more than one dashes lined up at the end of an expression.
 * 1) The dash (—) is an addition you could add to the end of a set theory expression that represents a number.
 * 2) You copy this expression without the dash and evaluate it. Call this number y.
 * 3) You then take the number of symbols in the expression without the dash. Multiply it by y. Call this number z.
 * 4) The expression with a dash is equal to the biggest number that can be represented in set theory with a number of symbols equal to the original expression's z-value or less.

Now, in the Extensible E-System, this is really, really huge. So huge, in fact, that just E1— dwarfs a googledeciplex! But this is googology. Really really huge is never enough in googology. How about an extension to the dash function, —[n], which we wiill call the dash bracket function, because I can't possibly come up with a better name for it. Any suggestions are helpful. The rules:
 * 1) Suppose the normal dash (—) is equivalent to —[0]. Given the value of n in —[n], it has an effect (see the third line in Dash-solidus cascading-E notation rules) on any dash-bracket combination —[m] where m<n.
 * 2) The dash-bracket combination —n is equivalent to a string of dash-bracket functions —[0] —[1]—[2]—[3]...—[n].
 * 3) The dash-bracket combination —[n] is equivalent to a string of dash-bracket functions —0 —1—2—3...—n.
 * 4) The dash-bracket combination —[[n]] is equivalent to a string of dash-bracket functions —[0] —[1]—[2]—[3]...—[n], and so on.