+ new Tree(null, "v", new Tree[] { }),
+ new Tree(null, "e", new Tree[] { }),
+ new Tree(null, "s", new Tree[] { })})}),
+ new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "rewrite", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { }),
+ new Tree(null, "q", new Tree[] { }),
+ new Tree(null, "u", new Tree[] { }),
+ new Tree(null, "i", new Tree[] { }),
+ new Tree(null, "A", new Tree[] { }),
+ new Tree(null, "l", new Tree[] { }),
+ new Tree(null, "t", new Tree[] { })})})}),
+ new Tree(null, "literal", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, ">", new Tree[] { })})})})})})})})})})}),
+ new Tree(null, "::=", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "E", new Tree[] { }),
+ new Tree(null, "q", new Tree[] { }),
+ new Tree(null, "u", new Tree[] { }),
+ new Tree(null, "i", new Tree[] { }),
+ new Tree(null, "A", new Tree[] { }),
+ new Tree(null, "l", new Tree[] { }),
+ new Tree(null, "t", new Tree[] { })})}),
+ new Tree(null, null, new Tree[] { new Tree(null, "alternatives", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "=>", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "+/", new Tree[] { new Tree(null, "nonTerminalY", new Tree[] { new Tree(null, "sify", new Tree[] { new Tree(null, null, new Tree[] { new Tree(null, "C", new Tree[] { }),
+ new Tree(null, "o", new Tree[] { }),
+ new Tree(null, "n", new Tree[] { }),
+ new Tree(null, "j", new Tree[] { }),
+ new Tree(null, "u", new Tree[] { }),
+ new Tree(null, "n", new Tree[] { }),
+ new Tree(null, "c", new Tree[] { }),