src/parser.py
def in_order(self, root, table):
        ''' Traverse the AST in in-order fashion '''
        # base case for recursion
        if root is None:
            return
        # traverse down the left branch
        self.in_order(root.left, table)
        # add the stack value to the table 
        value = root.eval_stack.pop(0)
        table.append(value)
        # traverse down the right branch
        self.in_order(root.right, table)
 Traverse the AST in in-order fashion 
Traverse the AST in in-order fashion
Traverse the AST in in - order fashion
def in_order(self, root, table):
        if root is None:
            return
        self.in_order(root.left, table)
        value = root.eval_stack.pop(0)
        table.append(value)
        self.in_order(root.right, table)
def in_order ( self , root , table ) : if root is None : return self . in_order ( root . left , table ) value = root . eval_stack . pop ( 0 ) table . append ( value ) self . in_order ( root . right , table )
Traverse the AST in in-order fashion
Traverse the AST in in - order fashion
''' Traverse the AST in in-order fashion ''' # base case for recursion # traverse down the left branch # add the stack value to the table  # traverse down the right branch
self
root
table