parameters: ( self, instring, maxMatches=_MAX_INT )
docstring: Another extension to C{L{scanString}}, simplifying the access to the tokens found
          to match the given parse expression.  May be called with optional
          C{maxMatches} argument, to clip searching after 'n' matches are found.
          
          Example::
              # a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
              cap_word = Word(alphas.upper(), alphas.lower())
              
              print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
  
              # the sum() builtin can be used to merge results into a single ParseResults object
              print(sum(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity")))
          prints::
              [['More'], ['Iron'], ['Lead'], ['Gold'], ['I'], ['Electricity']]
              ['More', 'Iron', 'Lead', 'Gold', 'I', 'Electricity']
docstring_summary: Another extension to C{L{scanString}}, simplifying the access to the tokens found
          to match the given parse expression.  May be called with optional
          C{maxMatches} argument, to clip searching after 'n' matches are found.
          
          Example::
              # a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
              cap_word = Word(alphas.upper(), alphas.lower())
              
              print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
docstring_tokens: Another extension to C { L { scanString }} simplifying the access to the tokens found to match the given parse expression . May be called with optional C { maxMatches } argument to clip searching after n matches are found . Example :: # a capitalized word starts with an uppercase letter followed by zero or more lowercase letters cap_word = Word ( alphas . upper () alphas . lower () ) print ( cap_word . searchString ( More than Iron more than Lead more than Gold I need Electricity ))
function: def searchString( self, instring, maxMatches=_MAX_INT ):
          """
          Another extension to C{L{scanString}}, simplifying the access to the tokens found
          to match the given parse expression.  May be called with optional
          C{maxMatches} argument, to clip searching after 'n' matches are found.
          
          Example::
              # a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
              cap_word = Word(alphas.upper(), alphas.lower())
              
              print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
  
              # the sum() builtin can be used to merge results into a single ParseResults object
              print(sum(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity")))
          prints::
              [['More'], ['Iron'], ['Lead'], ['Gold'], ['I'], ['Electricity']]
              ['More', 'Iron', 'Lead', 'Gold', 'I', 'Electricity']
          """
          try:
              return ParseResults([ t for t,s,e in self.scanString( instring, maxMatches ) ])
          except ParseBaseException as exc:
              if ParserElement.verbose_stacktrace:
                  raise
              else:
                  # catch and re-raise exception from here, clears out pyparsing internal stack trace
                  raise exc
function_tokens: def searchString ( self , instring , maxMatches = _MAX_INT ) : try : return ParseResults ( [ t for t , s , e in self . scanString ( instring , maxMatches ) ] ) except ParseBaseException as exc : if ParserElement . verbose_stacktrace : raise else : # catch and re-raise exception from here, clears out pyparsing internal stack trace raise exc