printed-Tree words violating grammar: 136
printed Father != stack father on GRAMMAR trees: 0
nodes in malformed words whose printed Father is a non-node position: 248
  example w=[2, 1, 2, 0, 1, 2, 0] node pos 6 Father=4 beta(Father)=0
  example w=[2, 1, 2, 0, 1, 3, 0] node pos 6 Father=4 beta(Father)=0
  example w=[2, 1, 3, 0, 1, 2, 0] node pos 6 Father=4 beta(Father)=0
  example w=[2, 1, 3, 0, 1, 3, 0] node pos 6 Father=4 beta(Father)=0
printed Tree vs relaxed grammar (node [ tree+ ]*), mismatches: 0
