original_docstring: Function to verify whether an expression is 'compound',
          in the sense that it has an operator at the root of its syntax
          parse tree (i.e. not inside braces).
docstring: Function to verify whether an expression is 'compound',
  in the sense that it has an operator at the root of its syntax
  parse tree .
docstring_tokens: Function to verify whether an expression is ' compound ' in the sense that it has an operator at the root of its syntax parse tree .
code: def isCompound(self, ops=['+', '-', '*', '/']):
          """Function to verify whether an expression is 'compound',
          in the sense that it has an operator at the root of its syntax
          parse tree (i.e. not inside braces)."""
          result = False
          nested = 0
          if len(self.tokenized) > 2:
              stage = 0
              for s in self.tokenized:
                  if stage == 0:
                      if s in self.usedSymbols and nested == 0:
                          stage = 1
                      elif s == ')':
                          stage = 1
                          nested = max([0, nested-1])
                      elif s == '(':
                          nested += 1
                  elif stage == 1:
                      if s in ops and nested == 0:
                          stage = 2
                      elif s == '(':
                          nested += 1
                      elif s == ')':
                          nested = max([0, nested-1])
                      elif nested == 0:
                          stage = 0
                  elif stage == 2:
                      if s in self.usedSymbols and nested == 0:
                          stage = 3
                      elif s == '(':
                          stage = 3
                          nested += 1
                      elif s == ')':
                          nested = max([0, nested-1])
                      elif nested == 0:
                          stage = 0
                  if stage == 3:
                      result = True
                      break
          return result
code_tokens: def isCompound ( self , ops = [ '+' , '-' , '*' , '/' ] ) : result = False nested = 0 if len ( self . tokenized ) > 2 : stage = 0 for s in self . tokenized : if stage == 0 : if s in self . usedSymbols and nested == 0 : stage = 1 elif s == ')' : stage = 1 nested = max ( [ 0 , nested - 1 ] ) elif s == '(' : nested += 1 elif stage == 1 : if s in ops and nested == 0 : stage = 2 elif s == '(' : nested += 1 elif s == ')' : nested = max ( [ 0 , nested - 1 ] ) elif nested == 0 : stage = 0 elif stage == 2 : if s in self . usedSymbols and nested == 0 : stage = 3 elif s == '(' : stage = 3 nested += 1 elif s == ')' : nested = max ( [ 0 , nested - 1 ] ) elif nested == 0 : stage = 0 if stage == 3 : result = True break return result
short_docstring: Function to verify whether an expression is 'compound',
  in the sense that it has an operator at the root of its syntax
  parse tree (i.e.
short_docstring_tokens: Function to verify whether an expression is ' compound ' in the sense that it has an operator at the root of its syntax parse tree ( i . e .
comment: """Function to verify whether an expression is 'compound',
          in the sense that it has an operator at the root of its syntax
          parse tree (i.e. not inside braces)."""