original_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: 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_tokens: 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 .
code: def convert_node(self, pgen_grammar, type, 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.
          """
          # TODO REMOVE symbol, we don't want type here.
          symbol = pgen_grammar.number2symbol[type]
          try:
              return self.node_map[symbol](children)
          except KeyError:
              if symbol == '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 symbol == 'list_if':
                  # Make transitioning from 2 to 3 easier.
                  symbol = 'comp_if'
              elif symbol == 'listmaker':
                  # Same as list_if above.
                  symbol = 'testlist_comp'
              return self.default_node(symbol, children)
code_tokens: def convert_node ( self , pgen_grammar , type , children ) : symbol = pgen_grammar . number2symbol [ type ] try : return self . node_map [ symbol ] ( children ) except KeyError : if symbol == 'suite' : children = [ children [ 0 ] ] + children [ 2 : - 1 ] elif symbol == 'list_if' : symbol = 'comp_if' elif symbol == 'listmaker' : symbol = 'testlist_comp' return self . default_node ( symbol , children )
short_docstring: Convert raw node information to a PythonBaseNode instance.
short_docstring_tokens: Convert raw node information to a PythonBaseNode instance .
comment: """
          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.
          """$SEP$# TODO REMOVE symbol, we don't want type here.$SEP$# We don't want the INDENT/DEDENT in our parser tree. Those$SEP$# leaves are just cancer. They are virtual leaves and not real$SEP$# ones and therefore have pseudo start/end positions and no$SEP$# prefixes. Just ignore them.$SEP$# Make transitioning from 2 to 3 easier.$SEP$# Same as list_if above.