parameters: (self, nonterminal, children)
return_statement: return node
docstring: Convert raw node information to a PythonBaseNode instance.
  
          This is passed to the parser driver which calls it whenever a reduction of a
          grammar rule produces a new complete node, so that the tree is build
          strictly bottom-up.
docstring_summary: Convert raw node information to a PythonBaseNode instance.
docstring_tokens: Convert raw node information to a PythonBaseNode instance .
function: def convert_node(self, nonterminal, children):
          """
          Convert raw node information to a PythonBaseNode instance.
  
          This is passed to the parser driver which calls it whenever a reduction of a
          grammar rule produces a new complete node, so that the tree is build
          strictly bottom-up.
          """
          try:
              node = self.node_map[nonterminal](children)
          except KeyError:
              if nonterminal == 'suite':
                  # We don't want the INDENT/DEDENT in our parser tree. Those
                  # leaves are just cancer. They are virtual leaves and not real
                  # ones and therefore have pseudo start/end positions and no
                  # prefixes. Just ignore them.
                  children = [children[0]] + children[2:-1]
              elif nonterminal == 'list_if':
                  # Make transitioning from 2 to 3 easier.
                  nonterminal = 'comp_if'
              elif nonterminal == 'listmaker':
                  # Same as list_if above.
                  nonterminal = 'testlist_comp'
              node = self.default_node(nonterminal, children)
          for c in children:
              c.parent = node
          return node
function_tokens: def convert_node ( self , nonterminal , children ) : try : node = self . node_map [ nonterminal ] ( children ) except KeyError : if nonterminal == 'suite' : # We don't want the INDENT/DEDENT in our parser tree. Those # leaves are just cancer. They are virtual leaves and not real # ones and therefore have pseudo start/end positions and no # prefixes. Just ignore them. children = [ children [ 0 ] ] + children [ 2 : - 1 ] elif nonterminal == 'list_if' : # Make transitioning from 2 to 3 easier. nonterminal = 'comp_if' elif nonterminal == 'listmaker' : # Same as list_if above. nonterminal = 'testlist_comp' node = self . default_node ( nonterminal , children ) for c in children : c . parent = node return node