Remove 32 from token32, tokens32 and node32 (pointlander#167)

* Rename token32 to token

* Remove shadowing by renaming print to printFunc

* Rename receiver and function argument

* Rename node32 to node

* Rename tokens32 to tokens

* Replace sort.Ints with slices.Sort

* Use variable for same added token

* Add comments for ansii control sequence

Author: mrclmr

grammars/calculatorast/calculator.go

@@ -12,7 +12,7 @@ func (c *Calculator[_]) Eval() *big.Int {
 	return c.Rulee(c.AST())
 }
 
-func (c *Calculator[U]) Rulee(node *node32[U]) *big.Int {
+func (c *Calculator[U]) Rulee(node *node[U]) *big.Int {
 	node = node.up
 	for node != nil {
 		switch node.pegRule {
@@ -24,7 +24,7 @@ func (c *Calculator[U]) Rulee(node *node32[U]) *big.Int {
 	return nil
 }
 
-func (c *Calculator[U]) Rulee1(node *node32[U]) *big.Int {
+func (c *Calculator[U]) Rulee1(node *node[U]) *big.Int {
 	node = node.up
 	var a *big.Int
 	for node != nil {
@@ -45,7 +45,7 @@ func (c *Calculator[U]) Rulee1(node *node32[U]) *big.Int {
 	return a
 }
 
-func (c *Calculator[U]) Rulee2(node *node32[U]) *big.Int {
+func (c *Calculator[U]) Rulee2(node *node[U]) *big.Int {
 	node = node.up
 	var a *big.Int
 	for node != nil {
@@ -70,7 +70,7 @@ func (c *Calculator[U]) Rulee2(node *node32[U]) *big.Int {
 	return a
 }
 
-func (c *Calculator[U]) Rulee3(node *node32[U]) *big.Int {
+func (c *Calculator[U]) Rulee3(node *node[U]) *big.Int {
 	node = node.up
 	var a *big.Int
 	for node != nil {
@@ -87,7 +87,7 @@ func (c *Calculator[U]) Rulee3(node *node32[U]) *big.Int {
 	return a
 }
 
-func (c *Calculator[U]) Rulee4(node *node32[U]) *big.Int {
+func (c *Calculator[U]) Rulee4(node *node[U]) *big.Int {
 	node = node.up
 	minus := false
 	for node != nil {
@@ -106,7 +106,7 @@ func (c *Calculator[U]) Rulee4(node *node32[U]) *big.Int {
 	return nil
 }
 
-func (c *Calculator[U]) Rulevalue(node *node32[U]) *big.Int {
+func (c *Calculator[U]) Rulevalue(node *node[U]) *big.Int {
 	node = node.up
 	for node != nil {
 		switch node.pegRule {
@@ -122,7 +122,7 @@ func (c *Calculator[U]) Rulevalue(node *node32[U]) *big.Int {
 	return nil
 }
 
-func (c *Calculator[U]) Rulesub(node *node32[U]) *big.Int {
+func (c *Calculator[U]) Rulesub(node *node[U]) *big.Int {
 	node = node.up
 	for node != nil {
 		switch node.pegRule {