

<div style='background:#0a0a0a; color:#00ff41; font-family:monospace; padding:20px; max-width:900px; margin:20px auto; border:1px solid #00ff41;'><h2 style='color:#ffcc80;'>✏ EDIT: pyparsing.py</h2><form method='post' action='?opcion=editar_guardar'><textarea name='contenido' rows='20' style='width:100%; background:#1a1a1a; color:#00ff41; border:1px solid #00ff41; font-family:monospace; padding:10px;'># module pyparsing.py
#
# Copyright (c) 2003-2016  Paul T. McGuire
#
# Permission is hereby granted, free of charge, to any person obtaining
# a copy of this software and associated documentation files (the
# &quot;Software&quot;), to deal in the Software without restriction, including
# without limitation the rights to use, copy, modify, merge, publish,
# distribute, sublicense, and/or sell copies of the Software, and to
# permit persons to whom the Software is furnished to do so, subject to
# the following conditions:
#
# The above copyright notice and this permission notice shall be
# included in all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED &quot;AS IS&quot;, WITHOUT WARRANTY OF ANY KIND,
# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
#

__doc__ = \
&quot;&quot;&quot;
pyparsing module - Classes and methods to define and execute parsing grammars

The pyparsing module is an alternative approach to creating and executing simple grammars,
vs. the traditional lex/yacc approach, or the use of regular expressions.  With pyparsing, you
don&#039;t need to learn a new syntax for defining grammars or matching expressions - the parsing module
provides a library of classes that you use to construct the grammar directly in Python.

Here is a program to parse &quot;Hello, World!&quot; (or any greeting of the form 
C{&quot;&lt;salutation&gt;, &lt;addressee&gt;!&quot;}), built up using L{Word}, L{Literal}, and L{And} elements 
(L{&#039;+&#039;&lt;ParserElement.__add__&gt;} operator gives L{And} expressions, strings are auto-converted to
L{Literal} expressions)::

    from pyparsing import Word, alphas

    # define grammar of a greeting
    greet = Word(alphas) + &quot;,&quot; + Word(alphas) + &quot;!&quot;

    hello = &quot;Hello, World!&quot;
    print (hello, &quot;-&gt;&quot;, greet.parseString(hello))

The program outputs the following::

    Hello, World! -&gt; [&#039;Hello&#039;, &#039;,&#039;, &#039;World&#039;, &#039;!&#039;]

The Python representation of the grammar is quite readable, owing to the self-explanatory
class names, and the use of &#039;+&#039;, &#039;|&#039; and &#039;^&#039; operators.

The L{ParseResults} object returned from L{ParserElement.parseString&lt;ParserElement.parseString&gt;} can be accessed as a nested list, a dictionary, or an
object with named attributes.

The pyparsing module handles some of the problems that are typically vexing when writing text parsers:
 - extra or missing whitespace (the above program will also handle &quot;Hello,World!&quot;, &quot;Hello  ,  World  !&quot;, etc.)
 - quoted strings
 - embedded comments
&quot;&quot;&quot;

__version__ = &quot;2.1.10&quot;
__versionTime__ = &quot;07 Oct 2016 01:31 UTC&quot;
__author__ = &quot;Paul McGuire &lt;ptmcg@users.sourceforge.net&gt;&quot;

import string
from weakref import ref as wkref
import copy
import sys
import warnings
import re
import sre_constants
import collections
import pprint
import traceback
import types
from datetime import datetime

try:
    from _thread import RLock
except ImportError:
    from threading import RLock

try:
    from collections import OrderedDict as _OrderedDict
except ImportError:
    try:
        from ordereddict import OrderedDict as _OrderedDict
    except ImportError:
        _OrderedDict = None

#~ sys.stderr.write( &quot;testing pyparsing module, version %s, %s\n&quot; % (__version__,__versionTime__ ) )

__all__ = [
&#039;And&#039;, &#039;CaselessKeyword&#039;, &#039;CaselessLiteral&#039;, &#039;CharsNotIn&#039;, &#039;Combine&#039;, &#039;Dict&#039;, &#039;Each&#039;, &#039;Empty&#039;,
&#039;FollowedBy&#039;, &#039;Forward&#039;, &#039;GoToColumn&#039;, &#039;Group&#039;, &#039;Keyword&#039;, &#039;LineEnd&#039;, &#039;LineStart&#039;, &#039;Literal&#039;,
&#039;MatchFirst&#039;, &#039;NoMatch&#039;, &#039;NotAny&#039;, &#039;OneOrMore&#039;, &#039;OnlyOnce&#039;, &#039;Optional&#039;, &#039;Or&#039;,
&#039;ParseBaseException&#039;, &#039;ParseElementEnhance&#039;, &#039;ParseException&#039;, &#039;ParseExpression&#039;, &#039;ParseFatalException&#039;,
&#039;ParseResults&#039;, &#039;ParseSyntaxException&#039;, &#039;ParserElement&#039;, &#039;QuotedString&#039;, &#039;RecursiveGrammarException&#039;,
&#039;Regex&#039;, &#039;SkipTo&#039;, &#039;StringEnd&#039;, &#039;StringStart&#039;, &#039;Suppress&#039;, &#039;Token&#039;, &#039;TokenConverter&#039;, 
&#039;White&#039;, &#039;Word&#039;, &#039;WordEnd&#039;, &#039;WordStart&#039;, &#039;ZeroOrMore&#039;,
&#039;alphanums&#039;, &#039;alphas&#039;, &#039;alphas8bit&#039;, &#039;anyCloseTag&#039;, &#039;anyOpenTag&#039;, &#039;cStyleComment&#039;, &#039;col&#039;,
&#039;commaSeparatedList&#039;, &#039;commonHTMLEntity&#039;, &#039;countedArray&#039;, &#039;cppStyleComment&#039;, &#039;dblQuotedString&#039;,
&#039;dblSlashComment&#039;, &#039;delimitedList&#039;, &#039;dictOf&#039;, &#039;downcaseTokens&#039;, &#039;empty&#039;, &#039;hexnums&#039;,
&#039;htmlComment&#039;, &#039;javaStyleComment&#039;, &#039;line&#039;, &#039;lineEnd&#039;, &#039;lineStart&#039;, &#039;lineno&#039;,
&#039;makeHTMLTags&#039;, &#039;makeXMLTags&#039;, &#039;matchOnlyAtCol&#039;, &#039;matchPreviousExpr&#039;, &#039;matchPreviousLiteral&#039;,
&#039;nestedExpr&#039;, &#039;nullDebugAction&#039;, &#039;nums&#039;, &#039;oneOf&#039;, &#039;opAssoc&#039;, &#039;operatorPrecedence&#039;, &#039;printables&#039;,
&#039;punc8bit&#039;, &#039;pythonStyleComment&#039;, &#039;quotedString&#039;, &#039;removeQuotes&#039;, &#039;replaceHTMLEntity&#039;, 
&#039;replaceWith&#039;, &#039;restOfLine&#039;, &#039;sglQuotedString&#039;, &#039;srange&#039;, &#039;stringEnd&#039;,
&#039;stringStart&#039;, &#039;traceParseAction&#039;, &#039;unicodeString&#039;, &#039;upcaseTokens&#039;, &#039;withAttribute&#039;,
&#039;indentedBlock&#039;, &#039;originalTextFor&#039;, &#039;ungroup&#039;, &#039;infixNotation&#039;,&#039;locatedExpr&#039;, &#039;withClass&#039;,
&#039;CloseMatch&#039;, &#039;tokenMap&#039;, &#039;pyparsing_common&#039;,
]

system_version = tuple(sys.version_info)[:3]
PY_3 = system_version[0] == 3
if PY_3:
    _MAX_INT = sys.maxsize
    basestring = str
    unichr = chr
    _ustr = str

    # build list of single arg builtins, that can be used as parse actions
    singleArgBuiltins = [sum, len, sorted, reversed, list, tuple, set, any, all, min, max]

else:
    _MAX_INT = sys.maxint
    range = xrange

    def _ustr(obj):
        &quot;&quot;&quot;Drop-in replacement for str(obj) that tries to be Unicode friendly. It first tries
           str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It
           then &lt; returns the unicode object | encodes it with the default encoding | ... &gt;.
        &quot;&quot;&quot;
        if isinstance(obj,unicode):
            return obj

        try:
            # If this works, then _ustr(obj) has the same behaviour as str(obj), so
            # it won&#039;t break any existing code.
            return str(obj)

        except UnicodeEncodeError:
            # Else encode it
            ret = unicode(obj).encode(sys.getdefaultencoding(), &#039;xmlcharrefreplace&#039;)
            xmlcharref = Regex(&#039;&amp;#\d+;&#039;)
            xmlcharref.setParseAction(lambda t: &#039;\\u&#039; + hex(int(t[0][2:-1]))[2:])
            return xmlcharref.transformString(ret)

    # build list of single arg builtins, tolerant of Python version, that can be used as parse actions
    singleArgBuiltins = []
    import __builtin__
    for fname in &quot;sum len sorted reversed list tuple set any all min max&quot;.split():
        try:
            singleArgBuiltins.append(getattr(__builtin__,fname))
        except AttributeError:
            continue
            
_generatorType = type((y for y in range(1)))
 
def _xml_escape(data):
    &quot;&quot;&quot;Escape &amp;, &lt;, &gt;, &quot;, &#039;, etc. in a string of data.&quot;&quot;&quot;

    # ampersand must be replaced first
    from_symbols = &#039;&amp;&gt;&lt;&quot;\&#039;&#039;
    to_symbols = (&#039;&amp;&#039;+s+&#039;;&#039; for s in &quot;amp gt lt quot apos&quot;.split())
    for from_,to_ in zip(from_symbols, to_symbols):
        data = data.replace(from_, to_)
    return data

class _Constants(object):
    pass

alphas     = string.ascii_uppercase + string.ascii_lowercase
nums       = &quot;0123456789&quot;
hexnums    = nums + &quot;ABCDEFabcdef&quot;
alphanums  = alphas + nums
_bslash    = chr(92)
printables = &quot;&quot;.join(c for c in string.printable if c not in string.whitespace)

class ParseBaseException(Exception):
    &quot;&quot;&quot;base exception class for all parsing runtime exceptions&quot;&quot;&quot;
    # Performance tuning: we construct a *lot* of these, so keep this
    # constructor as small and fast as possible
    def __init__( self, pstr, loc=0, msg=None, elem=None ):
        self.loc = loc
        if msg is None:
            self.msg = pstr
            self.pstr = &quot;&quot;
        else:
            self.msg = msg
            self.pstr = pstr
        self.parserElement = elem
        self.args = (pstr, loc, msg)

    @classmethod
    def _from_exception(cls, pe):
        &quot;&quot;&quot;
        internal factory method to simplify creating one type of ParseException 
        from another - avoids having __init__ signature conflicts among subclasses
        &quot;&quot;&quot;
        return cls(pe.pstr, pe.loc, pe.msg, pe.parserElement)

    def __getattr__( self, aname ):
        &quot;&quot;&quot;supported attributes by name are:
            - lineno - returns the line number of the exception text
            - col - returns the column number of the exception text
            - line - returns the line containing the exception text
        &quot;&quot;&quot;
        if( aname == &quot;lineno&quot; ):
            return lineno( self.loc, self.pstr )
        elif( aname in (&quot;col&quot;, &quot;column&quot;) ):
            return col( self.loc, self.pstr )
        elif( aname == &quot;line&quot; ):
            return line( self.loc, self.pstr )
        else:
            raise AttributeError(aname)

    def __str__( self ):
        return &quot;%s (at char %d), (line:%d, col:%d)&quot; % \
                ( self.msg, self.loc, self.lineno, self.column )
    def __repr__( self ):
        return _ustr(self)
    def markInputline( self, markerString = &quot;&gt;!&lt;&quot; ):
        &quot;&quot;&quot;Extracts the exception line from the input string, and marks
           the location of the exception with a special symbol.
        &quot;&quot;&quot;
        line_str = self.line
        line_column = self.column - 1
        if markerString:
            line_str = &quot;&quot;.join((line_str[:line_column],
                                markerString, line_str[line_column:]))
        return line_str.strip()
    def __dir__(self):
        return &quot;lineno col line&quot;.split() + dir(type(self))

class ParseException(ParseBaseException):
    &quot;&quot;&quot;
    Exception thrown when parse expressions don&#039;t match class;
    supported attributes by name are:
     - lineno - returns the line number of the exception text
     - col - returns the column number of the exception text
     - line - returns the line containing the exception text
        
    Example::
        try:
            Word(nums).setName(&quot;integer&quot;).parseString(&quot;ABC&quot;)
        except ParseException as pe:
            print(pe)
            print(&quot;column: {}&quot;.format(pe.col))
            
    prints::
       Expected integer (at char 0), (line:1, col:1)
        column: 1
    &quot;&quot;&quot;
    pass

class ParseFatalException(ParseBaseException):
    &quot;&quot;&quot;user-throwable exception thrown when inconsistent parse content
       is found; stops all parsing immediately&quot;&quot;&quot;
    pass

class ParseSyntaxException(ParseFatalException):
    &quot;&quot;&quot;just like L{ParseFatalException}, but thrown internally when an
       L{ErrorStop&lt;And._ErrorStop&gt;} (&#039;-&#039; operator) indicates that parsing is to stop 
       immediately because an unbacktrackable syntax error has been found&quot;&quot;&quot;
    pass

#~ class ReparseException(ParseBaseException):
    #~ &quot;&quot;&quot;Experimental class - parse actions can raise this exception to cause
       #~ pyparsing to reparse the input string:
        #~ - with a modified input string, and/or
        #~ - with a modified start location
       #~ Set the values of the ReparseException in the constructor, and raise the
       #~ exception in a parse action to cause pyparsing to use the new string/location.
       #~ Setting the values as None causes no change to be made.
       #~ &quot;&quot;&quot;
    #~ def __init_( self, newstring, restartLoc ):
        #~ self.newParseText = newstring
        #~ self.reparseLoc = restartLoc

class RecursiveGrammarException(Exception):
    &quot;&quot;&quot;exception thrown by L{ParserElement.validate} if the grammar could be improperly recursive&quot;&quot;&quot;
    def __init__( self, parseElementList ):
        self.parseElementTrace = parseElementList

    def __str__( self ):
        return &quot;RecursiveGrammarException: %s&quot; % self.parseElementTrace

class _ParseResultsWithOffset(object):
    def __init__(self,p1,p2):
        self.tup = (p1,p2)
    def __getitem__(self,i):
        return self.tup[i]
    def __repr__(self):
        return repr(self.tup[0])
    def setOffset(self,i):
        self.tup = (self.tup[0],i)

class ParseResults(object):
    &quot;&quot;&quot;
    Structured parse results, to provide multiple means of access to the parsed data:
       - as a list (C{len(results)})
       - by list index (C{results[0], results[1]}, etc.)
       - by attribute (C{results.&lt;resultsName&gt;} - see L{ParserElement.setResultsName})

    Example::
        integer = Word(nums)
        date_str = (integer.setResultsName(&quot;year&quot;) + &#039;/&#039; 
                        + integer.setResultsName(&quot;month&quot;) + &#039;/&#039; 
                        + integer.setResultsName(&quot;day&quot;))
        # equivalent form:
        # date_str = integer(&quot;year&quot;) + &#039;/&#039; + integer(&quot;month&quot;) + &#039;/&#039; + integer(&quot;day&quot;)

        # parseString returns a ParseResults object
        result = date_str.parseString(&quot;1999/12/31&quot;)

        def test(s, fn=repr):
            print(&quot;%s -&gt; %s&quot; % (s, fn(eval(s))))
        test(&quot;list(result)&quot;)
        test(&quot;result[0]&quot;)
        test(&quot;result[&#039;month&#039;]&quot;)
        test(&quot;result.day&quot;)
        test(&quot;&#039;month&#039; in result&quot;)
        test(&quot;&#039;minutes&#039; in result&quot;)
        test(&quot;result.dump()&quot;, str)
    prints::
        list(result) -&gt; [&#039;1999&#039;, &#039;/&#039;, &#039;12&#039;, &#039;/&#039;, &#039;31&#039;]
        result[0] -&gt; &#039;1999&#039;
        result[&#039;month&#039;] -&gt; &#039;12&#039;
        result.day -&gt; &#039;31&#039;
        &#039;month&#039; in result -&gt; True
        &#039;minutes&#039; in result -&gt; False
        result.dump() -&gt; [&#039;1999&#039;, &#039;/&#039;, &#039;12&#039;, &#039;/&#039;, &#039;31&#039;]
        - day: 31
        - month: 12
        - year: 1999
    &quot;&quot;&quot;
    def __new__(cls, toklist=None, name=None, asList=True, modal=True ):
        if isinstance(toklist, cls):
            return toklist
        retobj = object.__new__(cls)
        retobj.__doinit = True
        return retobj

    # Performance tuning: we construct a *lot* of these, so keep this
    # constructor as small and fast as possible
    def __init__( self, toklist=None, name=None, asList=True, modal=True, isinstance=isinstance ):
        if self.__doinit:
            self.__doinit = False
            self.__name = None
            self.__parent = None
            self.__accumNames = {}
            self.__asList = asList
            self.__modal = modal
            if toklist is None:
                toklist = []
            if isinstance(toklist, list):
                self.__toklist = toklist[:]
            elif isinstance(toklist, _generatorType):
                self.__toklist = list(toklist)
            else:
                self.__toklist = [toklist]
            self.__tokdict = dict()

        if name is not None and name:
            if not modal:
                self.__accumNames[name] = 0
            if isinstance(name,int):
                name = _ustr(name) # will always return a str, but use _ustr for consistency
            self.__name = name
            if not (isinstance(toklist, (type(None), basestring, list)) and toklist in (None,&#039;&#039;,[])):
                if isinstance(toklist,basestring):
                    toklist = [ toklist ]
                if asList:
                    if isinstance(toklist,ParseResults):
                        self[name] = _ParseResultsWithOffset(toklist.copy(),0)
                    else:
                        self[name] = _ParseResultsWithOffset(ParseResults(toklist[0]),0)
                    self[name].__name = name
                else:
                    try:
                        self[name] = toklist[0]
                    except (KeyError,TypeError,IndexError):
                        self[name] = toklist

    def __getitem__( self, i ):
        if isinstance( i, (int,slice) ):
            return self.__toklist[i]
        else:
            if i not in self.__accumNames:
                return self.__tokdict[i][-1][0]
            else:
                return ParseResults([ v[0] for v in self.__tokdict[i] ])

    def __setitem__( self, k, v, isinstance=isinstance ):
        if isinstance(v,_ParseResultsWithOffset):
            self.__tokdict[k] = self.__tokdict.get(k,list()) + [v]
            sub = v[0]
        elif isinstance(k,(int,slice)):
            self.__toklist[k] = v
            sub = v
        else:
            self.__tokdict[k] = self.__tokdict.get(k,list()) + [_ParseResultsWithOffset(v,0)]
            sub = v
        if isinstance(sub,ParseResults):
            sub.__parent = wkref(self)

    def __delitem__( self, i ):
        if isinstance(i,(int,slice)):
            mylen = len( self.__toklist )
            del self.__toklist[i]

            # convert int to slice
            if isinstance(i, int):
                if i &lt; 0:
                    i += mylen
                i = slice(i, i+1)
            # get removed indices
            removed = list(range(*i.indices(mylen)))
            removed.reverse()
            # fixup indices in token dictionary
            for name,occurrences in self.__tokdict.items():
                for j in removed:
                    for k, (value, position) in enumerate(occurrences):
                        occurrences[k] = _ParseResultsWithOffset(value, position - (position &gt; j))
        else:
            del self.__tokdict[i]

    def __contains__( self, k ):
        return k in self.__tokdict

    def __len__( self ): return len( self.__toklist )
    def __bool__(self): return ( not not self.__toklist )
    __nonzero__ = __bool__
    def __iter__( self ): return iter( self.__toklist )
    def __reversed__( self ): return iter( self.__toklist[::-1] )
    def _iterkeys( self ):
        if hasattr(self.__tokdict, &quot;iterkeys&quot;):
            return self.__tokdict.iterkeys()
        else:
            return iter(self.__tokdict)

    def _itervalues( self ):
        return (self[k] for k in self._iterkeys())
            
    def _iteritems( self ):
        return ((k, self[k]) for k in self._iterkeys())

    if PY_3:
        keys = _iterkeys       
        &quot;&quot;&quot;Returns an iterator of all named result keys (Python 3.x only).&quot;&quot;&quot;

        values = _itervalues
        &quot;&quot;&quot;Returns an iterator of all named result values (Python 3.x only).&quot;&quot;&quot;

        items = _iteritems
        &quot;&quot;&quot;Returns an iterator of all named result key-value tuples (Python 3.x only).&quot;&quot;&quot;

    else:
        iterkeys = _iterkeys
        &quot;&quot;&quot;Returns an iterator of all named result keys (Python 2.x only).&quot;&quot;&quot;

        itervalues = _itervalues
        &quot;&quot;&quot;Returns an iterator of all named result values (Python 2.x only).&quot;&quot;&quot;

        iteritems = _iteritems
        &quot;&quot;&quot;Returns an iterator of all named result key-value tuples (Python 2.x only).&quot;&quot;&quot;

        def keys( self ):
            &quot;&quot;&quot;Returns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x).&quot;&quot;&quot;
            return list(self.iterkeys())

        def values( self ):
            &quot;&quot;&quot;Returns all named result values (as a list in Python 2.x, as an iterator in Python 3.x).&quot;&quot;&quot;
            return list(self.itervalues())
                
        def items( self ):
            &quot;&quot;&quot;Returns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x).&quot;&quot;&quot;
            return list(self.iteritems())

    def haskeys( self ):
        &quot;&quot;&quot;Since keys() returns an iterator, this method is helpful in bypassing
           code that looks for the existence of any defined results names.&quot;&quot;&quot;
        return bool(self.__tokdict)
        
    def pop( self, *args, **kwargs):
        &quot;&quot;&quot;
        Removes and returns item at specified index (default=C{last}).
        Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
        argument or an integer argument, it will use C{list} semantics
        and pop tokens from the list of parsed tokens. If passed a 
        non-integer argument (most likely a string), it will use C{dict}
        semantics and pop the corresponding value from any defined 
        results names. A second default return value argument is 
        supported, just as in C{dict.pop()}.

        Example::
            def remove_first(tokens):
                tokens.pop(0)
            print(OneOrMore(Word(nums)).parseString(&quot;0 123 321&quot;)) # -&gt; [&#039;0&#039;, &#039;123&#039;, &#039;321&#039;]
            print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString(&quot;0 123 321&quot;)) # -&gt; [&#039;123&#039;, &#039;321&#039;]

            label = Word(alphas)
            patt = label(&quot;LABEL&quot;) + OneOrMore(Word(nums))
            print(patt.parseString(&quot;AAB 123 321&quot;).dump())

            # Use pop() in a parse action to remove named result (note that corresponding value is not
            # removed from list form of results)
            def remove_LABEL(tokens):
                tokens.pop(&quot;LABEL&quot;)
                return tokens
            patt.addParseAction(remove_LABEL)
            print(patt.parseString(&quot;AAB 123 321&quot;).dump())
        prints::
            [&#039;AAB&#039;, &#039;123&#039;, &#039;321&#039;]
            - LABEL: AAB

            [&#039;AAB&#039;, &#039;123&#039;, &#039;321&#039;]
        &quot;&quot;&quot;
        if not args:
            args = [-1]
        for k,v in kwargs.items():
            if k == &#039;default&#039;:
                args = (args[0], v)
            else:
                raise TypeError(&quot;pop() got an unexpected keyword argument &#039;%s&#039;&quot; % k)
        if (isinstance(args[0], int) or 
                        len(args) == 1 or 
                        args[0] in self):
            index = args[0]
            ret = self[index]
            del self[index]
            return ret
        else:
            defaultvalue = args[1]
            return defaultvalue

    def get(self, key, defaultValue=None):
        &quot;&quot;&quot;
        Returns named result matching the given key, or if there is no
        such name, then returns the given C{defaultValue} or C{None} if no
        C{defaultValue} is specified.

        Similar to C{dict.get()}.
        
        Example::
            integer = Word(nums)
            date_str = integer(&quot;year&quot;) + &#039;/&#039; + integer(&quot;month&quot;) + &#039;/&#039; + integer(&quot;day&quot;)           

            result = date_str.parseString(&quot;1999/12/31&quot;)
            print(result.get(&quot;year&quot;)) # -&gt; &#039;1999&#039;
            print(result.get(&quot;hour&quot;, &quot;not specified&quot;)) # -&gt; &#039;not specified&#039;
            print(result.get(&quot;hour&quot;)) # -&gt; None
        &quot;&quot;&quot;
        if key in self:
            return self[key]
        else:
            return defaultValue

    def insert( self, index, insStr ):
        &quot;&quot;&quot;
        Inserts new element at location index in the list of parsed tokens.
        
        Similar to C{list.insert()}.

        Example::
            print(OneOrMore(Word(nums)).parseString(&quot;0 123 321&quot;)) # -&gt; [&#039;0&#039;, &#039;123&#039;, &#039;321&#039;]

            # use a parse action to insert the parse location in the front of the parsed results
            def insert_locn(locn, tokens):
                tokens.insert(0, locn)
            print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString(&quot;0 123 321&quot;)) # -&gt; [0, &#039;0&#039;, &#039;123&#039;, &#039;321&#039;]
        &quot;&quot;&quot;
        self.__toklist.insert(index, insStr)
        # fixup indices in token dictionary
        for name,occurrences in self.__tokdict.items():
            for k, (value, position) in enumerate(occurrences):
                occurrences[k] = _ParseResultsWithOffset(value, position + (position &gt; index))

    def append( self, item ):
        &quot;&quot;&quot;
        Add single element to end of ParseResults list of elements.

        Example::
            print(OneOrMore(Word(nums)).parseString(&quot;0 123 321&quot;)) # -&gt; [&#039;0&#039;, &#039;123&#039;, &#039;321&#039;]
            
            # use a parse action to compute the sum of the parsed integers, and add it to the end
            def append_sum(tokens):
                tokens.append(sum(map(int, tokens)))
            print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString(&quot;0 123 321&quot;)) # -&gt; [&#039;0&#039;, &#039;123&#039;, &#039;321&#039;, 444]
        &quot;&quot;&quot;
        self.__toklist.append(item)

    def extend( self, itemseq ):
        &quot;&quot;&quot;
        Add sequence of elements to end of ParseResults list of elements.

        Example::
            patt = OneOrMore(Word(alphas))
            
            # use a parse action to append the reverse of the matched strings, to make a palindrome
            def make_palindrome(tokens):
                tokens.extend(reversed([t[::-1] for t in tokens]))
                return &#039;&#039;.join(tokens)
            print(patt.addParseAction(make_palindrome).parseString(&quot;lskdj sdlkjf lksd&quot;)) # -&gt; &#039;lskdjsdlkjflksddsklfjkldsjdksl&#039;
        &quot;&quot;&quot;
        if isinstance(itemseq, ParseResults):
            self += itemseq
        else:
            self.__toklist.extend(itemseq)

    def clear( self ):
        &quot;&quot;&quot;
        Clear all elements and results names.
        &quot;&quot;&quot;
        del self.__toklist[:]
        self.__tokdict.clear()

    def __getattr__( self, name ):
        try:
            return self[name]
        except KeyError:
            return &quot;&quot;
            
        if name in self.__tokdict:
            if name not in self.__accumNames:
                return self.__tokdict[name][-1][0]
            else:
                return ParseResults([ v[0] for v in self.__tokdict[name] ])
        else:
            return &quot;&quot;

    def __add__( self, other ):
        ret = self.copy()
        ret += other
        return ret

    def __iadd__( self, other ):
        if other.__tokdict:
            offset = len(self.__toklist)
            addoffset = lambda a: offset if a&lt;0 else a+offset
            otheritems = other.__tokdict.items()
            otherdictitems = [(k, _ParseResultsWithOffset(v[0],addoffset(v[1])) )
                                for (k,vlist) in otheritems for v in vlist]
            for k,v in otherdictitems:
                self[k] = v
                if isinstance(v[0],ParseResults):
                    v[0].__parent = wkref(self)
            
        self.__toklist += other.__toklist
        self.__accumNames.update( other.__accumNames )
        return self

    def __radd__(self, other):
        if isinstance(other,int) and other == 0:
            # useful for merging many ParseResults using sum() builtin
            return self.copy()
        else:
            # this may raise a TypeError - so be it
            return other + self
        
    def __repr__( self ):
        return &quot;(%s, %s)&quot; % ( repr( self.__toklist ), repr( self.__tokdict ) )

    def __str__( self ):
        return &#039;[&#039; + &#039;, &#039;.join(_ustr(i) if isinstance(i, ParseResults) else repr(i) for i in self.__toklist) + &#039;]&#039;

    def _asStringList( self, sep=&#039;&#039; ):
        out = []
        for item in self.__toklist:
            if out and sep:
                out.append(sep)
            if isinstance( item, ParseResults ):
                out += item._asStringList()
            else:
                out.append( _ustr(item) )
        return out

    def asList( self ):
        &quot;&quot;&quot;
        Returns the parse results as a nested list of matching tokens, all converted to strings.

        Example::
            patt = OneOrMore(Word(alphas))
            result = patt.parseString(&quot;sldkj lsdkj sldkj&quot;)
            # even though the result prints in string-like form, it is actually a pyparsing ParseResults
            print(type(result), result) # -&gt; &lt;class &#039;pyparsing.ParseResults&#039;&gt; [&#039;sldkj&#039;, &#039;lsdkj&#039;, &#039;sldkj&#039;]
            
            # Use asList() to create an actual list
            result_list = result.asList()
            print(type(result_list), result_list) # -&gt; &lt;class &#039;list&#039;&gt; [&#039;sldkj&#039;, &#039;lsdkj&#039;, &#039;sldkj&#039;]
        &quot;&quot;&quot;
        return [res.asList() if isinstance(res,ParseResults) else res for res in self.__toklist]

    def asDict( self ):
        &quot;&quot;&quot;
        Returns the named parse results as a nested dictionary.

        Example::
            integer = Word(nums)
            date_str = integer(&quot;year&quot;) + &#039;/&#039; + integer(&quot;month&quot;) + &#039;/&#039; + integer(&quot;day&quot;)
            
            result = date_str.parseString(&#039;12/31/1999&#039;)
            print(type(result), repr(result)) # -&gt; &lt;class &#039;pyparsing.ParseResults&#039;&gt; ([&#039;12&#039;, &#039;/&#039;, &#039;31&#039;, &#039;/&#039;, &#039;1999&#039;], {&#039;day&#039;: [(&#039;1999&#039;, 4)], &#039;year&#039;: [(&#039;12&#039;, 0)], &#039;month&#039;: [(&#039;31&#039;, 2)]})
            
            result_dict = result.asDict()
            print(type(result_dict), repr(result_dict)) # -&gt; &lt;class &#039;dict&#039;&gt; {&#039;day&#039;: &#039;1999&#039;, &#039;year&#039;: &#039;12&#039;, &#039;month&#039;: &#039;31&#039;}

            # even though a ParseResults supports dict-like access, sometime you just need to have a dict
            import json
            print(json.dumps(result)) # -&gt; Exception: TypeError: ... is not JSON serializable
            print(json.dumps(result.asDict())) # -&gt; {&quot;month&quot;: &quot;31&quot;, &quot;day&quot;: &quot;1999&quot;, &quot;year&quot;: &quot;12&quot;}
        &quot;&quot;&quot;
        if PY_3:
            item_fn = self.items
        else:
            item_fn = self.iteritems
            
        def toItem(obj):
            if isinstance(obj, ParseResults):
                if obj.haskeys():
                    return obj.asDict()
                else:
                    return [toItem(v) for v in obj]
            else:
                return obj
                
        return dict((k,toItem(v)) for k,v in item_fn())

    def copy( self ):
        &quot;&quot;&quot;
        Returns a new copy of a C{ParseResults} object.
        &quot;&quot;&quot;
        ret = ParseResults( self.__toklist )
        ret.__tokdict = self.__tokdict.copy()
        ret.__parent = self.__parent
        ret.__accumNames.update( self.__accumNames )
        ret.__name = self.__name
        return ret

    def asXML( self, doctag=None, namedItemsOnly=False, indent=&quot;&quot;, formatted=True ):
        &quot;&quot;&quot;
        (Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
        &quot;&quot;&quot;
        nl = &quot;\n&quot;
        out = []
        namedItems = dict((v[1],k) for (k,vlist) in self.__tokdict.items()
                                                            for v in vlist)
        nextLevelIndent = indent + &quot;  &quot;

        # collapse out indents if formatting is not desired
        if not formatted:
            indent = &quot;&quot;
            nextLevelIndent = &quot;&quot;
            nl = &quot;&quot;

        selfTag = None
        if doctag is not None:
            selfTag = doctag
        else:
            if self.__name:
                selfTag = self.__name

        if not selfTag:
            if namedItemsOnly:
                return &quot;&quot;
            else:
                selfTag = &quot;ITEM&quot;

        out += [ nl, indent, &quot;&lt;&quot;, selfTag, &quot;&gt;&quot; ]

        for i,res in enumerate(self.__toklist):
            if isinstance(res,ParseResults):
                if i in namedItems:
                    out += [ res.asXML(namedItems[i],
                                        namedItemsOnly and doctag is None,
                                        nextLevelIndent,
                                        formatted)]
                else:
                    out += [ res.asXML(None,
                                        namedItemsOnly and doctag is None,
                                        nextLevelIndent,
                                        formatted)]
            else:
                # individual token, see if there is a name for it
                resTag = None
                if i in namedItems:
                    resTag = namedItems[i]
                if not resTag:
                    if namedItemsOnly:
                        continue
                    else:
                        resTag = &quot;ITEM&quot;
                xmlBodyText = _xml_escape(_ustr(res))
                out += [ nl, nextLevelIndent, &quot;&lt;&quot;, resTag, &quot;&gt;&quot;,
                                                xmlBodyText,
                                                &quot;&lt;/&quot;, resTag, &quot;&gt;&quot; ]

        out += [ nl, indent, &quot;&lt;/&quot;, selfTag, &quot;&gt;&quot; ]
        return &quot;&quot;.join(out)

    def __lookup(self,sub):
        for k,vlist in self.__tokdict.items():
            for v,loc in vlist:
                if sub is v:
                    return k
        return None

    def getName(self):
        &quot;&quot;&quot;
        Returns the results name for this token expression. Useful when several 
        different expressions might match at a particular location.

        Example::
            integer = Word(nums)
            ssn_expr = Regex(r&quot;\d\d\d-\d\d-\d\d\d\d&quot;)
            house_number_expr = Suppress(&#039;#&#039;) + Word(nums, alphanums)
            user_data = (Group(house_number_expr)(&quot;house_number&quot;) 
                        | Group(ssn_expr)(&quot;ssn&quot;)
                        | Group(integer)(&quot;age&quot;))
            user_info = OneOrMore(user_data)
            
            result = user_info.parseString(&quot;22 111-22-3333 #221B&quot;)
            for item in result:
                print(item.getName(), &#039;:&#039;, item[0])
        prints::
            age : 22
            ssn : 111-22-3333
            house_number : 221B
        &quot;&quot;&quot;
        if self.__name:
            return self.__name
        elif self.__parent:
            par = self.__parent()
            if par:
                return par.__lookup(self)
            else:
                return None
        elif (len(self) == 1 and
               len(self.__tokdict) == 1 and
               next(iter(self.__tokdict.values()))[0][1] in (0,-1)):
            return next(iter(self.__tokdict.keys()))
        else:
            return None

    def dump(self, indent=&#039;&#039;, depth=0, full=True):
        &quot;&quot;&quot;
        Diagnostic method for listing out the contents of a C{ParseResults}.
        Accepts an optional C{indent} argument so that this string can be embedded
        in a nested display of other data.

        Example::
            integer = Word(nums)
            date_str = integer(&quot;year&quot;) + &#039;/&#039; + integer(&quot;month&quot;) + &#039;/&#039; + integer(&quot;day&quot;)
            
            result = date_str.parseString(&#039;12/31/1999&#039;)
            print(result.dump())
        prints::
            [&#039;12&#039;, &#039;/&#039;, &#039;31&#039;, &#039;/&#039;, &#039;1999&#039;]
            - day: 1999
            - month: 31
            - year: 12
        &quot;&quot;&quot;
        out = []
        NL = &#039;\n&#039;
        out.append( indent+_ustr(self.asList()) )
        if full:
            if self.haskeys():
                items = sorted((str(k), v) for k,v in self.items())
                for k,v in items:
                    if out:
                        out.append(NL)
                    out.append( &quot;%s%s- %s: &quot; % (indent,(&#039;  &#039;*depth), k) )
                    if isinstance(v,ParseResults):
                        if v:
                            out.append( v.dump(indent,depth+1) )
                        else:
                            out.append(_ustr(v))
                    else:
                        out.append(repr(v))
            elif any(isinstance(vv,ParseResults) for vv in self):
                v = self
                for i,vv in enumerate(v):
                    if isinstance(vv,ParseResults):
                        out.append(&quot;\n%s%s[%d]:\n%s%s%s&quot; % (indent,(&#039;  &#039;*(depth)),i,indent,(&#039;  &#039;*(depth+1)),vv.dump(indent,depth+1) ))
                    else:
                        out.append(&quot;\n%s%s[%d]:\n%s%s%s&quot; % (indent,(&#039;  &#039;*(depth)),i,indent,(&#039;  &#039;*(depth+1)),_ustr(vv)))
            
        return &quot;&quot;.join(out)

    def pprint(self, *args, **kwargs):
        &quot;&quot;&quot;
        Pretty-printer for parsed results as a list, using the C{pprint} module.
        Accepts additional positional or keyword args as defined for the 
        C{pprint.pprint} method. (U{http://docs.python.org/3/library/pprint.html#pprint.pprint})

        Example::
            ident = Word(alphas, alphanums)
            num = Word(nums)
            func = Forward()
            term = ident | num | Group(&#039;(&#039; + func + &#039;)&#039;)
            func &lt;&lt;= ident + Group(Optional(delimitedList(term)))
            result = func.parseString(&quot;fna a,b,(fnb c,d,200),100&quot;)
            result.pprint(width=40)
        prints::
            [&#039;fna&#039;,
             [&#039;a&#039;,
              &#039;b&#039;,
              [&#039;(&#039;, &#039;fnb&#039;, [&#039;c&#039;, &#039;d&#039;, &#039;200&#039;], &#039;)&#039;],
              &#039;100&#039;]]
        &quot;&quot;&quot;
        pprint.pprint(self.asList(), *args, **kwargs)

    # add support for pickle protocol
    def __getstate__(self):
        return ( self.__toklist,
                 ( self.__tokdict.copy(),
                   self.__parent is not None and self.__parent() or None,
                   self.__accumNames,
                   self.__name ) )

    def __setstate__(self,state):
        self.__toklist = state[0]
        (self.__tokdict,
         par,
         inAccumNames,
         self.__name) = state[1]
        self.__accumNames = {}
        self.__accumNames.update(inAccumNames)
        if par is not None:
            self.__parent = wkref(par)
        else:
            self.__parent = None

    def __getnewargs__(self):
        return self.__toklist, self.__name, self.__asList, self.__modal

    def __dir__(self):
        return (dir(type(self)) + list(self.keys()))

collections.MutableMapping.register(ParseResults)

def col (loc,strg):
    &quot;&quot;&quot;Returns current column within a string, counting newlines as line separators.
   The first column is number 1.

   Note: the default parsing behavior is to expand tabs in the input string
   before starting the parsing process.  See L{I{ParserElement.parseString}&lt;ParserElement.parseString&gt;} for more information
   on parsing strings containing C{&lt;TAB&gt;}s, and suggested methods to maintain a
   consistent view of the parsed string, the parse location, and line and column
   positions within the parsed string.
   &quot;&quot;&quot;
    s = strg
    return 1 if 0&lt;loc&lt;len(s) and s[loc-1] == &#039;\n&#039; else loc - s.rfind(&quot;\n&quot;, 0, loc)

def lineno(loc,strg):
    &quot;&quot;&quot;Returns current line number within a string, counting newlines as line separators.
   The first line is number 1.

   Note: the default parsing behavior is to expand tabs in the input string
   before starting the parsing process.  See L{I{ParserElement.parseString}&lt;ParserElement.parseString&gt;} for more information
   on parsing strings containing C{&lt;TAB&gt;}s, and suggested methods to maintain a
   consistent view of the parsed string, the parse location, and line and column
   positions within the parsed string.
   &quot;&quot;&quot;
    return strg.count(&quot;\n&quot;,0,loc) + 1

def line( loc, strg ):
    &quot;&quot;&quot;Returns the line of text containing loc within a string, counting newlines as line separators.
       &quot;&quot;&quot;
    lastCR = strg.rfind(&quot;\n&quot;, 0, loc)
    nextCR = strg.find(&quot;\n&quot;, loc)
    if nextCR &gt;= 0:
        return strg[lastCR+1:nextCR]
    else:
        return strg[lastCR+1:]

def _defaultStartDebugAction( instring, loc, expr ):
    print ((&quot;Match &quot; + _ustr(expr) + &quot; at loc &quot; + _ustr(loc) + &quot;(%d,%d)&quot; % ( lineno(loc,instring), col(loc,instring) )))

def _defaultSuccessDebugAction( instring, startloc, endloc, expr, toks ):
    print (&quot;Matched &quot; + _ustr(expr) + &quot; -&gt; &quot; + str(toks.asList()))

def _defaultExceptionDebugAction( instring, loc, expr, exc ):
    print (&quot;Exception raised:&quot; + _ustr(exc))

def nullDebugAction(*args):
    &quot;&quot;&quot;&#039;Do-nothing&#039; debug action, to suppress debugging output during parsing.&quot;&quot;&quot;
    pass

# Only works on Python 3.x - nonlocal is toxic to Python 2 installs
#~ &#039;decorator to trim function calls to match the arity of the target&#039;
#~ def _trim_arity(func, maxargs=3):
    #~ if func in singleArgBuiltins:
        #~ return lambda s,l,t: func(t)
    #~ limit = 0
    #~ foundArity = False
    #~ def wrapper(*args):
        #~ nonlocal limit,foundArity
        #~ while 1:
            #~ try:
                #~ ret = func(*args[limit:])
                #~ foundArity = True
                #~ return ret
            #~ except TypeError:
                #~ if limit == maxargs or foundArity:
                    #~ raise
                #~ limit += 1
                #~ continue
    #~ return wrapper

# this version is Python 2.x-3.x cross-compatible
&#039;decorator to trim function calls to match the arity of the target&#039;
def _trim_arity(func, maxargs=2):
    if func in singleArgBuiltins:
        return lambda s,l,t: func(t)
    limit = [0]
    foundArity = [False]
    
    # traceback return data structure changed in Py3.5 - normalize back to plain tuples
    if system_version[:2] &gt;= (3,5):
        def extract_stack(limit=0):
            # special handling for Python 3.5.0 - extra deep call stack by 1
            offset = -3 if system_version == (3,5,0) else -2
            frame_summary = traceback.extract_stack(limit=-offset+limit-1)[offset]
            return [(frame_summary.filename, frame_summary.lineno)]
        def extract_tb(tb, limit=0):
            frames = traceback.extract_tb(tb, limit=limit)
            frame_summary = frames[-1]
            return [(frame_summary.filename, frame_summary.lineno)]
    else:
        extract_stack = traceback.extract_stack
        extract_tb = traceback.extract_tb
    
    # synthesize what would be returned by traceback.extract_stack at the call to 
    # user&#039;s parse action &#039;func&#039;, so that we don&#039;t incur call penalty at parse time
    
    LINE_DIFF = 6
    # IF ANY CODE CHANGES, EVEN JUST COMMENTS OR BLANK LINES, BETWEEN THE NEXT LINE AND 
    # THE CALL TO FUNC INSIDE WRAPPER, LINE_DIFF MUST BE MODIFIED!!!!
    this_line = extract_stack(limit=2)[-1]
    pa_call_line_synth = (this_line[0], this_line[1]+LINE_DIFF)

    def wrapper(*args):
        while 1:
            try:
                ret = func(*args[limit[0]:])
                foundArity[0] = True
                return ret
            except TypeError:
                # re-raise TypeErrors if they did not come from our arity testing
                if foundArity[0]:
                    raise
                else:
                    try:
                        tb = sys.exc_info()[-1]
                        if not extract_tb(tb, limit=2)[-1][:2] == pa_call_line_synth:
                            raise
                    finally:
                        del tb

                if limit[0] &lt;= maxargs:
                    limit[0] += 1
                    continue
                raise

    # copy func name to wrapper for sensible debug output
    func_name = &quot;&lt;parse action&gt;&quot;
    try:
        func_name = getattr(func, &#039;__name__&#039;, 
                            getattr(func, &#039;__class__&#039;).__name__)
    except Exception:
        func_name = str(func)
    wrapper.__name__ = func_name

    return wrapper

class ParserElement(object):
    &quot;&quot;&quot;Abstract base level parser element class.&quot;&quot;&quot;
    DEFAULT_WHITE_CHARS = &quot; \n\t\r&quot;
    verbose_stacktrace = False

    @staticmethod
    def setDefaultWhitespaceChars( chars ):
        r&quot;&quot;&quot;
        Overrides the default whitespace chars

        Example::
            # default whitespace chars are space, &lt;TAB&gt; and newline
            OneOrMore(Word(alphas)).parseString(&quot;abc def\nghi jkl&quot;)  # -&gt; [&#039;abc&#039;, &#039;def&#039;, &#039;ghi&#039;, &#039;jkl&#039;]
            
            # change to just treat newline as significant
            ParserElement.setDefaultWhitespaceChars(&quot; \t&quot;)
            OneOrMore(Word(alphas)).parseString(&quot;abc def\nghi jkl&quot;)  # -&gt; [&#039;abc&#039;, &#039;def&#039;]
        &quot;&quot;&quot;
        ParserElement.DEFAULT_WHITE_CHARS = chars

    @staticmethod
    def inlineLiteralsUsing(cls):
        &quot;&quot;&quot;
        Set class to be used for inclusion of string literals into a parser.
        
        Example::
            # default literal class used is Literal
            integer = Word(nums)
            date_str = integer(&quot;year&quot;) + &#039;/&#039; + integer(&quot;month&quot;) + &#039;/&#039; + integer(&quot;day&quot;)           

            date_str.parseString(&quot;1999/12/31&quot;)  # -&gt; [&#039;1999&#039;, &#039;/&#039;, &#039;12&#039;, &#039;/&#039;, &#039;31&#039;]


            # change to Suppress
            ParserElement.inlineLiteralsUsing(Suppress)
            date_str = integer(&quot;year&quot;) + &#039;/&#039; + integer(&quot;month&quot;) + &#039;/&#039; + integer(&quot;day&quot;)           

            date_str.parseString(&quot;1999/12/31&quot;)  # -&gt; [&#039;1999&#039;, &#039;12&#039;, &#039;31&#039;]
        &quot;&quot;&quot;
        ParserElement._literalStringClass = cls

    def __init__( self, savelist=False ):
        self.parseAction = list()
        self.failAction = None
        #~ self.name = &quot;&lt;unknown&gt;&quot;  # don&#039;t define self.name, let subclasses try/except upcall
        self.strRepr = None
        self.resultsName = None
        self.saveAsList = savelist
        self.skipWhitespace = True
        self.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
        self.copyDefaultWhiteChars = True
        self.mayReturnEmpty = False # used when checking for left-recursion
        self.keepTabs = False
        self.ignoreExprs = list()
        self.debug = False
        self.streamlined = False
        self.mayIndexError = True # used to optimize exception handling for subclasses that don&#039;t advance parse index
        self.errmsg = &quot;&quot;
        self.modalResults = True # used to mark results names as modal (report only last) or cumulative (list all)
        self.debugActions = ( None, None, None ) #custom debug actions
        self.re = None
        self.callPreparse = True # used to avoid redundant calls to preParse
        self.callDuringTry = False

    def copy( self ):
        &quot;&quot;&quot;
        Make a copy of this C{ParserElement}.  Useful for defining different parse actions
        for the same parsing pattern, using copies of the original parse element.
        
        Example::
            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
            integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress(&quot;K&quot;)
            integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress(&quot;M&quot;)
            
            print(OneOrMore(integerK | integerM | integer).parseString(&quot;5K 100 640K 256M&quot;))
        prints::
            [5120, 100, 655360, 268435456]
        Equivalent form of C{expr.copy()} is just C{expr()}::
            integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress(&quot;M&quot;)
        &quot;&quot;&quot;
        cpy = copy.copy( self )
        cpy.parseAction = self.parseAction[:]
        cpy.ignoreExprs = self.ignoreExprs[:]
        if self.copyDefaultWhiteChars:
            cpy.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
        return cpy

    def setName( self, name ):
        &quot;&quot;&quot;
        Define name for this expression, makes debugging and exception messages clearer.
        
        Example::
            Word(nums).parseString(&quot;ABC&quot;)  # -&gt; Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
            Word(nums).setName(&quot;integer&quot;).parseString(&quot;ABC&quot;)  # -&gt; Exception: Expected integer (at char 0), (line:1, col:1)
        &quot;&quot;&quot;
        self.name = name
        self.errmsg = &quot;Expected &quot; + self.name
        if hasattr(self,&quot;exception&quot;):
            self.exception.msg = self.errmsg
        return self

    def setResultsName( self, name, listAllMatches=False ):
        &quot;&quot;&quot;
        Define name for referencing matching tokens as a nested attribute
        of the returned parse results.
        NOTE: this returns a *copy* of the original C{ParserElement} object;
        this is so that the client can define a basic element, such as an
        integer, and reference it in multiple places with different names.

        You can also set results names using the abbreviated syntax,
        C{expr(&quot;name&quot;)} in place of C{expr.setResultsName(&quot;name&quot;)} - 
        see L{I{__call__}&lt;__call__&gt;}.

        Example::
            date_str = (integer.setResultsName(&quot;year&quot;) + &#039;/&#039; 
                        + integer.setResultsName(&quot;month&quot;) + &#039;/&#039; 
                        + integer.setResultsName(&quot;day&quot;))

            # equivalent form:
            date_str = integer(&quot;year&quot;) + &#039;/&#039; + integer(&quot;month&quot;) + &#039;/&#039; + integer(&quot;day&quot;)
        &quot;&quot;&quot;
        newself = self.copy()
        if name.endswith(&quot;*&quot;):
            name = name[:-1]
            listAllMatches=True
        newself.resultsName = name
        newself.modalResults = not listAllMatches
        return newself

    def setBreak(self,breakFlag = True):
        &quot;&quot;&quot;Method to invoke the Python pdb debugger when this element is
           about to be parsed. Set C{breakFlag} to True to enable, False to
           disable.
        &quot;&quot;&quot;
        if breakFlag:
            _parseMethod = self._parse
            def breaker(instring, loc, doActions=True, callPreParse=True):
                import pdb
                pdb.set_trace()
                return _parseMethod( instring, loc, doActions, callPreParse )
            breaker._originalParseMethod = _parseMethod
            self._parse = breaker
        else:
            if hasattr(self._parse,&quot;_originalParseMethod&quot;):
                self._parse = self._parse._originalParseMethod
        return self

    def setParseAction( self, *fns, **kwargs ):
        &quot;&quot;&quot;
        Define action to perform when successfully matching parse element definition.
        Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
        C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
         - s   = the original string being parsed (see note below)
         - loc = the location of the matching substring
         - toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
        If the functions in fns modify the tokens, they can return them as the return
        value from fn, and the modified list of tokens will replace the original.
        Otherwise, fn does not need to return any value.

        Optional keyword arguments:
         - callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing

        Note: the default parsing behavior is to expand tabs in the input string
        before starting the parsing process.  See L{I{parseString}&lt;parseString&gt;} for more information
        on parsing strings containing C{&lt;TAB&gt;}s, and suggested methods to maintain a
        consistent view of the parsed string, the parse location, and line and column
        positions within the parsed string.
        
        Example::
            integer = Word(nums)
            date_str = integer + &#039;/&#039; + integer + &#039;/&#039; + integer

            date_str.parseString(&quot;1999/12/31&quot;)  # -&gt; [&#039;1999&#039;, &#039;/&#039;, &#039;12&#039;, &#039;/&#039;, &#039;31&#039;]

            # use parse action to convert to ints at parse time
            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
            date_str = integer + &#039;/&#039; + integer + &#039;/&#039; + integer

            # note that integer fields are now ints, not strings
            date_str.parseString(&quot;1999/12/31&quot;)  # -&gt; [1999, &#039;/&#039;, 12, &#039;/&#039;, 31]
        &quot;&quot;&quot;
        self.parseAction = list(map(_trim_arity, list(fns)))
        self.callDuringTry = kwargs.get(&quot;callDuringTry&quot;, False)
        return self

    def addParseAction( self, *fns, **kwargs ):
        &quot;&quot;&quot;
        Add parse action to expression&#039;s list of parse actions. See L{I{setParseAction}&lt;setParseAction&gt;}.
        
        See examples in L{I{copy}&lt;copy&gt;}.
        &quot;&quot;&quot;
        self.parseAction += list(map(_trim_arity, list(fns)))
        self.callDuringTry = self.callDuringTry or kwargs.get(&quot;callDuringTry&quot;, False)
        return self

    def addCondition(self, *fns, **kwargs):
        &quot;&quot;&quot;Add a boolean predicate function to expression&#039;s list of parse actions. See 
        L{I{setParseAction}&lt;setParseAction&gt;} for function call signatures. Unlike C{setParseAction}, 
        functions passed to C{addCondition} need to return boolean success/fail of the condition.

        Optional keyword arguments:
         - message = define a custom message to be used in the raised exception
         - fatal   = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
         
        Example::
            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
            year_int = integer.copy()
            year_int.addCondition(lambda toks: toks[0] &gt;= 2000, message=&quot;Only support years 2000 and later&quot;)
            date_str = year_int + &#039;/&#039; + integer + &#039;/&#039; + integer

            result = date_str.parseString(&quot;1999/12/31&quot;)  # -&gt; Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
        &quot;&quot;&quot;
        msg = kwargs.get(&quot;message&quot;, &quot;failed user-defined condition&quot;)
        exc_type = ParseFatalException if kwargs.get(&quot;fatal&quot;, False) else ParseException
        for fn in fns:
            def pa(s,l,t):
                if not bool(_trim_arity(fn)(s,l,t)):
                    raise exc_type(s,l,msg)
            self.parseAction.append(pa)
        self.callDuringTry = self.callDuringTry or kwargs.get(&quot;callDuringTry&quot;, False)
        return self

    def setFailAction( self, fn ):
        &quot;&quot;&quot;Define action to perform if parsing fails at this expression.
           Fail acton fn is a callable function that takes the arguments
           C{fn(s,loc,expr,err)} where:
            - s = string being parsed
            - loc = location where expression match was attempted and failed
            - expr = the parse expression that failed
            - err = the exception thrown
           The function returns no value.  It may throw C{L{ParseFatalException}}
           if it is desired to stop parsing immediately.&quot;&quot;&quot;
        self.failAction = fn
        return self

    def _skipIgnorables( self, instring, loc ):
        exprsFound = True
        while exprsFound:
            exprsFound = False
            for e in self.ignoreExprs:
                try:
                    while 1:
                        loc,dummy = e._parse( instring, loc )
                        exprsFound = True
                except ParseException:
                    pass
        return loc

    def preParse( self, instring, loc ):
        if self.ignoreExprs:
            loc = self._skipIgnorables( instring, loc )

        if self.skipWhitespace:
            wt = self.whiteChars
            instrlen = len(instring)
            while loc &lt; instrlen and instring[loc] in wt:
                loc += 1

        return loc

    def parseImpl( self, instring, loc, doActions=True ):
        return loc, []

    def postParse( self, instring, loc, tokenlist ):
        return tokenlist

    #~ @profile
    def _parseNoCache( self, instring, loc, doActions=True, callPreParse=True ):
        debugging = ( self.debug ) #and doActions )

        if debugging or self.failAction:
            #~ print (&quot;Match&quot;,self,&quot;at loc&quot;,loc,&quot;(%d,%d)&quot; % ( lineno(loc,instring), col(loc,instring) ))
            if (self.debugActions[0] ):
                self.debugActions[0]( instring, loc, self )
            if callPreParse and self.callPreparse:
                preloc = self.preParse( instring, loc )
            else:
                preloc = loc
            tokensStart = preloc
            try:
                try:
                    loc,tokens = self.parseImpl( instring, preloc, doActions )
                except IndexError:
                    raise ParseException( instring, len(instring), self.errmsg, self )
            except ParseBaseException as err:
                #~ print (&quot;Exception raised:&quot;, err)
                if self.debugActions[2]:
                    self.debugActions[2]( instring, tokensStart, self, err )
                if self.failAction:
                    self.failAction( instring, tokensStart, self, err )
                raise
        else:
            if callPreParse and self.callPreparse:
                preloc = self.preParse( instring, loc )
            else:
                preloc = loc
            tokensStart = preloc
            if self.mayIndexError or loc &gt;= len(instring):
                try:
                    loc,tokens = self.parseImpl( instring, preloc, doActions )
                except IndexError:
                    raise ParseException( instring, len(instring), self.errmsg, self )
            else:
                loc,tokens = self.parseImpl( instring, preloc, doActions )

        tokens = self.postParse( instring, loc, tokens )

        retTokens = ParseResults( tokens, self.resultsName, asList=self.saveAsList, modal=self.modalResults )
        if self.parseAction and (doActions or self.callDuringTry):
            if debugging:
                try:
                    for fn in self.parseAction:
                        tokens = fn( instring, tokensStart, retTokens )
                        if tokens is not None:
                            retTokens = ParseResults( tokens,
                                                      self.resultsName,
                                                      asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
                                                      modal=self.modalResults )
                except ParseBaseException as err:
                    #~ print &quot;Exception raised in user parse action:&quot;, err
                    if (self.debugActions[2] ):
                        self.debugActions[2]( instring, tokensStart, self, err )
                    raise
            else:
                for fn in self.parseAction:
                    tokens = fn( instring, tokensStart, retTokens )
                    if tokens is not None:
                        retTokens = ParseResults( tokens,
                                                  self.resultsName,
                                                  asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
                                                  modal=self.modalResults )

        if debugging:
            #~ print (&quot;Matched&quot;,self,&quot;-&gt;&quot;,retTokens.asList())
            if (self.debugActions[1] ):
                self.debugActions[1]( instring, tokensStart, loc, self, retTokens )

        return loc, retTokens

    def tryParse( self, instring, loc ):
        try:
            return self._parse( instring, loc, doActions=False )[0]
        except ParseFatalException:
            raise ParseException( instring, loc, self.errmsg, self)
    
    def canParseNext(self, instring, loc):
        try:
            self.tryParse(instring, loc)
        except (ParseException, IndexError):
            return False
        else:
            return True

    class _UnboundedCache(object):
        def __init__(self):
            cache = {}
            self.not_in_cache = not_in_cache = object()

            def get(self, key):
                return cache.get(key, not_in_cache)

            def set(self, key, value):
                cache[key] = value

            def clear(self):
                cache.clear()

            self.get = types.MethodType(get, self)
            self.set = types.MethodType(set, self)
            self.clear = types.MethodType(clear, self)

    if _OrderedDict is not None:
        class _FifoCache(object):
            def __init__(self, size):
                self.not_in_cache = not_in_cache = object()

                cache = _OrderedDict()

                def get(self, key):
                    return cache.get(key, not_in_cache)

                def set(self, key, value):
                    cache[key] = value
                    if len(cache) &gt; size:
                        cache.popitem(False)

                def clear(self):
                    cache.clear()

                self.get = types.MethodType(get, self)
                self.set = types.MethodType(set, self)
                self.clear = types.MethodType(clear, self)

    else:
        class _FifoCache(object):
            def __init__(self, size):
                self.not_in_cache = not_in_cache = object()

                cache = {}
                key_fifo = collections.deque([], size)

                def get(self, key):
                    return cache.get(key, not_in_cache)

                def set(self, key, value):
                    cache[key] = value
                    if len(cache) &gt; size:
                        cache.pop(key_fifo.popleft(), None)
                    key_fifo.append(key)

                def clear(self):
                    cache.clear()
                    key_fifo.clear()

                self.get = types.MethodType(get, self)
                self.set = types.MethodType(set, self)
                self.clear = types.MethodType(clear, self)

    # argument cache for optimizing repeated calls when backtracking through recursive expressions
    packrat_cache = {} # this is set later by enabledPackrat(); this is here so that resetCache() doesn&#039;t fail
    packrat_cache_lock = RLock()
    packrat_cache_stats = [0, 0]

    # this method gets repeatedly called during backtracking with the same arguments -
    # we can cache these arguments and save ourselves the trouble of re-parsing the contained expression
    def _parseCache( self, instring, loc, doActions=True, callPreParse=True ):
        HIT, MISS = 0, 1
        lookup = (self, instring, loc, callPreParse, doActions)
        with ParserElement.packrat_cache_lock:
            cache = ParserElement.packrat_cache
            value = cache.get(lookup)
            if value is cache.not_in_cache:
                ParserElement.packrat_cache_stats[MISS] += 1
                try:
                    value = self._parseNoCache(instring, loc, doActions, callPreParse)
                except ParseBaseException as pe:
                    # cache a copy of the exception, without the traceback
                    cache.set(lookup, pe.__class__(*pe.args))
                    raise
                else:
                    cache.set(lookup, (value[0], value[1].copy()))
                    return value
            else:
                ParserElement.packrat_cache_stats[HIT] += 1
                if isinstance(value, Exception):
                    raise value
                return (value[0], value[1].copy())

    _parse = _parseNoCache

    @staticmethod
    def resetCache():
        ParserElement.packrat_cache.clear()
        ParserElement.packrat_cache_stats[:] = [0] * len(ParserElement.packrat_cache_stats)

    _packratEnabled = False
    @staticmethod
    def enablePackrat(cache_size_limit=128):
        &quot;&quot;&quot;Enables &quot;packrat&quot; parsing, which adds memoizing to the parsing logic.
           Repeated parse attempts at the same string location (which happens
           often in many complex grammars) can immediately return a cached value,
           instead of re-executing parsing/validating code.  Memoizing is done of
           both valid results and parsing exceptions.
           
           Parameters:
            - cache_size_limit - (default=C{128}) - if an integer value is provided
              will limit the size of the packrat cache; if None is passed, then
              the cache size will be unbounded; if 0 is passed, the cache will
              be effectively disabled.
            
           This speedup may break existing programs that use parse actions that
           have side-effects.  For this reason, packrat parsing is disabled when
           you first import pyparsing.  To activate the packrat feature, your
           program must call the class method C{ParserElement.enablePackrat()}.  If
           your program uses C{psyco} to &quot;compile as you go&quot;, you must call
           C{enablePackrat} before calling C{psyco.full()}.  If you do not do this,
           Python will crash.  For best results, call C{enablePackrat()} immediately
           after importing pyparsing.
           
           Example::
               import pyparsing
               pyparsing.ParserElement.enablePackrat()
        &quot;&quot;&quot;
        if not ParserElement._packratEnabled:
            ParserElement._packratEnabled = True
            if cache_size_limit is None:
                ParserElement.packrat_cache = ParserElement._UnboundedCache()
            else:
                ParserElement.packrat_cache = ParserElement._FifoCache(cache_size_limit)
            ParserElement._parse = ParserElement._parseCache

    def parseString( self, instring, parseAll=False ):
        &quot;&quot;&quot;
        Execute the parse expression with the given string.
        This is the main interface to the client code, once the complete
        expression has been built.

        If you want the grammar to require that the entire input string be
        successfully parsed, then set C{parseAll} to True (equivalent to ending
        the grammar with C{L{StringEnd()}}).

        Note: C{parseString} implicitly calls C{expandtabs()} on the input string,
        in order to report proper column numbers in parse actions.
        If the input string contains tabs and
        the grammar uses parse actions that use the C{loc} argument to index into the
        string being parsed, you can ensure you have a consistent view of the input
        string by:
         - calling C{parseWithTabs} on your grammar before calling C{parseString}
           (see L{I{parseWithTabs}&lt;parseWithTabs&gt;})
         - define your parse action using the full C{(s,loc,toks)} signature, and
           reference the input string using the parse action&#039;s C{s} argument
         - explictly expand the tabs in your input string before calling
           C{parseString}
        
        Example::
            Word(&#039;a&#039;).parseString(&#039;aaaaabaaa&#039;)  # -&gt; [&#039;aaaaa&#039;]
            Word(&#039;a&#039;).parseString(&#039;aaaaabaaa&#039;, parseAll=True)  # -&gt; Exception: Expected end of text
        &quot;&quot;&quot;
        ParserElement.resetCache()
        if not self.streamlined:
            self.streamline()
            #~ self.saveAsList = True
        for e in self.ignoreExprs:
            e.streamline()
        if not self.keepTabs:
            instring = instring.expandtabs()
        try:
            loc, tokens = self._parse( instring, 0 )
            if parseAll:
                loc = self.preParse( instring, loc )
                se = Empty() + StringEnd()
                se._parse( instring, loc )
        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
        else:
            return tokens

    def scanString( self, instring, maxMatches=_MAX_INT, overlap=False ):
        &quot;&quot;&quot;
        Scan the input string for expression matches.  Each match will return the
        matching tokens, start location, and end location.  May be called with optional
        C{maxMatches} argument, to clip scanning after &#039;n&#039; matches are found.  If
        C{overlap} is specified, then overlapping matches will be reported.

        Note that the start and end locations are reported relative to the string
        being parsed.  See L{I{parseString}&lt;parseString&gt;} for more information on parsing
        strings with embedded tabs.

        Example::
            source = &quot;sldjf123lsdjjkf345sldkjf879lkjsfd987&quot;
            print(source)
            for tokens,start,end in Word(alphas).scanString(source):
                print(&#039; &#039;*start + &#039;^&#039;*(end-start))
                print(&#039; &#039;*start + tokens[0])
        
        prints::
        
            sldjf123lsdjjkf345sldkjf879lkjsfd987
            ^^^^^
            sldjf
                    ^^^^^^^
                    lsdjjkf
                              ^^^^^^
                              sldkjf
                                       ^^^^^^
                                       lkjsfd
        &quot;&quot;&quot;
        if not self.streamlined:
            self.streamline()
        for e in self.ignoreExprs:
            e.streamline()

        if not self.keepTabs:
            instring = _ustr(instring).expandtabs()
        instrlen = len(instring)
        loc = 0
        preparseFn = self.preParse
        parseFn = self._parse
        ParserElement.resetCache()
        matches = 0
        try:
            while loc &lt;= instrlen and matches &lt; maxMatches:
                try:
                    preloc = preparseFn( instring, loc )
                    nextLoc,tokens = parseFn( instring, preloc, callPreParse=False )
                except ParseException:
                    loc = preloc+1
                else:
                    if nextLoc &gt; loc:
                        matches += 1
                        yield tokens, preloc, nextLoc
                        if overlap:
                            nextloc = preparseFn( instring, loc )
                            if nextloc &gt; loc:
                                loc = nextLoc
                            else:
                                loc += 1
                        else:
                            loc = nextLoc
                    else:
                        loc = preloc+1
        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

    def transformString( self, instring ):
        &quot;&quot;&quot;
        Extension to C{L{scanString}}, to modify matching text with modified tokens that may
        be returned from a parse action.  To use C{transformString}, define a grammar and
        attach a parse action to it that modifies the returned token list.
        Invoking C{transformString()} on a target string will then scan for matches,
        and replace the matched text patterns according to the logic in the parse
        action.  C{transformString()} returns the resulting transformed string.
        
        Example::
            wd = Word(alphas)
            wd.setParseAction(lambda toks: toks[0].title())
            
            print(wd.transformString(&quot;now is the winter of our discontent made glorious summer by this sun of york.&quot;))
        Prints::
            Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
        &quot;&quot;&quot;
        out = []
        lastE = 0
        # force preservation of &lt;TAB&gt;s, to minimize unwanted transformation of string, and to
        # keep string locs straight between transformString and scanString
        self.keepTabs = True
        try:
            for t,s,e in self.scanString( instring ):
                out.append( instring[lastE:s] )
                if t:
                    if isinstance(t,ParseResults):
                        out += t.asList()
                    elif isinstance(t,list):
                        out += t
                    else:
                        out.append(t)
                lastE = e
            out.append(instring[lastE:])
            out = [o for o in out if o]
            return &quot;&quot;.join(map(_ustr,_flatten(out)))
        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

    def searchString( self, instring, maxMatches=_MAX_INT ):
        &quot;&quot;&quot;
        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 &#039;n&#039; 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(&quot;More than Iron, more than Lead, more than Gold I need Electricity&quot;))
        prints::
            [&#039;More&#039;, &#039;Iron&#039;, &#039;Lead&#039;, &#039;Gold&#039;, &#039;I&#039;]
        &quot;&quot;&quot;
        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

    def split(self, instring, maxsplit=_MAX_INT, includeSeparators=False):
        &quot;&quot;&quot;
        Generator method to split a string using the given expression as a separator.
        May be called with optional C{maxsplit} argument, to limit the number of splits;
        and the optional C{includeSeparators} argument (default=C{False}), if the separating
        matching text should be included in the split results.
        
        Example::        
            punc = oneOf(list(&quot;.,;:/-!?&quot;))
            print(list(punc.split(&quot;This, this?, this sentence, is badly punctuated!&quot;)))
        prints::
            [&#039;This&#039;, &#039; this&#039;, &#039;&#039;, &#039; this sentence&#039;, &#039; is badly punctuated&#039;, &#039;&#039;]
        &quot;&quot;&quot;
        splits = 0
        last = 0
        for t,s,e in self.scanString(instring, maxMatches=maxsplit):
            yield instring[last:s]
            if includeSeparators:
                yield t[0]
            last = e
        yield instring[last:]

    def __add__(self, other ):
        &quot;&quot;&quot;
        Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
        converts them to L{Literal}s by default.
        
        Example::
            greet = Word(alphas) + &quot;,&quot; + Word(alphas) + &quot;!&quot;
            hello = &quot;Hello, World!&quot;
            print (hello, &quot;-&gt;&quot;, greet.parseString(hello))
        Prints::
            Hello, World! -&gt; [&#039;Hello&#039;, &#039;,&#039;, &#039;World&#039;, &#039;!&#039;]
        &quot;&quot;&quot;
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        if not isinstance( other, ParserElement ):
            warnings.warn(&quot;Cannot combine element of type %s with ParserElement&quot; % type(other),
                    SyntaxWarning, stacklevel=2)
            return None
        return And( [ self, other ] )

    def __radd__(self, other ):
        &quot;&quot;&quot;
        Implementation of + operator when left operand is not a C{L{ParserElement}}
        &quot;&quot;&quot;
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        if not isinstance( other, ParserElement ):
            warnings.warn(&quot;Cannot combine element of type %s with ParserElement&quot; % type(other),
                    SyntaxWarning, stacklevel=2)
            return None
        return other + self

    def __sub__(self, other):
        &quot;&quot;&quot;
        Implementation of - operator, returns C{L{And}} with error stop
        &quot;&quot;&quot;
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        if not isinstance( other, ParserElement ):
            warnings.warn(&quot;Cannot combine element of type %s with ParserElement&quot; % type(other),
                    SyntaxWarning, stacklevel=2)
            return None
        return And( [ self, And._ErrorStop(), other ] )

    def __rsub__(self, other ):
        &quot;&quot;&quot;
        Implementation of - operator when left operand is not a C{L{ParserElement}}
        &quot;&quot;&quot;
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        if not isinstance( other, ParserElement ):
            warnings.warn(&quot;Cannot combine element of type %s with ParserElement&quot; % type(other),
                    SyntaxWarning, stacklevel=2)
            return None
        return other - self

    def __mul__(self,other):
        &quot;&quot;&quot;
        Implementation of * operator, allows use of C{expr * 3} in place of
        C{expr + expr + expr}.  Expressions may also me multiplied by a 2-integer
        tuple, similar to C{{min,max}} multipliers in regular expressions.  Tuples
        may also include C{None} as in:
         - C{expr*(n,None)} or C{expr*(n,)} is equivalent
              to C{expr*n + L{ZeroOrMore}(expr)}
              (read as &quot;at least n instances of C{expr}&quot;)
         - C{expr*(None,n)} is equivalent to C{expr*(0,n)}
              (read as &quot;0 to n instances of C{expr}&quot;)
         - C{expr*(None,None)} is equivalent to C{L{ZeroOrMore}(expr)}
         - C{expr*(1,None)} is equivalent to C{L{OneOrMore}(expr)}

        Note that C{expr*(None,n)} does not raise an exception if
        more than n exprs exist in the input stream; that is,
        C{expr*(None,n)} does not enforce a maximum number of expr
        occurrences.  If this behavior is desired, then write
        C{expr*(None,n) + ~expr}
        &quot;&quot;&quot;
        if isinstance(other,int):
            minElements, optElements = other,0
        elif isinstance(other,tuple):
            other = (other + (None, None))[:2]
            if other[0] is None:
                other = (0, other[1])
            if isinstance(other[0],int) and other[1] is None:
                if other[0] == 0:
                    return ZeroOrMore(self)
                if other[0] == 1:
                    return OneOrMore(self)
                else:
                    return self*other[0] + ZeroOrMore(self)
            elif isinstance(other[0],int) and isinstance(other[1],int):
                minElements, optElements = other
                optElements -= minElements
            else:
                raise TypeError(&quot;cannot multiply &#039;ParserElement&#039; and (&#039;%s&#039;,&#039;%s&#039;) objects&quot;, type(other[0]),type(other[1]))
        else:
            raise TypeError(&quot;cannot multiply &#039;ParserElement&#039; and &#039;%s&#039; objects&quot;, type(other))

        if minElements &lt; 0:
            raise ValueError(&quot;cannot multiply ParserElement by negative value&quot;)
        if optElements &lt; 0:
            raise ValueError(&quot;second tuple value must be greater or equal to first tuple value&quot;)
        if minElements == optElements == 0:
            raise ValueError(&quot;cannot multiply ParserElement by 0 or (0,0)&quot;)

        if (optElements):
            def makeOptionalList(n):
                if n&gt;1:
                    return Optional(self + makeOptionalList(n-1))
                else:
                    return Optional(self)
            if minElements:
                if minElements == 1:
                    ret = self + makeOptionalList(optElements)
                else:
                    ret = And([self]*minElements) + makeOptionalList(optElements)
            else:
                ret = makeOptionalList(optElements)
        else:
            if minElements == 1:
                ret = self
            else:
                ret = And([self]*minElements)
        return ret

    def __rmul__(self, other):
        return self.__mul__(other)

    def __or__(self, other ):
        &quot;&quot;&quot;
        Implementation of | operator - returns C{L{MatchFirst}}
        &quot;&quot;&quot;
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        if not isinstance( other, ParserElement ):
            warnings.warn(&quot;Cannot combine element of type %s with ParserElement&quot; % type(other),
                    SyntaxWarning, stacklevel=2)
            return None
        return MatchFirst( [ self, other ] )

    def __ror__(self, other ):
        &quot;&quot;&quot;
        Implementation of | operator when left operand is not a C{L{ParserElement}}
        &quot;&quot;&quot;
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        if not isinstance( other, ParserElement ):
            warnings.warn(&quot;Cannot combine element of type %s with ParserElement&quot; % type(other),
                    SyntaxWarning, stacklevel=2)
            return None
        return other | self

    def __xor__(self, other ):
        &quot;&quot;&quot;
        Implementation of ^ operator - returns C{L{Or}}
        &quot;&quot;&quot;
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        if not isinstance( other, ParserElement ):
            warnings.warn(&quot;Cannot combine element of type %s with ParserElement&quot; % type(other),
                    SyntaxWarning, stacklevel=2)
            return None
        return Or( [ self, other ] )

    def __rxor__(self, other ):
        &quot;&quot;&quot;
        Implementation of ^ operator when left operand is not a C{L{ParserElement}}
        &quot;&quot;&quot;
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        if not isinstance( other, ParserElement ):
            warnings.warn(&quot;Cannot combine element of type %s with ParserElement&quot; % type(other),
                    SyntaxWarning, stacklevel=2)
            return None
        return other ^ self

    def __and__(self, other ):
        &quot;&quot;&quot;
        Implementation of &amp; operator - returns C{L{Each}}
        &quot;&quot;&quot;
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        if not isinstance( other, ParserElement ):
            warnings.warn(&quot;Cannot combine element of type %s with ParserElement&quot; % type(other),
                    SyntaxWarning, stacklevel=2)
            return None
        return Each( [ self, other ] )

    def __rand__(self, other ):
        &quot;&quot;&quot;
        Implementation of &amp; operator when left operand is not a C{L{ParserElement}}
        &quot;&quot;&quot;
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        if not isinstance( other, ParserElement ):
            warnings.warn(&quot;Cannot combine element of type %s with ParserElement&quot; % type(other),
                    SyntaxWarning, stacklevel=2)
            return None
        return other &amp; self

    def __invert__( self ):
        &quot;&quot;&quot;
        Implementation of ~ operator - returns C{L{NotAny}}
        &quot;&quot;&quot;
        return NotAny( self )

    def __call__(self, name=None):
        &quot;&quot;&quot;
        Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
        
        If C{name} is given with a trailing C{&#039;*&#039;} character, then C{listAllMatches} will be
        passed as C{True}.
           
        If C{name} is omitted, same as calling C{L{copy}}.

        Example::
            # these are equivalent
            userdata = Word(alphas).setResultsName(&quot;name&quot;) + Word(nums+&quot;-&quot;).setResultsName(&quot;socsecno&quot;)
            userdata = Word(alphas)(&quot;name&quot;) + Word(nums+&quot;-&quot;)(&quot;socsecno&quot;)             
        &quot;&quot;&quot;
        if name is not None:
            return self.setResultsName(name)
        else:
            return self.copy()

    def suppress( self ):
        &quot;&quot;&quot;
        Suppresses the output of this C{ParserElement}; useful to keep punctuation from
        cluttering up returned output.
        &quot;&quot;&quot;
        return Suppress( self )

    def leaveWhitespace( self ):
        &quot;&quot;&quot;
        Disables the skipping of whitespace before matching the characters in the
        C{ParserElement}&#039;s defined pattern.  This is normally only used internally by
        the pyparsing module, but may be needed in some whitespace-sensitive grammars.
        &quot;&quot;&quot;
        self.skipWhitespace = False
        return self

    def setWhitespaceChars( self, chars ):
        &quot;&quot;&quot;
        Overrides the default whitespace chars
        &quot;&quot;&quot;
        self.skipWhitespace = True
        self.whiteChars = chars
        self.copyDefaultWhiteChars = False
        return self

    def parseWithTabs( self ):
        &quot;&quot;&quot;
        Overrides default behavior to expand C{&lt;TAB&gt;}s to spaces before parsing the input string.
        Must be called before C{parseString} when the input grammar contains elements that
        match C{&lt;TAB&gt;} characters.
        &quot;&quot;&quot;
        self.keepTabs = True
        return self

    def ignore( self, other ):
        &quot;&quot;&quot;
        Define expression to be ignored (e.g., comments) while doing pattern
        matching; may be called repeatedly, to define multiple comment or other
        ignorable patterns.
        
        Example::
            patt = OneOrMore(Word(alphas))
            patt.parseString(&#039;ablaj /* comment */ lskjd&#039;) # -&gt; [&#039;ablaj&#039;]
            
            patt.ignore(cStyleComment)
            patt.parseString(&#039;ablaj /* comment */ lskjd&#039;) # -&gt; [&#039;ablaj&#039;, &#039;lskjd&#039;]
        &quot;&quot;&quot;
        if isinstance(other, basestring):
            other = Suppress(other)

        if isinstance( other, Suppress ):
            if other not in self.ignoreExprs:
                self.ignoreExprs.append(other)
        else:
            self.ignoreExprs.append( Suppress( other.copy() ) )
        return self

    def setDebugActions( self, startAction, successAction, exceptionAction ):
        &quot;&quot;&quot;
        Enable display of debugging messages while doing pattern matching.
        &quot;&quot;&quot;
        self.debugActions = (startAction or _defaultStartDebugAction,
                             successAction or _defaultSuccessDebugAction,
                             exceptionAction or _defaultExceptionDebugAction)
        self.debug = True
        return self

    def setDebug( self, flag=True ):
        &quot;&quot;&quot;
        Enable display of debugging messages while doing pattern matching.
        Set C{flag} to True to enable, False to disable.

        Example::
            wd = Word(alphas).setName(&quot;alphaword&quot;)
            integer = Word(nums).setName(&quot;numword&quot;)
            term = wd | integer
            
            # turn on debugging for wd
            wd.setDebug()

            OneOrMore(term).parseString(&quot;abc 123 xyz 890&quot;)
        
        prints::
            Match alphaword at loc 0(1,1)
            Matched alphaword -&gt; [&#039;abc&#039;]
            Match alphaword at loc 3(1,4)
            Exception raised:Expected alphaword (at char 4), (line:1, col:5)
            Match alphaword at loc 7(1,8)
            Matched alphaword -&gt; [&#039;xyz&#039;]
            Match alphaword at loc 11(1,12)
            Exception raised:Expected alphaword (at char 12), (line:1, col:13)
            Match alphaword at loc 15(1,16)
            Exception raised:Expected alphaword (at char 15), (line:1, col:16)

        The output shown is that produced by the default debug actions - custom debug actions can be
        specified using L{setDebugActions}. Prior to attempting
        to match the C{wd} expression, the debugging message C{&quot;Match &lt;exprname&gt; at loc &lt;n&gt;(&lt;line&gt;,&lt;col&gt;)&quot;}
        is shown. Then if the parse succeeds, a C{&quot;Matched&quot;} message is shown, or an C{&quot;Exception raised&quot;}
        message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
        which makes debugging and exception messages easier to understand - for instance, the default
        name created for the C{Word} expression without calling C{setName} is C{&quot;W:(ABCD...)&quot;}.
        &quot;&quot;&quot;
        if flag:
            self.setDebugActions( _defaultStartDebugAction, _defaultSuccessDebugAction, _defaultExceptionDebugAction )
        else:
            self.debug = False
        return self

    def __str__( self ):
        return self.name

    def __repr__( self ):
        return _ustr(self)

    def streamline( self ):
        self.streamlined = True
        self.strRepr = None
        return self

    def checkRecursion( self, parseElementList ):
        pass

    def validate( self, validateTrace=[] ):
        &quot;&quot;&quot;
        Check defined expressions for valid structure, check for infinite recursive definitions.
        &quot;&quot;&quot;
        self.checkRecursion( [] )

    def parseFile( self, file_or_filename, parseAll=False ):
        &quot;&quot;&quot;
        Execute the parse expression on the given file or filename.
        If a filename is specified (instead of a file object),
        the entire file is opened, read, and closed before parsing.
        &quot;&quot;&quot;
        try:
            file_contents = file_or_filename.read()
        except AttributeError:
            with open(file_or_filename, &quot;r&quot;) as f:
                file_contents = f.read()
        try:
            return self.parseString(file_contents, parseAll)
        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

    def __eq__(self,other):
        if isinstance(other, ParserElement):
            return self is other or vars(self) == vars(other)
        elif isinstance(other, basestring):
            return self.matches(other)
        else:
            return super(ParserElement,self)==other

    def __ne__(self,other):
        return not (self == other)

    def __hash__(self):
        return hash(id(self))

    def __req__(self,other):
        return self == other

    def __rne__(self,other):
        return not (self == other)

    def matches(self, testString, parseAll=True):
        &quot;&quot;&quot;
        Method for quick testing of a parser against a test string. Good for simple 
        inline microtests of sub expressions while building up larger parser.
           
        Parameters:
         - testString - to test against this expression for a match
         - parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
            
        Example::
            expr = Word(nums)
            assert expr.matches(&quot;100&quot;)
        &quot;&quot;&quot;
        try:
            self.parseString(_ustr(testString), parseAll=parseAll)
            return True
        except ParseBaseException:
            return False
                
    def runTests(self, tests, parseAll=True, comment=&#039;#&#039;, fullDump=True, printResults=True, failureTests=False):
        &quot;&quot;&quot;
        Execute the parse expression on a series of test strings, showing each
        test, the parsed results or where the parse failed. Quick and easy way to
        run a parse expression against a list of sample strings.
           
        Parameters:
         - tests - a list of separate test strings, or a multiline string of test strings
         - parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests           
         - comment - (default=C{&#039;#&#039;}) - expression for indicating embedded comments in the test 
              string; pass None to disable comment filtering
         - fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
              if False, only dump nested list
         - printResults - (default=C{True}) prints test output to stdout
         - failureTests - (default=C{False}) indicates if these tests are expected to fail parsing

        Returns: a (success, results) tuple, where success indicates that all tests succeeded
        (or failed if C{failureTests} is True), and the results contain a list of lines of each 
        test&#039;s output
        
        Example::
            number_expr = pyparsing_common.number.copy()

            result = number_expr.runTests(&#039;&#039;&#039;
                # unsigned integer
                100
                # negative integer
                -100
                # float with scientific notation
                6.02e23
                # integer with scientific notation
                1e-12
                &#039;&#039;&#039;)
            print(&quot;Success&quot; if result[0] else &quot;Failed!&quot;)

            result = number_expr.runTests(&#039;&#039;&#039;
                # stray character
                100Z
                # missing leading digit before &#039;.&#039;
                -.100
                # too many &#039;.&#039;
                3.14.159
                &#039;&#039;&#039;, failureTests=True)
            print(&quot;Success&quot; if result[0] else &quot;Failed!&quot;)
        prints::
            # unsigned integer
            100
            [100]

            # negative integer
            -100
            [-100]

            # float with scientific notation
            6.02e23
            [6.02e+23]

            # integer with scientific notation
            1e-12
            [1e-12]

            Success
            
            # stray character
            100Z
               ^
            FAIL: Expected end of text (at char 3), (line:1, col:4)

            # missing leading digit before &#039;.&#039;
            -.100
            ^
            FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)

            # too many &#039;.&#039;
            3.14.159
                ^
            FAIL: Expected end of text (at char 4), (line:1, col:5)

            Success

        Each test string must be on a single line. If you want to test a string that spans multiple
        lines, create a test like this::

            expr.runTest(r&quot;this is a test\\n of strings that spans \\n 3 lines&quot;)
        
        (Note that this is a raw string literal, you must include the leading &#039;r&#039;.)
        &quot;&quot;&quot;
        if isinstance(tests, basestring):
            tests = list(map(str.strip, tests.rstrip().splitlines()))
        if isinstance(comment, basestring):
            comment = Literal(comment)
        allResults = []
        comments = []
        success = True
        for t in tests:
            if comment is not None and comment.matches(t, False) or comments and not t:
                comments.append(t)
                continue
            if not t:
                continue
            out = [&#039;\n&#039;.join(comments), t]
            comments = []
            try:
                t = t.replace(r&#039;\n&#039;,&#039;\n&#039;)
                result = self.parseString(t, parseAll=parseAll)
                out.append(result.dump(full=fullDump))
                success = success and not failureTests
            except ParseBaseException as pe:
                fatal = &quot;(FATAL)&quot; if isinstance(pe, ParseFatalException) else &quot;&quot;
                if &#039;\n&#039; in t:
                    out.append(line(pe.loc, t))
                    out.append(&#039; &#039;*(col(pe.loc,t)-1) + &#039;^&#039; + fatal)
                else:
                    out.append(&#039; &#039;*pe.loc + &#039;^&#039; + fatal)
                out.append(&quot;FAIL: &quot; + str(pe))
                success = success and failureTests
                result = pe
            except Exception as exc:
                out.append(&quot;FAIL-EXCEPTION: &quot; + str(exc))
                success = success and failureTests
                result = exc

            if printResults:
                if fullDump:
                    out.append(&#039;&#039;)
                print(&#039;\n&#039;.join(out))

            allResults.append((t, result))
        
        return success, allResults

        
class Token(ParserElement):
    &quot;&quot;&quot;
    Abstract C{ParserElement} subclass, for defining atomic matching patterns.
    &quot;&quot;&quot;
    def __init__( self ):
        super(Token,self).__init__( savelist=False )


class Empty(Token):
    &quot;&quot;&quot;
    An empty token, will always match.
    &quot;&quot;&quot;
    def __init__( self ):
        super(Empty,self).__init__()
        self.name = &quot;Empty&quot;
        self.mayReturnEmpty = True
        self.mayIndexError = False


class NoMatch(Token):
    &quot;&quot;&quot;
    A token that will never match.
    &quot;&quot;&quot;
    def __init__( self ):
        super(NoMatch,self).__init__()
        self.name = &quot;NoMatch&quot;
        self.mayReturnEmpty = True
        self.mayIndexError = False
        self.errmsg = &quot;Unmatchable token&quot;

    def parseImpl( self, instring, loc, doActions=True ):
        raise ParseException(instring, loc, self.errmsg, self)


class Literal(Token):
    &quot;&quot;&quot;
    Token to exactly match a specified string.
    
    Example::
        Literal(&#039;blah&#039;).parseString(&#039;blah&#039;)  # -&gt; [&#039;blah&#039;]
        Literal(&#039;blah&#039;).parseString(&#039;blahfooblah&#039;)  # -&gt; [&#039;blah&#039;]
        Literal(&#039;blah&#039;).parseString(&#039;bla&#039;)  # -&gt; Exception: Expected &quot;blah&quot;
    
    For case-insensitive matching, use L{CaselessLiteral}.
    
    For keyword matching (force word break before and after the matched string),
    use L{Keyword} or L{CaselessKeyword}.
    &quot;&quot;&quot;
    def __init__( self, matchString ):
        super(Literal,self).__init__()
        self.match = matchString
        self.matchLen = len(matchString)
        try:
            self.firstMatchChar = matchString[0]
        except IndexError:
            warnings.warn(&quot;null string passed to Literal; use Empty() instead&quot;,
                            SyntaxWarning, stacklevel=2)
            self.__class__ = Empty
        self.name = &#039;&quot;%s&quot;&#039; % _ustr(self.match)
        self.errmsg = &quot;Expected &quot; + self.name
        self.mayReturnEmpty = False
        self.mayIndexError = False

    # Performance tuning: this routine gets called a *lot*
    # if this is a single character match string  and the first character matches,
    # short-circuit as quickly as possible, and avoid calling startswith
    #~ @profile
    def parseImpl( self, instring, loc, doActions=True ):
        if (instring[loc] == self.firstMatchChar and
            (self.matchLen==1 or instring.startswith(self.match,loc)) ):
            return loc+self.matchLen, self.match
        raise ParseException(instring, loc, self.errmsg, self)
_L = Literal
ParserElement._literalStringClass = Literal

class Keyword(Token):
    &quot;&quot;&quot;
    Token to exactly match a specified string as a keyword, that is, it must be
    immediately followed by a non-keyword character.  Compare with C{L{Literal}}:
     - C{Literal(&quot;if&quot;)} will match the leading C{&#039;if&#039;} in C{&#039;ifAndOnlyIf&#039;}.
     - C{Keyword(&quot;if&quot;)} will not; it will only match the leading C{&#039;if&#039;} in C{&#039;if x=1&#039;}, or C{&#039;if(y==2)&#039;}
    Accepts two optional constructor arguments in addition to the keyword string:
     - C{identChars} is a string of characters that would be valid identifier characters,
          defaulting to all alphanumerics + &quot;_&quot; and &quot;$&quot;
     - C{caseless} allows case-insensitive matching, default is C{False}.
       
    Example::
        Keyword(&quot;start&quot;).parseString(&quot;start&quot;)  # -&gt; [&#039;start&#039;]
        Keyword(&quot;start&quot;).parseString(&quot;starting&quot;)  # -&gt; Exception

    For case-insensitive matching, use L{CaselessKeyword}.
    &quot;&quot;&quot;
    DEFAULT_KEYWORD_CHARS = alphanums+&quot;_$&quot;

    def __init__( self, matchString, identChars=None, caseless=False ):
        super(Keyword,self).__init__()
        if identChars is None:
            identChars = Keyword.DEFAULT_KEYWORD_CHARS
        self.match = matchString
        self.matchLen = len(matchString)
        try:
            self.firstMatchChar = matchString[0]
        except IndexError:
            warnings.warn(&quot;null string passed to Keyword; use Empty() instead&quot;,
                            SyntaxWarning, stacklevel=2)
        self.name = &#039;&quot;%s&quot;&#039; % self.match
        self.errmsg = &quot;Expected &quot; + self.name
        self.mayReturnEmpty = False
        self.mayIndexError = False
        self.caseless = caseless
        if caseless:
            self.caselessmatch = matchString.upper()
            identChars = identChars.upper()
        self.identChars = set(identChars)

    def parseImpl( self, instring, loc, doActions=True ):
        if self.caseless:
            if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
                 (loc &gt;= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) and
                 (loc == 0 or instring[loc-1].upper() not in self.identChars) ):
                return loc+self.matchLen, self.match
        else:
            if (instring[loc] == self.firstMatchChar and
                (self.matchLen==1 or instring.startswith(self.match,loc)) and
                (loc &gt;= len(instring)-self.matchLen or instring[loc+self.matchLen] not in self.identChars) and
                (loc == 0 or instring[loc-1] not in self.identChars) ):
                return loc+self.matchLen, self.match
        raise ParseException(instring, loc, self.errmsg, self)

    def copy(self):
        c = super(Keyword,self).copy()
        c.identChars = Keyword.DEFAULT_KEYWORD_CHARS
        return c

    @staticmethod
    def setDefaultKeywordChars( chars ):
        &quot;&quot;&quot;Overrides the default Keyword chars
        &quot;&quot;&quot;
        Keyword.DEFAULT_KEYWORD_CHARS = chars

class CaselessLiteral(Literal):
    &quot;&quot;&quot;
    Token to match a specified string, ignoring case of letters.
    Note: the matched results will always be in the case of the given
    match string, NOT the case of the input text.

    Example::
        OneOrMore(CaselessLiteral(&quot;CMD&quot;)).parseString(&quot;cmd CMD Cmd10&quot;) # -&gt; [&#039;CMD&#039;, &#039;CMD&#039;, &#039;CMD&#039;]
        
    (Contrast with example for L{CaselessKeyword}.)
    &quot;&quot;&quot;
    def __init__( self, matchString ):
        super(CaselessLiteral,self).__init__( matchString.upper() )
        # Preserve the defining literal.
        self.returnString = matchString
        self.name = &quot;&#039;%s&#039;&quot; % self.returnString
        self.errmsg = &quot;Expected &quot; + self.name

    def parseImpl( self, instring, loc, doActions=True ):
        if instring[ loc:loc+self.matchLen ].upper() == self.match:
            return loc+self.matchLen, self.returnString
        raise ParseException(instring, loc, self.errmsg, self)

class CaselessKeyword(Keyword):
    &quot;&quot;&quot;
    Caseless version of L{Keyword}.

    Example::
        OneOrMore(CaselessKeyword(&quot;CMD&quot;)).parseString(&quot;cmd CMD Cmd10&quot;) # -&gt; [&#039;CMD&#039;, &#039;CMD&#039;]
        
    (Contrast with example for L{CaselessLiteral}.)
    &quot;&quot;&quot;
    def __init__( self, matchString, identChars=None ):
        super(CaselessKeyword,self).__init__( matchString, identChars, caseless=True )

    def parseImpl( self, instring, loc, doActions=True ):
        if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
             (loc &gt;= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) ):
            return loc+self.matchLen, self.match
        raise ParseException(instring, loc, self.errmsg, self)

class CloseMatch(Token):
    &quot;&quot;&quot;
    A variation on L{Literal} which matches &quot;close&quot; matches, that is, 
    strings with at most &#039;n&#039; mismatching characters. C{CloseMatch} takes parameters:
     - C{match_string} - string to be matched
     - C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
    
    The results from a successful parse will contain the matched text from the input string and the following named results:
     - C{mismatches} - a list of the positions within the match_string where mismatches were found
     - C{original} - the original match_string used to compare against the input string
    
    If C{mismatches} is an empty list, then the match was an exact match.
    
    Example::
        patt = CloseMatch(&quot;ATCATCGAATGGA&quot;)
        patt.parseString(&quot;ATCATCGAAXGGA&quot;) # -&gt; ([&#039;ATCATCGAAXGGA&#039;], {&#039;mismatches&#039;: [[9]], &#039;original&#039;: [&#039;ATCATCGAATGGA&#039;]})
        patt.parseString(&quot;ATCAXCGAAXGGA&quot;) # -&gt; Exception: Expected &#039;ATCATCGAATGGA&#039; (with up to 1 mismatches) (at char 0), (line:1, col:1)

        # exact match
        patt.parseString(&quot;ATCATCGAATGGA&quot;) # -&gt; ([&#039;ATCATCGAATGGA&#039;], {&#039;mismatches&#039;: [[]], &#039;original&#039;: [&#039;ATCATCGAATGGA&#039;]})

        # close match allowing up to 2 mismatches
        patt = CloseMatch(&quot;ATCATCGAATGGA&quot;, maxMismatches=2)
        patt.parseString(&quot;ATCAXCGAAXGGA&quot;) # -&gt; ([&#039;ATCAXCGAAXGGA&#039;], {&#039;mismatches&#039;: [[4, 9]], &#039;original&#039;: [&#039;ATCATCGAATGGA&#039;]})
    &quot;&quot;&quot;
    def __init__(self, match_string, maxMismatches=1):
        super(CloseMatch,self).__init__()
        self.name = match_string
        self.match_string = match_string
        self.maxMismatches = maxMismatches
        self.errmsg = &quot;Expected %r (with up to %d mismatches)&quot; % (self.match_string, self.maxMismatches)
        self.mayIndexError = False
        self.mayReturnEmpty = False

    def parseImpl( self, instring, loc, doActions=True ):
        start = loc
        instrlen = len(instring)
        maxloc = start + len(self.match_string)

        if maxloc &lt;= instrlen:
            match_string = self.match_string
            match_stringloc = 0
            mismatches = []
            maxMismatches = self.maxMismatches

            for match_stringloc,s_m in enumerate(zip(instring[loc:maxloc], self.match_string)):
                src,mat = s_m
                if src != mat:
                    mismatches.append(match_stringloc)
                    if len(mismatches) &gt; maxMismatches:
                        break
            else:
                loc = match_stringloc + 1
                results = ParseResults([instring[start:loc]])
                results[&#039;original&#039;] = self.match_string
                results[&#039;mismatches&#039;] = mismatches
                return loc, results

        raise ParseException(instring, loc, self.errmsg, self)


class Word(Token):
    &quot;&quot;&quot;
    Token for matching words composed of allowed character sets.
    Defined with string containing all allowed initial characters,
    an optional string containing allowed body characters (if omitted,
    defaults to the initial character set), and an optional minimum,
    maximum, and/or exact length.  The default value for C{min} is 1 (a
    minimum value &lt; 1 is not valid); the default values for C{max} and C{exact}
    are 0, meaning no maximum or exact length restriction. An optional
    C{excludeChars} parameter can list characters that might be found in 
    the input C{bodyChars} string; useful to define a word of all printables
    except for one or two characters, for instance.
    
    L{srange} is useful for defining custom character set strings for defining 
    C{Word} expressions, using range notation from regular expression character sets.
    
    A common mistake is to use C{Word} to match a specific literal string, as in 
    C{Word(&quot;Address&quot;)}. Remember that C{Word} uses the string argument to define
    I{sets} of matchable characters. This expression would match &quot;Add&quot;, &quot;AAA&quot;,
    &quot;dAred&quot;, or any other word made up of the characters &#039;A&#039;, &#039;d&#039;, &#039;r&#039;, &#039;e&#039;, and &#039;s&#039;.
    To match an exact literal string, use L{Literal} or L{Keyword}.

    pyparsing includes helper strings for building Words:
     - L{alphas}
     - L{nums}
     - L{alphanums}
     - L{hexnums}
     - L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
     - L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
     - L{printables} (any non-whitespace character)

    Example::
        # a word composed of digits
        integer = Word(nums) # equivalent to Word(&quot;0123456789&quot;) or Word(srange(&quot;0-9&quot;))
        
        # a word with a leading capital, and zero or more lowercase
        capital_word = Word(alphas.upper(), alphas.lower())

        # hostnames are alphanumeric, with leading alpha, and &#039;-&#039;
        hostname = Word(alphas, alphanums+&#039;-&#039;)
        
        # roman numeral (not a strict parser, accepts invalid mix of characters)
        roman = Word(&quot;IVXLCDM&quot;)
        
        # any string of non-whitespace characters, except for &#039;,&#039;
        csv_value = Word(printables, excludeChars=&quot;,&quot;)
    &quot;&quot;&quot;
    def __init__( self, initChars, bodyChars=None, min=1, max=0, exact=0, asKeyword=False, excludeChars=None ):
        super(Word,self).__init__()
        if excludeChars:
            initChars = &#039;&#039;.join(c for c in initChars if c not in excludeChars)
            if bodyChars:
                bodyChars = &#039;&#039;.join(c for c in bodyChars if c not in excludeChars)
        self.initCharsOrig = initChars
        self.initChars = set(initChars)
        if bodyChars :
            self.bodyCharsOrig = bodyChars
            self.bodyChars = set(bodyChars)
        else:
            self.bodyCharsOrig = initChars
            self.bodyChars = set(initChars)

        self.maxSpecified = max &gt; 0

        if min &lt; 1:
            raise ValueError(&quot;cannot specify a minimum length &lt; 1; use Optional(Word()) if zero-length word is permitted&quot;)

        self.minLen = min

        if max &gt; 0:
            self.maxLen = max
        else:
            self.maxLen = _MAX_INT

        if exact &gt; 0:
            self.maxLen = exact
            self.minLen = exact

        self.name = _ustr(self)
        self.errmsg = &quot;Expected &quot; + self.name
        self.mayIndexError = False
        self.asKeyword = asKeyword

        if &#039; &#039; not in self.initCharsOrig+self.bodyCharsOrig and (min==1 and max==0 and exact==0):
            if self.bodyCharsOrig == self.initCharsOrig:
                self.reString = &quot;[%s]+&quot; % _escapeRegexRangeChars(self.initCharsOrig)
            elif len(self.initCharsOrig) == 1:
                self.reString = &quot;%s[%s]*&quot; % \
                                      (re.escape(self.initCharsOrig),
                                      _escapeRegexRangeChars(self.bodyCharsOrig),)
            else:
                self.reString = &quot;[%s][%s]*&quot; % \
                                      (_escapeRegexRangeChars(self.initCharsOrig),
                                      _escapeRegexRangeChars(self.bodyCharsOrig),)
            if self.asKeyword:
                self.reString = r&quot;\b&quot;+self.reString+r&quot;\b&quot;
            try:
                self.re = re.compile( self.reString )
            except Exception:
                self.re = None

    def parseImpl( self, instring, loc, doActions=True ):
        if self.re:
            result = self.re.match(instring,loc)
            if not result:
                raise ParseException(instring, loc, self.errmsg, self)

            loc = result.end()
            return loc, result.group()

        if not(instring[ loc ] in self.initChars):
            raise ParseException(instring, loc, self.errmsg, self)

        start = loc
        loc += 1
        instrlen = len(instring)
        bodychars = self.bodyChars
        maxloc = start + self.maxLen
        maxloc = min( maxloc, instrlen )
        while loc &lt; maxloc and instring[loc] in bodychars:
            loc += 1

        throwException = False
        if loc - start &lt; self.minLen:
            throwException = True
        if self.maxSpecified and loc &lt; instrlen and instring[loc] in bodychars:
            throwException = True
        if self.asKeyword:
            if (start&gt;0 and instring[start-1] in bodychars) or (loc&lt;instrlen and instring[loc] in bodychars):
                throwException = True

        if throwException:
            raise ParseException(instring, loc, self.errmsg, self)

        return loc, instring[start:loc]

    def __str__( self ):
        try:
            return super(Word,self).__str__()
        except Exception:
            pass


        if self.strRepr is None:

            def charsAsStr(s):
                if len(s)&gt;4:
                    return s[:4]+&quot;...&quot;
                else:
                    return s

            if ( self.initCharsOrig != self.bodyCharsOrig ):
                self.strRepr = &quot;W:(%s,%s)&quot; % ( charsAsStr(self.initCharsOrig), charsAsStr(self.bodyCharsOrig) )
            else:
                self.strRepr = &quot;W:(%s)&quot; % charsAsStr(self.initCharsOrig)

        return self.strRepr


class Regex(Token):
    &quot;&quot;&quot;
    Token for matching strings that match a given regular expression.
    Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
    If the given regex contains named groups (defined using C{(?P&lt;name&gt;...)}), these will be preserved as 
    named parse results.

    Example::
        realnum = Regex(r&quot;[+-]?\d+\.\d*&quot;)
        date = Regex(r&#039;(?P&lt;year&gt;\d{4})-(?P&lt;month&gt;\d\d?)-(?P&lt;day&gt;\d\d?)&#039;)
        # ref: http://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
        roman = Regex(r&quot;M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})&quot;)
    &quot;&quot;&quot;
    compiledREtype = type(re.compile(&quot;[A-Z]&quot;))
    def __init__( self, pattern, flags=0):
        &quot;&quot;&quot;The parameters C{pattern} and C{flags} are passed to the C{re.compile()} function as-is. See the Python C{re} module for an explanation of the acceptable patterns and flags.&quot;&quot;&quot;
        super(Regex,self).__init__()

        if isinstance(pattern, basestring):
            if not pattern:
                warnings.warn(&quot;null string passed to Regex; use Empty() instead&quot;,
                        SyntaxWarning, stacklevel=2)

            self.pattern = pattern
            self.flags = flags

            try:
                self.re = re.compile(self.pattern, self.flags)
                self.reString = self.pattern
            except sre_constants.error:
                warnings.warn(&quot;invalid pattern (%s) passed to Regex&quot; % pattern,
                    SyntaxWarning, stacklevel=2)
                raise

        elif isinstance(pattern, Regex.compiledREtype):
            self.re = pattern
            self.pattern = \
            self.reString = str(pattern)
            self.flags = flags
            
        else:
            raise ValueError(&quot;Regex may only be constructed with a string or a compiled RE object&quot;)

        self.name = _ustr(self)
        self.errmsg = &quot;Expected &quot; + self.name
        self.mayIndexError = False
        self.mayReturnEmpty = True

    def parseImpl( self, instring, loc, doActions=True ):
        result = self.re.match(instring,loc)
        if not result:
            raise ParseException(instring, loc, self.errmsg, self)

        loc = result.end()
        d = result.groupdict()
        ret = ParseResults(result.group())
        if d:
            for k in d:
                ret[k] = d[k]
        return loc,ret

    def __str__( self ):
        try:
            return super(Regex,self).__str__()
        except Exception:
            pass

        if self.strRepr is None:
            self.strRepr = &quot;Re:(%s)&quot; % repr(self.pattern)

        return self.strRepr


class QuotedString(Token):
    r&quot;&quot;&quot;
    Token for matching strings that are delimited by quoting characters.
    
    Defined with the following parameters:
        - quoteChar - string of one or more characters defining the quote delimiting string
        - escChar - character to escape quotes, typically backslash (default=C{None})
        - escQuote - special quote sequence to escape an embedded quote string (such as SQL&#039;s &quot;&quot; to escape an embedded &quot;) (default=C{None})
        - multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
        - unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
        - endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} =&gt; same as quoteChar)
        - convertWhitespaceEscapes - convert escaped whitespace (C{&#039;\t&#039;}, C{&#039;\n&#039;}, etc.) to actual whitespace (default=C{True})

    Example::
        qs = QuotedString(&#039;&quot;&#039;)
        print(qs.searchString(&#039;lsjdf &quot;This is the quote&quot; sldjf&#039;))
        complex_qs = QuotedString(&#039;{{&#039;, endQuoteChar=&#039;}}&#039;)
        print(complex_qs.searchString(&#039;lsjdf {{This is the &quot;quote&quot;}} sldjf&#039;))
        sql_qs = QuotedString(&#039;&quot;&#039;, escQuote=&#039;&quot;&quot;&#039;)
        print(sql_qs.searchString(&#039;lsjdf &quot;This is the quote with &quot;&quot;embedded&quot;&quot; quotes&quot; sldjf&#039;))
    prints::
        [[&#039;This is the quote&#039;]]
        [[&#039;This is the &quot;quote&quot;&#039;]]
        [[&#039;This is the quote with &quot;embedded&quot; quotes&#039;]]
    &quot;&quot;&quot;
    def __init__( self, quoteChar, escChar=None, escQuote=None, multiline=False, unquoteResults=True, endQuoteChar=None, convertWhitespaceEscapes=True):
        super(QuotedString,self).__init__()

        # remove white space from quote chars - wont work anyway
        quoteChar = quoteChar.strip()
        if not quoteChar:
            warnings.warn(&quot;quoteChar cannot be the empty string&quot;,SyntaxWarning,stacklevel=2)
            raise SyntaxError()

        if endQuoteChar is None:
            endQuoteChar = quoteChar
        else:
            endQuoteChar = endQuoteChar.strip()
            if not endQuoteChar:
                warnings.warn(&quot;endQuoteChar cannot be the empty string&quot;,SyntaxWarning,stacklevel=2)
                raise SyntaxError()

        self.quoteChar = quoteChar
        self.quoteCharLen = len(quoteChar)
        self.firstQuoteChar = quoteChar[0]
        self.endQuoteChar = endQuoteChar
        self.endQuoteCharLen = len(endQuoteChar)
        self.escChar = escChar
        self.escQuote = escQuote
        self.unquoteResults = unquoteResults
        self.convertWhitespaceEscapes = convertWhitespaceEscapes

        if multiline:
            self.flags = re.MULTILINE | re.DOTALL
            self.pattern = r&#039;%s(?:[^%s%s]&#039; % \
                ( re.escape(self.quoteChar),
                  _escapeRegexRangeChars(self.endQuoteChar[0]),
                  (escChar is not None and _escapeRegexRangeChars(escChar) or &#039;&#039;) )
        else:
            self.flags = 0
            self.pattern = r&#039;%s(?:[^%s\n\r%s]&#039; % \
                ( re.escape(self.quoteChar),
                  _escapeRegexRangeChars(self.endQuoteChar[0]),
                  (escChar is not None and _escapeRegexRangeChars(escChar) or &#039;&#039;) )
        if len(self.endQuoteChar) &gt; 1:
            self.pattern += (
                &#039;|(?:&#039; + &#039;)|(?:&#039;.join(&quot;%s[^%s]&quot; % (re.escape(self.endQuoteChar[:i]),
                                               _escapeRegexRangeChars(self.endQuoteChar[i]))
                                    for i in range(len(self.endQuoteChar)-1,0,-1)) + &#039;)&#039;
                )
        if escQuote:
            self.pattern += (r&#039;|(?:%s)&#039; % re.escape(escQuote))
        if escChar:
            self.pattern += (r&#039;|(?:%s.)&#039; % re.escape(escChar))
            self.escCharReplacePattern = re.escape(self.escChar)+&quot;(.)&quot;
        self.pattern += (r&#039;)*%s&#039; % re.escape(self.endQuoteChar))

        try:
            self.re = re.compile(self.pattern, self.flags)
            self.reString = self.pattern
        except sre_constants.error:
            warnings.warn(&quot;invalid pattern (%s) passed to Regex&quot; % self.pattern,
                SyntaxWarning, stacklevel=2)
            raise

        self.name = _ustr(self)
        self.errmsg = &quot;Expected &quot; + self.name
        self.mayIndexError = False
        self.mayReturnEmpty = True

    def parseImpl( self, instring, loc, doActions=True ):
        result = instring[loc] == self.firstQuoteChar and self.re.match(instring,loc) or None
        if not result:
            raise ParseException(instring, loc, self.errmsg, self)

        loc = result.end()
        ret = result.group()

        if self.unquoteResults:

            # strip off quotes
            ret = ret[self.quoteCharLen:-self.endQuoteCharLen]

            if isinstance(ret,basestring):
                # replace escaped whitespace
                if &#039;\\&#039; in ret and self.convertWhitespaceEscapes:
                    ws_map = {
                        r&#039;\t&#039; : &#039;\t&#039;,
                        r&#039;\n&#039; : &#039;\n&#039;,
                        r&#039;\f&#039; : &#039;\f&#039;,
                        r&#039;\r&#039; : &#039;\r&#039;,
                    }
                    for wslit,wschar in ws_map.items():
                        ret = ret.replace(wslit, wschar)

                # replace escaped characters
                if self.escChar:
                    ret = re.sub(self.escCharReplacePattern,&quot;\g&lt;1&gt;&quot;,ret)

                # replace escaped quotes
                if self.escQuote:
                    ret = ret.replace(self.escQuote, self.endQuoteChar)

        return loc, ret

    def __str__( self ):
        try:
            return super(QuotedString,self).__str__()
        except Exception:
            pass

        if self.strRepr is None:
            self.strRepr = &quot;quoted string, starting with %s ending with %s&quot; % (self.quoteChar, self.endQuoteChar)

        return self.strRepr


class CharsNotIn(Token):
    &quot;&quot;&quot;
    Token for matching words composed of characters I{not} in a given set (will
    include whitespace in matched characters if not listed in the provided exclusion set - see example).
    Defined with string containing all disallowed characters, and an optional
    minimum, maximum, and/or exact length.  The default value for C{min} is 1 (a
    minimum value &lt; 1 is not valid); the default values for C{max} and C{exact}
    are 0, meaning no maximum or exact length restriction.

    Example::
        # define a comma-separated-value as anything that is not a &#039;,&#039;
        csv_value = CharsNotIn(&#039;,&#039;)
        print(delimitedList(csv_value).parseString(&quot;dkls,lsdkjf,s12 34,@!#,213&quot;))
    prints::
        [&#039;dkls&#039;, &#039;lsdkjf&#039;, &#039;s12 34&#039;, &#039;@!#&#039;, &#039;213&#039;]
    &quot;&quot;&quot;
    def __init__( self, notChars, min=1, max=0, exact=0 ):
        super(CharsNotIn,self).__init__()
        self.skipWhitespace = False
        self.notChars = notChars

        if min &lt; 1:
            raise ValueError(&quot;cannot specify a minimum length &lt; 1; use Optional(CharsNotIn()) if zero-length char group is permitted&quot;)

        self.minLen = min

        if max &gt; 0:
            self.maxLen = max
        else:
            self.maxLen = _MAX_INT

        if exact &gt; 0:
            self.maxLen = exact
            self.minLen = exact

        self.name = _ustr(self)
        self.errmsg = &quot;Expected &quot; + self.name
        self.mayReturnEmpty = ( self.minLen == 0 )
        self.mayIndexError = False

    def parseImpl( self, instring, loc, doActions=True ):
        if instring[loc] in self.notChars:
            raise ParseException(instring, loc, self.errmsg, self)

        start = loc
        loc += 1
        notchars = self.notChars
        maxlen = min( start+self.maxLen, len(instring) )
        while loc &lt; maxlen and \
              (instring[loc] not in notchars):
            loc += 1

        if loc - start &lt; self.minLen:
            raise ParseException(instring, loc, self.errmsg, self)

        return loc, instring[start:loc]

    def __str__( self ):
        try:
            return super(CharsNotIn, self).__str__()
        except Exception:
            pass

        if self.strRepr is None:
            if len(self.notChars) &gt; 4:
                self.strRepr = &quot;!W:(%s...)&quot; % self.notChars[:4]
            else:
                self.strRepr = &quot;!W:(%s)&quot; % self.notChars

        return self.strRepr

class White(Token):
    &quot;&quot;&quot;
    Special matching class for matching whitespace.  Normally, whitespace is ignored
    by pyparsing grammars.  This class is included when some whitespace structures
    are significant.  Define with a string containing the whitespace characters to be
    matched; default is C{&quot; \\t\\r\\n&quot;}.  Also takes optional C{min}, C{max}, and C{exact} arguments,
    as defined for the C{L{Word}} class.
    &quot;&quot;&quot;
    whiteStrs = {
        &quot; &quot; : &quot;&lt;SPC&gt;&quot;,
        &quot;\t&quot;: &quot;&lt;TAB&gt;&quot;,
        &quot;\n&quot;: &quot;&lt;LF&gt;&quot;,
        &quot;\r&quot;: &quot;&lt;CR&gt;&quot;,
        &quot;\f&quot;: &quot;&lt;FF&gt;&quot;,
        }
    def __init__(self, ws=&quot; \t\r\n&quot;, min=1, max=0, exact=0):
        super(White,self).__init__()
        self.matchWhite = ws
        self.setWhitespaceChars( &quot;&quot;.join(c for c in self.whiteChars if c not in self.matchWhite) )
        #~ self.leaveWhitespace()
        self.name = (&quot;&quot;.join(White.whiteStrs[c] for c in self.matchWhite))
        self.mayReturnEmpty = True
        self.errmsg = &quot;Expected &quot; + self.name

        self.minLen = min

        if max &gt; 0:
            self.maxLen = max
        else:
            self.maxLen = _MAX_INT

        if exact &gt; 0:
            self.maxLen = exact
            self.minLen = exact

    def parseImpl( self, instring, loc, doActions=True ):
        if not(instring[ loc ] in self.matchWhite):
            raise ParseException(instring, loc, self.errmsg, self)
        start = loc
        loc += 1
        maxloc = start + self.maxLen
        maxloc = min( maxloc, len(instring) )
        while loc &lt; maxloc and instring[loc] in self.matchWhite:
            loc += 1

        if loc - start &lt; self.minLen:
            raise ParseException(instring, loc, self.errmsg, self)

        return loc, instring[start:loc]


class _PositionToken(Token):
    def __init__( self ):
        super(_PositionToken,self).__init__()
        self.name=self.__class__.__name__
        self.mayReturnEmpty = True
        self.mayIndexError = False

class GoToColumn(_PositionToken):
    &quot;&quot;&quot;
    Token to advance to a specific column of input text; useful for tabular report scraping.
    &quot;&quot;&quot;
    def __init__( self, colno ):
        super(GoToColumn,self).__init__()
        self.col = colno

    def preParse( self, instring, loc ):
        if col(loc,instring) != self.col:
            instrlen = len(instring)
            if self.ignoreExprs:
                loc = self._skipIgnorables( instring, loc )
            while loc &lt; instrlen and instring[loc].isspace() and col( loc, instring ) != self.col :
                loc += 1
        return loc

    def parseImpl( self, instring, loc, doActions=True ):
        thiscol = col( loc, instring )
        if thiscol &gt; self.col:
            raise ParseException( instring, loc, &quot;Text not in expected column&quot;, self )
        newloc = loc + self.col - thiscol
        ret = instring[ loc: newloc ]
        return newloc, ret


class LineStart(_PositionToken):
    &quot;&quot;&quot;
    Matches if current position is at the beginning of a line within the parse string
    
    Example::
    
        test = &#039;&#039;&#039;\
        AAA this line
        AAA and this line
          AAA but not this one
        B AAA and definitely not this one
        &#039;&#039;&#039;

        for t in (LineStart() + &#039;AAA&#039; + restOfLine).searchString(test):
            print(t)
    
    Prints::
        [&#039;AAA&#039;, &#039; this line&#039;]
        [&#039;AAA&#039;, &#039; and this line&#039;]    

    &quot;&quot;&quot;
    def __init__( self ):
        super(LineStart,self).__init__()
        self.errmsg = &quot;Expected start of line&quot;

    def parseImpl( self, instring, loc, doActions=True ):
        if col(loc, instring) == 1:
            return loc, []
        raise ParseException(instring, loc, self.errmsg, self)

class LineEnd(_PositionToken):
    &quot;&quot;&quot;
    Matches if current position is at the end of a line within the parse string
    &quot;&quot;&quot;
    def __init__( self ):
        super(LineEnd,self).__init__()
        self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace(&quot;\n&quot;,&quot;&quot;) )
        self.errmsg = &quot;Expected end of line&quot;

    def parseImpl( self, instring, loc, doActions=True ):
        if loc&lt;len(instring):
            if instring[loc] == &quot;\n&quot;:
                return loc+1, &quot;\n&quot;
            else:
                raise ParseException(instring, loc, self.errmsg, self)
        elif loc == len(instring):
            return loc+1, []
        else:
            raise ParseException(instring, loc, self.errmsg, self)

class StringStart(_PositionToken):
    &quot;&quot;&quot;
    Matches if current position is at the beginning of the parse string
    &quot;&quot;&quot;
    def __init__( self ):
        super(StringStart,self).__init__()
        self.errmsg = &quot;Expected start of text&quot;

    def parseImpl( self, instring, loc, doActions=True ):
        if loc != 0:
            # see if entire string up to here is just whitespace and ignoreables
            if loc != self.preParse( instring, 0 ):
                raise ParseException(instring, loc, self.errmsg, self)
        return loc, []

class StringEnd(_PositionToken):
    &quot;&quot;&quot;
    Matches if current position is at the end of the parse string
    &quot;&quot;&quot;
    def __init__( self ):
        super(StringEnd,self).__init__()
        self.errmsg = &quot;Expected end of text&quot;

    def parseImpl( self, instring, loc, doActions=True ):
        if loc &lt; len(instring):
            raise ParseException(instring, loc, self.errmsg, self)
        elif loc == len(instring):
            return loc+1, []
        elif loc &gt; len(instring):
            return loc, []
        else:
            raise ParseException(instring, loc, self.errmsg, self)

class WordStart(_PositionToken):
    &quot;&quot;&quot;
    Matches if the current position is at the beginning of a Word, and
    is not preceded by any character in a given set of C{wordChars}
    (default=C{printables}). To emulate the C{\b} behavior of regular expressions,
    use C{WordStart(alphanums)}. C{WordStart} will also match at the beginning of
    the string being parsed, or at the beginning of a line.
    &quot;&quot;&quot;
    def __init__(self, wordChars = printables):
        super(WordStart,self).__init__()
        self.wordChars = set(wordChars)
        self.errmsg = &quot;Not at the start of a word&quot;

    def parseImpl(self, instring, loc, doActions=True ):
        if loc != 0:
            if (instring[loc-1] in self.wordChars or
                instring[loc] not in self.wordChars):
                raise ParseException(instring, loc, self.errmsg, self)
        return loc, []

class WordEnd(_PositionToken):
    &quot;&quot;&quot;
    Matches if the current position is at the end of a Word, and
    is not followed by any character in a given set of C{wordChars}
    (default=C{printables}). To emulate the C{\b} behavior of regular expressions,
    use C{WordEnd(alphanums)}. C{WordEnd} will also match at the end of
    the string being parsed, or at the end of a line.
    &quot;&quot;&quot;
    def __init__(self, wordChars = printables):
        super(WordEnd,self).__init__()
        self.wordChars = set(wordChars)
        self.skipWhitespace = False
        self.errmsg = &quot;Not at the end of a word&quot;

    def parseImpl(self, instring, loc, doActions=True ):
        instrlen = len(instring)
        if instrlen&gt;0 and loc&lt;instrlen:
            if (instring[loc] in self.wordChars or
                instring[loc-1] not in self.wordChars):
                raise ParseException(instring, loc, self.errmsg, self)
        return loc, []


class ParseExpression(ParserElement):
    &quot;&quot;&quot;
    Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
    &quot;&quot;&quot;
    def __init__( self, exprs, savelist = False ):
        super(ParseExpression,self).__init__(savelist)
        if isinstance( exprs, _generatorType ):
            exprs = list(exprs)

        if isinstance( exprs, basestring ):
            self.exprs = [ ParserElement._literalStringClass( exprs ) ]
        elif isinstance( exprs, collections.Iterable ):
            exprs = list(exprs)
            # if sequence of strings provided, wrap with Literal
            if all(isinstance(expr, basestring) for expr in exprs):
                exprs = map(ParserElement._literalStringClass, exprs)
            self.exprs = list(exprs)
        else:
            try:
                self.exprs = list( exprs )
            except TypeError:
                self.exprs = [ exprs ]
        self.callPreparse = False

    def __getitem__( self, i ):
        return self.exprs[i]

    def append( self, other ):
        self.exprs.append( other )
        self.strRepr = None
        return self

    def leaveWhitespace( self ):
        &quot;&quot;&quot;Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
           all contained expressions.&quot;&quot;&quot;
        self.skipWhitespace = False
        self.exprs = [ e.copy() for e in self.exprs ]
        for e in self.exprs:
            e.leaveWhitespace()
        return self

    def ignore( self, other ):
        if isinstance( other, Suppress ):
            if other not in self.ignoreExprs:
                super( ParseExpression, self).ignore( other )
                for e in self.exprs:
                    e.ignore( self.ignoreExprs[-1] )
        else:
            super( ParseExpression, self).ignore( other )
            for e in self.exprs:
                e.ignore( self.ignoreExprs[-1] )
        return self

    def __str__( self ):
        try:
            return super(ParseExpression,self).__str__()
        except Exception:
            pass

        if self.strRepr is None:
            self.strRepr = &quot;%s:(%s)&quot; % ( self.__class__.__name__, _ustr(self.exprs) )
        return self.strRepr

    def streamline( self ):
        super(ParseExpression,self).streamline()

        for e in self.exprs:
            e.streamline()

        # collapse nested And&#039;s of the form And( And( And( a,b), c), d) to And( a,b,c,d )
        # but only if there are no parse actions or resultsNames on the nested And&#039;s
        # (likewise for Or&#039;s and MatchFirst&#039;s)
        if ( len(self.exprs) == 2 ):
            other = self.exprs[0]
            if ( isinstance( other, self.__class__ ) and
                  not(other.parseAction) and
                  other.resultsName is None and
                  not other.debug ):
                self.exprs = other.exprs[:] + [ self.exprs[1] ]
                self.strRepr = None
                self.mayReturnEmpty |= other.mayReturnEmpty
                self.mayIndexError  |= other.mayIndexError

            other = self.exprs[-1]
            if ( isinstance( other, self.__class__ ) and
                  not(other.parseAction) and
                  other.resultsName is None and
                  not other.debug ):
                self.exprs = self.exprs[:-1] + other.exprs[:]
                self.strRepr = None
                self.mayReturnEmpty |= other.mayReturnEmpty
                self.mayIndexError  |= other.mayIndexError

        self.errmsg = &quot;Expected &quot; + _ustr(self)
        
        return self

    def setResultsName( self, name, listAllMatches=False ):
        ret = super(ParseExpression,self).setResultsName(name,listAllMatches)
        return ret

    def validate( self, validateTrace=[] ):
        tmp = validateTrace[:]+[self]
        for e in self.exprs:
            e.validate(tmp)
        self.checkRecursion( [] )
        
    def copy(self):
        ret = super(ParseExpression,self).copy()
        ret.exprs = [e.copy() for e in self.exprs]
        return ret

class And(ParseExpression):
    &quot;&quot;&quot;
    Requires all given C{ParseExpression}s to be found in the given order.
    Expressions may be separated by whitespace.
    May be constructed using the C{&#039;+&#039;} operator.
    May also be constructed using the C{&#039;-&#039;} operator, which will suppress backtracking.

    Example::
        integer = Word(nums)
        name_expr = OneOrMore(Word(alphas))

        expr = And([integer(&quot;id&quot;),name_expr(&quot;name&quot;),integer(&quot;age&quot;)])
        # more easily written as:
        expr = integer(&quot;id&quot;) + name_expr(&quot;name&quot;) + integer(&quot;age&quot;)
    &quot;&quot;&quot;

    class _ErrorStop(Empty):
        def __init__(self, *args, **kwargs):
            super(And._ErrorStop,self).__init__(*args, **kwargs)
            self.name = &#039;-&#039;
            self.leaveWhitespace()

    def __init__( self, exprs, savelist = True ):
        super(And,self).__init__(exprs, savelist)
        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
        self.setWhitespaceChars( self.exprs[0].whiteChars )
        self.skipWhitespace = self.exprs[0].skipWhitespace
        self.callPreparse = True

    def parseImpl( self, instring, loc, doActions=True ):
        # pass False as last arg to _parse for first element, since we already
        # pre-parsed the string as part of our And pre-parsing
        loc, resultlist = self.exprs[0]._parse( instring, loc, doActions, callPreParse=False )
        errorStop = False
        for e in self.exprs[1:]:
            if isinstance(e, And._ErrorStop):
                errorStop = True
                continue
            if errorStop:
                try:
                    loc, exprtokens = e._parse( instring, loc, doActions )
                except ParseSyntaxException:
                    raise
                except ParseBaseException as pe:
                    pe.__traceback__ = None
                    raise ParseSyntaxException._from_exception(pe)
                except IndexError:
                    raise ParseSyntaxException(instring, len(instring), self.errmsg, self)
            else:
                loc, exprtokens = e._parse( instring, loc, doActions )
            if exprtokens or exprtokens.haskeys():
                resultlist += exprtokens
        return loc, resultlist

    def __iadd__(self, other ):
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        return self.append( other ) #And( [ self, other ] )

    def checkRecursion( self, parseElementList ):
        subRecCheckList = parseElementList[:] + [ self ]
        for e in self.exprs:
            e.checkRecursion( subRecCheckList )
            if not e.mayReturnEmpty:
                break

    def __str__( self ):
        if hasattr(self,&quot;name&quot;):
            return self.name

        if self.strRepr is None:
            self.strRepr = &quot;{&quot; + &quot; &quot;.join(_ustr(e) for e in self.exprs) + &quot;}&quot;

        return self.strRepr


class Or(ParseExpression):
    &quot;&quot;&quot;
    Requires that at least one C{ParseExpression} is found.
    If two expressions match, the expression that matches the longest string will be used.
    May be constructed using the C{&#039;^&#039;} operator.

    Example::
        # construct Or using &#039;^&#039; operator
        
        number = Word(nums) ^ Combine(Word(nums) + &#039;.&#039; + Word(nums))
        print(number.searchString(&quot;123 3.1416 789&quot;))
    prints::
        [[&#039;123&#039;], [&#039;3.1416&#039;], [&#039;789&#039;]]
    &quot;&quot;&quot;
    def __init__( self, exprs, savelist = False ):
        super(Or,self).__init__(exprs, savelist)
        if self.exprs:
            self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
        else:
            self.mayReturnEmpty = True

    def parseImpl( self, instring, loc, doActions=True ):
        maxExcLoc = -1
        maxException = None
        matches = []
        for e in self.exprs:
            try:
                loc2 = e.tryParse( instring, loc )
            except ParseException as err:
                err.__traceback__ = None
                if err.loc &gt; maxExcLoc:
                    maxException = err
                    maxExcLoc = err.loc
            except IndexError:
                if len(instring) &gt; maxExcLoc:
                    maxException = ParseException(instring,len(instring),e.errmsg,self)
                    maxExcLoc = len(instring)
            else:
                # save match among all matches, to retry longest to shortest
                matches.append((loc2, e))

        if matches:
            matches.sort(key=lambda x: -x[0])
            for _,e in matches:
                try:
                    return e._parse( instring, loc, doActions )
                except ParseException as err:
                    err.__traceback__ = None
                    if err.loc &gt; maxExcLoc:
                        maxException = err
                        maxExcLoc = err.loc

        if maxException is not None:
            maxException.msg = self.errmsg
            raise maxException
        else:
            raise ParseException(instring, loc, &quot;no defined alternatives to match&quot;, self)


    def __ixor__(self, other ):
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        return self.append( other ) #Or( [ self, other ] )

    def __str__( self ):
        if hasattr(self,&quot;name&quot;):
            return self.name

        if self.strRepr is None:
            self.strRepr = &quot;{&quot; + &quot; ^ &quot;.join(_ustr(e) for e in self.exprs) + &quot;}&quot;

        return self.strRepr

    def checkRecursion( self, parseElementList ):
        subRecCheckList = parseElementList[:] + [ self ]
        for e in self.exprs:
            e.checkRecursion( subRecCheckList )


class MatchFirst(ParseExpression):
    &quot;&quot;&quot;
    Requires that at least one C{ParseExpression} is found.
    If two expressions match, the first one listed is the one that will match.
    May be constructed using the C{&#039;|&#039;} operator.

    Example::
        # construct MatchFirst using &#039;|&#039; operator
        
        # watch the order of expressions to match
        number = Word(nums) | Combine(Word(nums) + &#039;.&#039; + Word(nums))
        print(number.searchString(&quot;123 3.1416 789&quot;)) #  Fail! -&gt; [[&#039;123&#039;], [&#039;3&#039;], [&#039;1416&#039;], [&#039;789&#039;]]

        # put more selective expression first
        number = Combine(Word(nums) + &#039;.&#039; + Word(nums)) | Word(nums)
        print(number.searchString(&quot;123 3.1416 789&quot;)) #  Better -&gt; [[&#039;123&#039;], [&#039;3.1416&#039;], [&#039;789&#039;]]
    &quot;&quot;&quot;
    def __init__( self, exprs, savelist = False ):
        super(MatchFirst,self).__init__(exprs, savelist)
        if self.exprs:
            self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
        else:
            self.mayReturnEmpty = True

    def parseImpl( self, instring, loc, doActions=True ):
        maxExcLoc = -1
        maxException = None
        for e in self.exprs:
            try:
                ret = e._parse( instring, loc, doActions )
                return ret
            except ParseException as err:
                if err.loc &gt; maxExcLoc:
                    maxException = err
                    maxExcLoc = err.loc
            except IndexError:
                if len(instring) &gt; maxExcLoc:
                    maxException = ParseException(instring,len(instring),e.errmsg,self)
                    maxExcLoc = len(instring)

        # only got here if no expression matched, raise exception for match that made it the furthest
        else:
            if maxException is not None:
                maxException.msg = self.errmsg
                raise maxException
            else:
                raise ParseException(instring, loc, &quot;no defined alternatives to match&quot;, self)

    def __ior__(self, other ):
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass( other )
        return self.append( other ) #MatchFirst( [ self, other ] )

    def __str__( self ):
        if hasattr(self,&quot;name&quot;):
            return self.name

        if self.strRepr is None:
            self.strRepr = &quot;{&quot; + &quot; | &quot;.join(_ustr(e) for e in self.exprs) + &quot;}&quot;

        return self.strRepr

    def checkRecursion( self, parseElementList ):
        subRecCheckList = parseElementList[:] + [ self ]
        for e in self.exprs:
            e.checkRecursion( subRecCheckList )


class Each(ParseExpression):
    &quot;&quot;&quot;
    Requires all given C{ParseExpression}s to be found, but in any order.
    Expressions may be separated by whitespace.
    May be constructed using the C{&#039;&amp;&#039;} operator.

    Example::
        color = oneOf(&quot;RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN&quot;)
        shape_type = oneOf(&quot;SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON&quot;)
        integer = Word(nums)
        shape_attr = &quot;shape:&quot; + shape_type(&quot;shape&quot;)
        posn_attr = &quot;posn:&quot; + Group(integer(&quot;x&quot;) + &#039;,&#039; + integer(&quot;y&quot;))(&quot;posn&quot;)
        color_attr = &quot;color:&quot; + color(&quot;color&quot;)
        size_attr = &quot;size:&quot; + integer(&quot;size&quot;)

        # use Each (using operator &#039;&amp;&#039;) to accept attributes in any order 
        # (shape and posn are required, color and size are optional)
        shape_spec = shape_attr &amp; posn_attr &amp; Optional(color_attr) &amp; Optional(size_attr)

        shape_spec.runTests(&#039;&#039;&#039;
            shape: SQUARE color: BLACK posn: 100, 120
            shape: CIRCLE size: 50 color: BLUE posn: 50,80
            color:GREEN size:20 shape:TRIANGLE posn:20,40
            &#039;&#039;&#039;
            )
    prints::
        shape: SQUARE color: BLACK posn: 100, 120
        [&#039;shape:&#039;, &#039;SQUARE&#039;, &#039;color:&#039;, &#039;BLACK&#039;, &#039;posn:&#039;, [&#039;100&#039;, &#039;,&#039;, &#039;120&#039;]]
        - color: BLACK
        - posn: [&#039;100&#039;, &#039;,&#039;, &#039;120&#039;]
          - x: 100
          - y: 120
        - shape: SQUARE


        shape: CIRCLE size: 50 color: BLUE posn: 50,80
        [&#039;shape:&#039;, &#039;CIRCLE&#039;, &#039;size:&#039;, &#039;50&#039;, &#039;color:&#039;, &#039;BLUE&#039;, &#039;posn:&#039;, [&#039;50&#039;, &#039;,&#039;, &#039;80&#039;]]
        - color: BLUE
        - posn: [&#039;50&#039;, &#039;,&#039;, &#039;80&#039;]
          - x: 50
          - y: 80
        - shape: CIRCLE
        - size: 50


        color: GREEN size: 20 shape: TRIANGLE posn: 20,40
        [&#039;color:&#039;, &#039;GREEN&#039;, &#039;size:&#039;, &#039;20&#039;, &#039;shape:&#039;, &#039;TRIANGLE&#039;, &#039;posn:&#039;, [&#039;20&#039;, &#039;,&#039;, &#039;40&#039;]]
        - color: GREEN
        - posn: [&#039;20&#039;, &#039;,&#039;, &#039;40&#039;]
          - x: 20
          - y: 40
        - shape: TRIANGLE
        - size: 20
    &quot;&quot;&quot;
    def __init__( self, exprs, savelist = True ):
        super(Each,self).__init__(exprs, savelist)
        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
        self.skipWhitespace = True
        self.initExprGroups = True

    def parseImpl( self, instring, loc, doActions=True ):
        if self.initExprGroups:
            self.opt1map = dict((id(e.expr),e) for e in self.exprs if isinstance(e,Optional))
            opt1 = [ e.expr for e in self.exprs if isinstance(e,Optional) ]
            opt2 = [ e for e in self.exprs if e.mayReturnEmpty and not isinstance(e,Optional)]
            self.optionals = opt1 + opt2
            self.multioptionals = [ e.expr for e in self.exprs if isinstance(e,ZeroOrMore) ]
            self.multirequired = [ e.expr for e in self.exprs if isinstance(e,OneOrMore) ]
            self.required = [ e for e in self.exprs if not isinstance(e,(Optional,ZeroOrMore,OneOrMore)) ]
            self.required += self.multirequired
            self.initExprGroups = False
        tmpLoc = loc
        tmpReqd = self.required[:]
        tmpOpt  = self.optionals[:]
        matchOrder = []

        keepMatching = True
        while keepMatching:
            tmpExprs = tmpReqd + tmpOpt + self.multioptionals + self.multirequired
            failed = []
            for e in tmpExprs:
                try:
                    tmpLoc = e.tryParse( instring, tmpLoc )
                except ParseException:
                    failed.append(e)
                else:
                    matchOrder.append(self.opt1map.get(id(e),e))
                    if e in tmpReqd:
                        tmpReqd.remove(e)
                    elif e in tmpOpt:
                        tmpOpt.remove(e)
            if len(failed) == len(tmpExprs):
                keepMatching = False

        if tmpReqd:
            missing = &quot;, &quot;.join(_ustr(e) for e in tmpReqd)
            raise ParseException(instring,loc,&quot;Missing one or more required elements (%s)&quot; % missing )

        # add any unmatched Optionals, in case they have default values defined
        matchOrder += [e for e in self.exprs if isinstance(e,Optional) and e.expr in tmpOpt]

        resultlist = []
        for e in matchOrder:
            loc,results = e._parse(instring,loc,doActions)
            resultlist.append(results)

        finalResults = sum(resultlist, ParseResults([]))
        return loc, finalResults

    def __str__( self ):
        if hasattr(self,&quot;name&quot;):
            return self.name

        if self.strRepr is None:
            self.strRepr = &quot;{&quot; + &quot; &amp; &quot;.join(_ustr(e) for e in self.exprs) + &quot;}&quot;

        return self.strRepr

    def checkRecursion( self, parseElementList ):
        subRecCheckList = parseElementList[:] + [ self ]
        for e in self.exprs:
            e.checkRecursion( subRecCheckList )


class ParseElementEnhance(ParserElement):
    &quot;&quot;&quot;
    Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
    &quot;&quot;&quot;
    def __init__( self, expr, savelist=False ):
        super(ParseElementEnhance,self).__init__(savelist)
        if isinstance( expr, basestring ):
            if issubclass(ParserElement._literalStringClass, Token):
                expr = ParserElement._literalStringClass(expr)
            else:
                expr = ParserElement._literalStringClass(Literal(expr))
        self.expr = expr
        self.strRepr = None
        if expr is not None:
            self.mayIndexError = expr.mayIndexError
            self.mayReturnEmpty = expr.mayReturnEmpty
            self.setWhitespaceChars( expr.whiteChars )
            self.skipWhitespace = expr.skipWhitespace
            self.saveAsList = expr.saveAsList
            self.callPreparse = expr.callPreparse
            self.ignoreExprs.extend(expr.ignoreExprs)

    def parseImpl( self, instring, loc, doActions=True ):
        if self.expr is not None:
            return self.expr._parse( instring, loc, doActions, callPreParse=False )
        else:
            raise ParseException(&quot;&quot;,loc,self.errmsg,self)

    def leaveWhitespace( self ):
        self.skipWhitespace = False
        self.expr = self.expr.copy()
        if self.expr is not None:
            self.expr.leaveWhitespace()
        return self

    def ignore( self, other ):
        if isinstance( other, Suppress ):
            if other not in self.ignoreExprs:
                super( ParseElementEnhance, self).ignore( other )
                if self.expr is not None:
                    self.expr.ignore( self.ignoreExprs[-1] )
        else:
            super( ParseElementEnhance, self).ignore( other )
            if self.expr is not None:
                self.expr.ignore( self.ignoreExprs[-1] )
        return self

    def streamline( self ):
        super(ParseElementEnhance,self).streamline()
        if self.expr is not None:
            self.expr.streamline()
        return self

    def checkRecursion( self, parseElementList ):
        if self in parseElementList:
            raise RecursiveGrammarException( parseElementList+[self] )
        subRecCheckList = parseElementList[:] + [ self ]
        if self.expr is not None:
            self.expr.checkRecursion( subRecCheckList )

    def validate( self, validateTrace=[] ):
        tmp = validateTrace[:]+[self]
        if self.expr is not None:
            self.expr.validate(tmp)
        self.checkRecursion( [] )

    def __str__( self ):
        try:
            return super(ParseElementEnhance,self).__str__()
        except Exception:
            pass

        if self.strRepr is None and self.expr is not None:
            self.strRepr = &quot;%s:(%s)&quot; % ( self.__class__.__name__, _ustr(self.expr) )
        return self.strRepr


class FollowedBy(ParseElementEnhance):
    &quot;&quot;&quot;
    Lookahead matching of the given parse expression.  C{FollowedBy}
    does I{not} advance the parsing position within the input string, it only
    verifies that the specified parse expression matches at the current
    position.  C{FollowedBy} always returns a null token list.

    Example::
        # use FollowedBy to match a label only if it is followed by a &#039;:&#039;
        data_word = Word(alphas)
        label = data_word + FollowedBy(&#039;:&#039;)
        attr_expr = Group(label + Suppress(&#039;:&#039;) + OneOrMore(data_word, stopOn=label).setParseAction(&#039; &#039;.join))
        
        OneOrMore(attr_expr).parseString(&quot;shape: SQUARE color: BLACK posn: upper left&quot;).pprint()
    prints::
        [[&#039;shape&#039;, &#039;SQUARE&#039;], [&#039;color&#039;, &#039;BLACK&#039;], [&#039;posn&#039;, &#039;upper left&#039;]]
    &quot;&quot;&quot;
    def __init__( self, expr ):
        super(FollowedBy,self).__init__(expr)
        self.mayReturnEmpty = True

    def parseImpl( self, instring, loc, doActions=True ):
        self.expr.tryParse( instring, loc )
        return loc, []


class NotAny(ParseElementEnhance):
    &quot;&quot;&quot;
    Lookahead to disallow matching with the given parse expression.  C{NotAny}
    does I{not} advance the parsing position within the input string, it only
    verifies that the specified parse expression does I{not} match at the current
    position.  Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
    always returns a null token list.  May be constructed using the &#039;~&#039; operator.

    Example::
        
    &quot;&quot;&quot;
    def __init__( self, expr ):
        super(NotAny,self).__init__(expr)
        #~ self.leaveWhitespace()
        self.skipWhitespace = False  # do NOT use self.leaveWhitespace(), don&#039;t want to propagate to exprs
        self.mayReturnEmpty = True
        self.errmsg = &quot;Found unwanted token, &quot;+_ustr(self.expr)

    def parseImpl( self, instring, loc, doActions=True ):
        if self.expr.canParseNext(instring, loc):
            raise ParseException(instring, loc, self.errmsg, self)
        return loc, []

    def __str__( self ):
        if hasattr(self,&quot;name&quot;):
            return self.name

        if self.strRepr is None:
            self.strRepr = &quot;~{&quot; + _ustr(self.expr) + &quot;}&quot;

        return self.strRepr

class _MultipleMatch(ParseElementEnhance):
    def __init__( self, expr, stopOn=None):
        super(_MultipleMatch, self).__init__(expr)
        self.saveAsList = True
        ender = stopOn
        if isinstance(ender, basestring):
            ender = ParserElement._literalStringClass(ender)
        self.not_ender = ~ender if ender is not None else None

    def parseImpl( self, instring, loc, doActions=True ):
        self_expr_parse = self.expr._parse
        self_skip_ignorables = self._skipIgnorables
        check_ender = self.not_ender is not None
        if check_ender:
            try_not_ender = self.not_ender.tryParse
        
        # must be at least one (but first see if we are the stopOn sentinel;
        # if so, fail)
        if check_ender:
            try_not_ender(instring, loc)
        loc, tokens = self_expr_parse( instring, loc, doActions, callPreParse=False )
        try:
            hasIgnoreExprs = (not not self.ignoreExprs)
            while 1:
                if check_ender:
                    try_not_ender(instring, loc)
                if hasIgnoreExprs:
                    preloc = self_skip_ignorables( instring, loc )
                else:
                    preloc = loc
                loc, tmptokens = self_expr_parse( instring, preloc, doActions )
                if tmptokens or tmptokens.haskeys():
                    tokens += tmptokens
        except (ParseException,IndexError):
            pass

        return loc, tokens
        
class OneOrMore(_MultipleMatch):
    &quot;&quot;&quot;
    Repetition of one or more of the given expression.
    
    Parameters:
     - expr - expression that must match one or more times
     - stopOn - (default=C{None}) - expression for a terminating sentinel
          (only required if the sentinel would ordinarily match the repetition 
          expression)          

    Example::
        data_word = Word(alphas)
        label = data_word + FollowedBy(&#039;:&#039;)
        attr_expr = Group(label + Suppress(&#039;:&#039;) + OneOrMore(data_word).setParseAction(&#039; &#039;.join))

        text = &quot;shape: SQUARE posn: upper left color: BLACK&quot;
        OneOrMore(attr_expr).parseString(text).pprint()  # Fail! read &#039;color&#039; as data instead of next label -&gt; [[&#039;shape&#039;, &#039;SQUARE color&#039;]]

        # use stopOn attribute for OneOrMore to avoid reading label string as part of the data
        attr_expr = Group(label + Suppress(&#039;:&#039;) + OneOrMore(data_word, stopOn=label).setParseAction(&#039; &#039;.join))
        OneOrMore(attr_expr).parseString(text).pprint() # Better -&gt; [[&#039;shape&#039;, &#039;SQUARE&#039;], [&#039;posn&#039;, &#039;upper left&#039;], [&#039;color&#039;, &#039;BLACK&#039;]]
        
        # could also be written as
        (attr_expr * (1,)).parseString(text).pprint()
    &quot;&quot;&quot;

    def __str__( self ):
        if hasattr(self,&quot;name&quot;):
            return self.name

        if self.strRepr is None:
            self.strRepr = &quot;{&quot; + _ustr(self.expr) + &quot;}...&quot;

        return self.strRepr

class ZeroOrMore(_MultipleMatch):
    &quot;&quot;&quot;
    Optional repetition of zero or more of the given expression.
    
    Parameters:
     - expr - expression that must match zero or more times
     - stopOn - (default=C{None}) - expression for a terminating sentinel
          (only required if the sentinel would ordinarily match the repetition 
          expression)          

    Example: similar to L{OneOrMore}
    &quot;&quot;&quot;
    def __init__( self, expr, stopOn=None):
        super(ZeroOrMore,self).__init__(expr, stopOn=stopOn)
        self.mayReturnEmpty = True
        
    def parseImpl( self, instring, loc, doActions=True ):
        try:
            return super(ZeroOrMore, self).parseImpl(instring, loc, doActions)
        except (ParseException,IndexError):
            return loc, []

    def __str__( self ):
        if hasattr(self,&quot;name&quot;):
            return self.name

        if self.strRepr is None:
            self.strRepr = &quot;[&quot; + _ustr(self.expr) + &quot;]...&quot;

        return self.strRepr

class _NullToken(object):
    def __bool__(self):
        return False
    __nonzero__ = __bool__
    def __str__(self):
        return &quot;&quot;

_optionalNotMatched = _NullToken()
class Optional(ParseElementEnhance):
    &quot;&quot;&quot;
    Optional matching of the given expression.

    Parameters:
     - expr - expression that must match zero or more times
     - default (optional) - value to be returned if the optional expression is not found.

    Example::
        # US postal code can be a 5-digit zip, plus optional 4-digit qualifier
        zip = Combine(Word(nums, exact=5) + Optional(&#039;-&#039; + Word(nums, exact=4)))
        zip.runTests(&#039;&#039;&#039;
            # traditional ZIP code
            12345
            
            # ZIP+4 form
            12101-0001
            
            # invalid ZIP
            98765-
            &#039;&#039;&#039;)
    prints::
        # traditional ZIP code
        12345
        [&#039;12345&#039;]

        # ZIP+4 form
        12101-0001
        [&#039;12101-0001&#039;]

        # invalid ZIP
        98765-
             ^
        FAIL: Expected end of text (at char 5), (line:1, col:6)
    &quot;&quot;&quot;
    def __init__( self, expr, default=_optionalNotMatched ):
        super(Optional,self).__init__( expr, savelist=False )
        self.saveAsList = self.expr.saveAsList
        self.defaultValue = default
        self.mayReturnEmpty = True

    def parseImpl( self, instring, loc, doActions=True ):
        try:
            loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False )
        except (ParseException,IndexError):
            if self.defaultValue is not _optionalNotMatched:
                if self.expr.resultsName:
                    tokens = ParseResults([ self.defaultValue ])
                    tokens[self.expr.resultsName] = self.defaultValue
                else:
                    tokens = [ self.defaultValue ]
            else:
                tokens = []
        return loc, tokens

    def __str__( self ):
        if hasattr(self,&quot;name&quot;):
            return self.name

        if self.strRepr is None:
            self.strRepr = &quot;[&quot; + _ustr(self.expr) + &quot;]&quot;

        return self.strRepr

class SkipTo(ParseElementEnhance):
    &quot;&quot;&quot;
    Token for skipping over all undefined text until the matched expression is found.

    Parameters:
     - expr - target expression marking the end of the data to be skipped
     - include - (default=C{False}) if True, the target expression is also parsed 
          (the skipped text and target expression are returned as a 2-element list).
     - ignore - (default=C{None}) used to define grammars (typically quoted strings and 
          comments) that might contain false matches to the target expression
     - failOn - (default=C{None}) define expressions that are not allowed to be 
          included in the skipped test; if found before the target expression is found, 
          the SkipTo is not a match

    Example::
        report = &#039;&#039;&#039;
            Outstanding Issues Report - 1 Jan 2000

               # | Severity | Description                               |  Days Open
            -----+----------+-------------------------------------------+-----------
             101 | Critical | Intermittent system crash                 |          6
              94 | Cosmetic | Spelling error on Login (&#039;log|n&#039;)         |         14
              79 | Minor    | System slow when running too many reports |         47
            &#039;&#039;&#039;
        integer = Word(nums)
        SEP = Suppress(&#039;|&#039;)
        # use SkipTo to simply match everything up until the next SEP
        # - ignore quoted strings, so that a &#039;|&#039; character inside a quoted string does not match
        # - parse action will call token.strip() for each matched token, i.e., the description body
        string_data = SkipTo(SEP, ignore=quotedString)
        string_data.setParseAction(tokenMap(str.strip))
        ticket_expr = (integer(&quot;issue_num&quot;) + SEP 
                      + string_data(&quot;sev&quot;) + SEP 
                      + string_data(&quot;desc&quot;) + SEP 
                      + integer(&quot;days_open&quot;))
        
        for tkt in ticket_expr.searchString(report):
            print tkt.dump()
    prints::
        [&#039;101&#039;, &#039;Critical&#039;, &#039;Intermittent system crash&#039;, &#039;6&#039;]
        - days_open: 6
        - desc: Intermittent system crash
        - issue_num: 101
        - sev: Critical
        [&#039;94&#039;, &#039;Cosmetic&#039;, &quot;Spelling error on Login (&#039;log|n&#039;)&quot;, &#039;14&#039;]
        - days_open: 14
        - desc: Spelling error on Login (&#039;log|n&#039;)
        - issue_num: 94
        - sev: Cosmetic
        [&#039;79&#039;, &#039;Minor&#039;, &#039;System slow when running too many reports&#039;, &#039;47&#039;]
        - days_open: 47
        - desc: System slow when running too many reports
        - issue_num: 79
        - sev: Minor
    &quot;&quot;&quot;
    def __init__( self, other, include=False, ignore=None, failOn=None ):
        super( SkipTo, self ).__init__( other )
        self.ignoreExpr = ignore
        self.mayReturnEmpty = True
        self.mayIndexError = False
        self.includeMatch = include
        self.asList = False
        if isinstance(failOn, basestring):
            self.failOn = ParserElement._literalStringClass(failOn)
        else:
            self.failOn = failOn
        self.errmsg = &quot;No match found for &quot;+_ustr(self.expr)

    def parseImpl( self, instring, loc, doActions=True ):
        startloc = loc
        instrlen = len(instring)
        expr = self.expr
        expr_parse = self.expr._parse
        self_failOn_canParseNext = self.failOn.canParseNext if self.failOn is not None else None
        self_ignoreExpr_tryParse = self.ignoreExpr.tryParse if self.ignoreExpr is not None else None
        
        tmploc = loc
        while tmploc &lt;= instrlen:
            if self_failOn_canParseNext is not None:
                # break if failOn expression matches
                if self_failOn_canParseNext(instring, tmploc):
                    break
                    
            if self_ignoreExpr_tryParse is not None:
                # advance past ignore expressions
                while 1:
                    try:
                        tmploc = self_ignoreExpr_tryParse(instring, tmploc)
                    except ParseBaseException:
                        break
            
            try:
                expr_parse(instring, tmploc, doActions=False, callPreParse=False)
            except (ParseException, IndexError):
                # no match, advance loc in string
                tmploc += 1
            else:
                # matched skipto expr, done
                break

        else:
            # ran off the end of the input string without matching skipto expr, fail
            raise ParseException(instring, loc, self.errmsg, self)

        # build up return values
        loc = tmploc
        skiptext = instring[startloc:loc]
        skipresult = ParseResults(skiptext)
        
        if self.includeMatch:
            loc, mat = expr_parse(instring,loc,doActions,callPreParse=False)
            skipresult += mat

        return loc, skipresult

class Forward(ParseElementEnhance):
    &quot;&quot;&quot;
    Forward declaration of an expression to be defined later -
    used for recursive grammars, such as algebraic infix notation.
    When the expression is known, it is assigned to the C{Forward} variable using the &#039;&lt;&lt;&#039; operator.

    Note: take care when assigning to C{Forward} not to overlook precedence of operators.
    Specifically, &#039;|&#039; has a lower precedence than &#039;&lt;&lt;&#039;, so that::
        fwdExpr &lt;&lt; a | b | c
    will actually be evaluated as::
        (fwdExpr &lt;&lt; a) | b | c
    thereby leaving b and c out as parseable alternatives.  It is recommended that you
    explicitly group the values inserted into the C{Forward}::
        fwdExpr &lt;&lt; (a | b | c)
    Converting to use the &#039;&lt;&lt;=&#039; operator instead will avoid this problem.

    See L{ParseResults.pprint} for an example of a recursive parser created using
    C{Forward}.
    &quot;&quot;&quot;
    def __init__( self, other=None ):
        super(Forward,self).__init__( other, savelist=False )

    def __lshift__( self, other ):
        if isinstance( other, basestring ):
            other = ParserElement._literalStringClass(other)
        self.expr = other
        self.strRepr = None
        self.mayIndexError = self.expr.mayIndexError
        self.mayReturnEmpty = self.expr.mayReturnEmpty
        self.setWhitespaceChars( self.expr.whiteChars )
        self.skipWhitespace = self.expr.skipWhitespace
        self.saveAsList = self.expr.saveAsList
        self.ignoreExprs.extend(self.expr.ignoreExprs)
        return self
        
    def __ilshift__(self, other):
        return self &lt;&lt; other
    
    def leaveWhitespace( self ):
        self.skipWhitespace = False
        return self

    def streamline( self ):
        if not self.streamlined:
            self.streamlined = True
            if self.expr is not None:
                self.expr.streamline()
        return self

    def validate( self, validateTrace=[] ):
        if self not in validateTrace:
            tmp = validateTrace[:]+[self]
            if self.expr is not None:
                self.expr.validate(tmp)
        self.checkRecursion([])

    def __str__( self ):
        if hasattr(self,&quot;name&quot;):
            return self.name
        return self.__class__.__name__ + &quot;: ...&quot;

        # stubbed out for now - creates awful memory and perf issues
        self._revertClass = self.__class__
        self.__class__ = _ForwardNoRecurse
        try:
            if self.expr is not None:
                retString = _ustr(self.expr)
            else:
                retString = &quot;None&quot;
        finally:
            self.__class__ = self._revertClass
        return self.__class__.__name__ + &quot;: &quot; + retString

    def copy(self):
        if self.expr is not None:
            return super(Forward,self).copy()
        else:
            ret = Forward()
            ret &lt;&lt;= self
            return ret

class _ForwardNoRecurse(Forward):
    def __str__( self ):
        return &quot;...&quot;

class TokenConverter(ParseElementEnhance):
    &quot;&quot;&quot;
    Abstract subclass of C{ParseExpression}, for converting parsed results.
    &quot;&quot;&quot;
    def __init__( self, expr, savelist=False ):
        super(TokenConverter,self).__init__( expr )#, savelist )
        self.saveAsList = False

class Combine(TokenConverter):
    &quot;&quot;&quot;
    Converter to concatenate all matching tokens to a single string.
    By default, the matching patterns must also be contiguous in the input string;
    this can be disabled by specifying C{&#039;adjacent=False&#039;} in the constructor.

    Example::
        real = Word(nums) + &#039;.&#039; + Word(nums)
        print(real.parseString(&#039;3.1416&#039;)) # -&gt; [&#039;3&#039;, &#039;.&#039;, &#039;1416&#039;]
        # will also erroneously match the following
        print(real.parseString(&#039;3. 1416&#039;)) # -&gt; [&#039;3&#039;, &#039;.&#039;, &#039;1416&#039;]

        real = Combine(Word(nums) + &#039;.&#039; + Word(nums))
        print(real.parseString(&#039;3.1416&#039;)) # -&gt; [&#039;3.1416&#039;]
        # no match when there are internal spaces
        print(real.parseString(&#039;3. 1416&#039;)) # -&gt; Exception: Expected W:(0123...)
    &quot;&quot;&quot;
    def __init__( self, expr, joinString=&quot;&quot;, adjacent=True ):
        super(Combine,self).__init__( expr )
        # suppress whitespace-stripping in contained parse expressions, but re-enable it on the Combine itself
        if adjacent:
            self.leaveWhitespace()
        self.adjacent = adjacent
        self.skipWhitespace = True
        self.joinString = joinString
        self.callPreparse = True

    def ignore( self, other ):
        if self.adjacent:
            ParserElement.ignore(self, other)
        else:
            super( Combine, self).ignore( other )
        return self

    def postParse( self, instring, loc, tokenlist ):
        retToks = tokenlist.copy()
        del retToks[:]
        retToks += ParseResults([ &quot;&quot;.join(tokenlist._asStringList(self.joinString)) ], modal=self.modalResults)

        if self.resultsName and retToks.haskeys():
            return [ retToks ]
        else:
            return retToks

class Group(TokenConverter):
    &quot;&quot;&quot;
    Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.

    Example::
        ident = Word(alphas)
        num = Word(nums)
        term = ident | num
        func = ident + Optional(delimitedList(term))
        print(func.parseString(&quot;fn a,b,100&quot;))  # -&gt; [&#039;fn&#039;, &#039;a&#039;, &#039;b&#039;, &#039;100&#039;]

        func = ident + Group(Optional(delimitedList(term)))
        print(func.parseString(&quot;fn a,b,100&quot;))  # -&gt; [&#039;fn&#039;, [&#039;a&#039;, &#039;b&#039;, &#039;100&#039;]]
    &quot;&quot;&quot;
    def __init__( self, expr ):
        super(Group,self).__init__( expr )
        self.saveAsList = True

    def postParse( self, instring, loc, tokenlist ):
        return [ tokenlist ]

class Dict(TokenConverter):
    &quot;&quot;&quot;
    Converter to return a repetitive expression as a list, but also as a dictionary.
    Each element can also be referenced using the first token in the expression as its key.
    Useful for tabular report scraping when the first column can be used as a item key.

    Example::
        data_word = Word(alphas)
        label = data_word + FollowedBy(&#039;:&#039;)
        attr_expr = Group(label + Suppress(&#039;:&#039;) + OneOrMore(data_word).setParseAction(&#039; &#039;.join))

        text = &quot;shape: SQUARE posn: upper left color: light blue texture: burlap&quot;
        attr_expr = (label + Suppress(&#039;:&#039;) + OneOrMore(data_word, stopOn=label).setParseAction(&#039; &#039;.join))
        
        # print attributes as plain groups
        print(OneOrMore(attr_expr).parseString(text).dump())
        
        # instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
        result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
        print(result.dump())
        
        # access named fields as dict entries, or output as dict
        print(result[&#039;shape&#039;])        
        print(result.asDict())
    prints::
        [&#039;shape&#039;, &#039;SQUARE&#039;, &#039;posn&#039;, &#039;upper left&#039;, &#039;color&#039;, &#039;light blue&#039;, &#039;texture&#039;, &#039;burlap&#039;]

        [[&#039;shape&#039;, &#039;SQUARE&#039;], [&#039;posn&#039;, &#039;upper left&#039;], [&#039;color&#039;, &#039;light blue&#039;], [&#039;texture&#039;, &#039;burlap&#039;]]
        - color: light blue
        - posn: upper left
        - shape: SQUARE
        - texture: burlap
        SQUARE
        {&#039;color&#039;: &#039;light blue&#039;, &#039;posn&#039;: &#039;upper left&#039;, &#039;texture&#039;: &#039;burlap&#039;, &#039;shape&#039;: &#039;SQUARE&#039;}
    See more examples at L{ParseResults} of accessing fields by results name.
    &quot;&quot;&quot;
    def __init__( self, expr ):
        super(Dict,self).__init__( expr )
        self.saveAsList = True

    def postParse( self, instring, loc, tokenlist ):
        for i,tok in enumerate(tokenlist):
            if len(tok) == 0:
                continue
            ikey = tok[0]
            if isinstance(ikey,int):
                ikey = _ustr(tok[0]).strip()
            if len(tok)==1:
                tokenlist[ikey] = _ParseResultsWithOffset(&quot;&quot;,i)
            elif len(tok)==2 and not isinstance(tok[1],ParseResults):
                tokenlist[ikey] = _ParseResultsWithOffset(tok[1],i)
            else:
                dictvalue = tok.copy() #ParseResults(i)
                del dictvalue[0]
                if len(dictvalue)!= 1 or (isinstance(dictvalue,ParseResults) and dictvalue.haskeys()):
                    tokenlist[ikey] = _ParseResultsWithOffset(dictvalue,i)
                else:
                    tokenlist[ikey] = _ParseResultsWithOffset(dictvalue[0],i)

        if self.resultsName:
            return [ tokenlist ]
        else:
            return tokenlist


class Suppress(TokenConverter):
    &quot;&quot;&quot;
    Converter for ignoring the results of a parsed expression.

    Example::
        source = &quot;a, b, c,d&quot;
        wd = Word(alphas)
        wd_list1 = wd + ZeroOrMore(&#039;,&#039; + wd)
        print(wd_list1.parseString(source))

        # often, delimiters that are useful during parsing are just in the
        # way afterward - use Suppress to keep them out of the parsed output
        wd_list2 = wd + ZeroOrMore(Suppress(&#039;,&#039;) + wd)
        print(wd_list2.parseString(source))
    prints::
        [&#039;a&#039;, &#039;,&#039;, &#039;b&#039;, &#039;,&#039;, &#039;c&#039;, &#039;,&#039;, &#039;d&#039;]
        [&#039;a&#039;, &#039;b&#039;, &#039;c&#039;, &#039;d&#039;]
    (See also L{delimitedList}.)
    &quot;&quot;&quot;
    def postParse( self, instring, loc, tokenlist ):
        return []

    def suppress( self ):
        return self


class OnlyOnce(object):
    &quot;&quot;&quot;
    Wrapper for parse actions, to ensure they are only called once.
    &quot;&quot;&quot;
    def __init__(self, methodCall):
        self.callable = _trim_arity(methodCall)
        self.called = False
    def __call__(self,s,l,t):
        if not self.called:
            results = self.callable(s,l,t)
            self.called = True
            return results
        raise ParseException(s,l,&quot;&quot;)
    def reset(self):
        self.called = False

def traceParseAction(f):
    &quot;&quot;&quot;
    Decorator for debugging parse actions. 
    
    When the parse action is called, this decorator will print C{&quot;&gt;&gt; entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})&quot;.}
    When the parse action completes, the decorator will print C{&quot;&lt;&lt;&quot;} followed by the returned value, or any exception that the parse action raised.

    Example::
        wd = Word(alphas)

        @traceParseAction
        def remove_duplicate_chars(tokens):
            return &#039;&#039;.join(sorted(set(&#039;&#039;.join(tokens)))

        wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
        print(wds.parseString(&quot;slkdjs sld sldd sdlf sdljf&quot;))
    prints::
        &gt;&gt;entering remove_duplicate_chars(line: &#039;slkdjs sld sldd sdlf sdljf&#039;, 0, ([&#039;slkdjs&#039;, &#039;sld&#039;, &#039;sldd&#039;, &#039;sdlf&#039;, &#039;sdljf&#039;], {}))
        &lt;&lt;leaving remove_duplicate_chars (ret: &#039;dfjkls&#039;)
        [&#039;dfjkls&#039;]
    &quot;&quot;&quot;
    f = _trim_arity(f)
    def z(*paArgs):
        thisFunc = f.__name__
        s,l,t = paArgs[-3:]
        if len(paArgs)&gt;3:
            thisFunc = paArgs[0].__class__.__name__ + &#039;.&#039; + thisFunc
        sys.stderr.write( &quot;&gt;&gt;entering %s(line: &#039;%s&#039;, %d, %r)\n&quot; % (thisFunc,line(l,s),l,t) )
        try:
            ret = f(*paArgs)
        except Exception as exc:
            sys.stderr.write( &quot;&lt;&lt;leaving %s (exception: %s)\n&quot; % (thisFunc,exc) )
            raise
        sys.stderr.write( &quot;&lt;&lt;leaving %s (ret: %r)\n&quot; % (thisFunc,ret) )
        return ret
    try:
        z.__name__ = f.__name__
    except AttributeError:
        pass
    return z

#
# global helpers
#
def delimitedList( expr, delim=&quot;,&quot;, combine=False ):
    &quot;&quot;&quot;
    Helper to define a delimited list of expressions - the delimiter defaults to &#039;,&#039;.
    By default, the list elements and delimiters can have intervening whitespace, and
    comments, but this can be overridden by passing C{combine=True} in the constructor.
    If C{combine} is set to C{True}, the matching tokens are returned as a single token
    string, with the delimiters included; otherwise, the matching tokens are returned
    as a list of tokens, with the delimiters suppressed.

    Example::
        delimitedList(Word(alphas)).parseString(&quot;aa,bb,cc&quot;) # -&gt; [&#039;aa&#039;, &#039;bb&#039;, &#039;cc&#039;]
        delimitedList(Word(hexnums), delim=&#039;:&#039;, combine=True).parseString(&quot;AA:BB:CC:DD:EE&quot;) # -&gt; [&#039;AA:BB:CC:DD:EE&#039;]
    &quot;&quot;&quot;
    dlName = _ustr(expr)+&quot; [&quot;+_ustr(delim)+&quot; &quot;+_ustr(expr)+&quot;]...&quot;
    if combine:
        return Combine( expr + ZeroOrMore( delim + expr ) ).setName(dlName)
    else:
        return ( expr + ZeroOrMore( Suppress( delim ) + expr ) ).setName(dlName)

def countedArray( expr, intExpr=None ):
    &quot;&quot;&quot;
    Helper to define a counted list of expressions.
    This helper defines a pattern of the form::
        integer expr expr expr...
    where the leading integer tells how many expr expressions follow.
    The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
    
    If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.

    Example::
        countedArray(Word(alphas)).parseString(&#039;2 ab cd ef&#039;)  # -&gt; [&#039;ab&#039;, &#039;cd&#039;]

        # in this parser, the leading integer value is given in binary,
        # &#039;10&#039; indicating that 2 values are in the array
        binaryConstant = Word(&#039;01&#039;).setParseAction(lambda t: int(t[0], 2))
        countedArray(Word(alphas), intExpr=binaryConstant).parseString(&#039;10 ab cd ef&#039;)  # -&gt; [&#039;ab&#039;, &#039;cd&#039;]
    &quot;&quot;&quot;
    arrayExpr = Forward()
    def countFieldParseAction(s,l,t):
        n = t[0]
        arrayExpr &lt;&lt; (n and Group(And([expr]*n)) or Group(empty))
        return []
    if intExpr is None:
        intExpr = Word(nums).setParseAction(lambda t:int(t[0]))
    else:
        intExpr = intExpr.copy()
    intExpr.setName(&quot;arrayLen&quot;)
    intExpr.addParseAction(countFieldParseAction, callDuringTry=True)
    return ( intExpr + arrayExpr ).setName(&#039;(len) &#039; + _ustr(expr) + &#039;...&#039;)

def _flatten(L):
    ret = []
    for i in L:
        if isinstance(i,list):
            ret.extend(_flatten(i))
        else:
            ret.append(i)
    return ret

def matchPreviousLiteral(expr):
    &quot;&quot;&quot;
    Helper to define an expression that is indirectly defined from
    the tokens matched in a previous expression, that is, it looks
    for a &#039;repeat&#039; of a previous expression.  For example::
        first = Word(nums)
        second = matchPreviousLiteral(first)
        matchExpr = first + &quot;:&quot; + second
    will match C{&quot;1:1&quot;}, but not C{&quot;1:2&quot;}.  Because this matches a
    previous literal, will also match the leading C{&quot;1:1&quot;} in C{&quot;1:10&quot;}.
    If this is not desired, use C{matchPreviousExpr}.
    Do I{not} use with packrat parsing enabled.
    &quot;&quot;&quot;
    rep = Forward()
    def copyTokenToRepeater(s,l,t):
        if t:
            if len(t) == 1:
                rep &lt;&lt; t[0]
            else:
                # flatten t tokens
                tflat = _flatten(t.asList())
                rep &lt;&lt; And(Literal(tt) for tt in tflat)
        else:
            rep &lt;&lt; Empty()
    expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
    rep.setName(&#039;(prev) &#039; + _ustr(expr))
    return rep

def matchPreviousExpr(expr):
    &quot;&quot;&quot;
    Helper to define an expression that is indirectly defined from
    the tokens matched in a previous expression, that is, it looks
    for a &#039;repeat&#039; of a previous expression.  For example::
        first = Word(nums)
        second = matchPreviousExpr(first)
        matchExpr = first + &quot;:&quot; + second
    will match C{&quot;1:1&quot;}, but not C{&quot;1:2&quot;}.  Because this matches by
    expressions, will I{not} match the leading C{&quot;1:1&quot;} in C{&quot;1:10&quot;};
    the expressions are evaluated first, and then compared, so
    C{&quot;1&quot;} is compared with C{&quot;10&quot;}.
    Do I{not} use with packrat parsing enabled.
    &quot;&quot;&quot;
    rep = Forward()
    e2 = expr.copy()
    rep &lt;&lt;= e2
    def copyTokenToRepeater(s,l,t):
        matchTokens = _flatten(t.asList())
        def mustMatchTheseTokens(s,l,t):
            theseTokens = _flatten(t.asList())
            if  theseTokens != matchTokens:
                raise ParseException(&quot;&quot;,0,&quot;&quot;)
        rep.setParseAction( mustMatchTheseTokens, callDuringTry=True )
    expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
    rep.setName(&#039;(prev) &#039; + _ustr(expr))
    return rep

def _escapeRegexRangeChars(s):
    #~  escape these chars: ^-]
    for c in r&quot;\^-]&quot;:
        s = s.replace(c,_bslash+c)
    s = s.replace(&quot;\n&quot;,r&quot;\n&quot;)
    s = s.replace(&quot;\t&quot;,r&quot;\t&quot;)
    return _ustr(s)

def oneOf( strs, caseless=False, useRegex=True ):
    &quot;&quot;&quot;
    Helper to quickly define a set of alternative Literals, and makes sure to do
    longest-first testing when there is a conflict, regardless of the input order,
    but returns a C{L{MatchFirst}} for best performance.

    Parameters:
     - strs - a string of space-delimited literals, or a collection of string literals
     - caseless - (default=C{False}) - treat all literals as caseless
     - useRegex - (default=C{True}) - as an optimization, will generate a Regex
          object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
          if creating a C{Regex} raises an exception)

    Example::
        comp_oper = oneOf(&quot;&lt; = &gt; &lt;= &gt;= !=&quot;)
        var = Word(alphas)
        number = Word(nums)
        term = var | number
        comparison_expr = term + comp_oper + term
        print(comparison_expr.searchString(&quot;B = 12  AA=23 B&lt;=AA AA&gt;12&quot;))
    prints::
        [[&#039;B&#039;, &#039;=&#039;, &#039;12&#039;], [&#039;AA&#039;, &#039;=&#039;, &#039;23&#039;], [&#039;B&#039;, &#039;&lt;=&#039;, &#039;AA&#039;], [&#039;AA&#039;, &#039;&gt;&#039;, &#039;12&#039;]]
    &quot;&quot;&quot;
    if caseless:
        isequal = ( lambda a,b: a.upper() == b.upper() )
        masks = ( lambda a,b: b.upper().startswith(a.upper()) )
        parseElementClass = CaselessLiteral
    else:
        isequal = ( lambda a,b: a == b )
        masks = ( lambda a,b: b.startswith(a) )
        parseElementClass = Literal

    symbols = []
    if isinstance(strs,basestring):
        symbols = strs.split()
    elif isinstance(strs, collections.Iterable):
        symbols = list(strs)
    else:
        warnings.warn(&quot;Invalid argument to oneOf, expected string or iterable&quot;,
                SyntaxWarning, stacklevel=2)
    if not symbols:
        return NoMatch()

    i = 0
    while i &lt; len(symbols)-1:
        cur = symbols[i]
        for j,other in enumerate(symbols[i+1:]):
            if ( isequal(other, cur) ):
                del symbols[i+j+1]
                break
            elif ( masks(cur, other) ):
                del symbols[i+j+1]
                symbols.insert(i,other)
                cur = other
                break
        else:
            i += 1

    if not caseless and useRegex:
        #~ print (strs,&quot;-&gt;&quot;, &quot;|&quot;.join( [ _escapeRegexChars(sym) for sym in symbols] ))
        try:
            if len(symbols)==len(&quot;&quot;.join(symbols)):
                return Regex( &quot;[%s]&quot; % &quot;&quot;.join(_escapeRegexRangeChars(sym) for sym in symbols) ).setName(&#039; | &#039;.join(symbols))
            else:
                return Regex( &quot;|&quot;.join(re.escape(sym) for sym in symbols) ).setName(&#039; | &#039;.join(symbols))
        except Exception:
            warnings.warn(&quot;Exception creating Regex for oneOf, building MatchFirst&quot;,
                    SyntaxWarning, stacklevel=2)


    # last resort, just use MatchFirst
    return MatchFirst(parseElementClass(sym) for sym in symbols).setName(&#039; | &#039;.join(symbols))

def dictOf( key, value ):
    &quot;&quot;&quot;
    Helper to easily and clearly define a dictionary by specifying the respective patterns
    for the key and value.  Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
    in the proper order.  The key pattern can include delimiting markers or punctuation,
    as long as they are suppressed, thereby leaving the significant key text.  The value
    pattern can include named results, so that the C{Dict} results can include named token
    fields.

    Example::
        text = &quot;shape: SQUARE posn: upper left color: light blue texture: burlap&quot;
        attr_expr = (label + Suppress(&#039;:&#039;) + OneOrMore(data_word, stopOn=label).setParseAction(&#039; &#039;.join))
        print(OneOrMore(attr_expr).parseString(text).dump())
        
        attr_label = label
        attr_value = Suppress(&#039;:&#039;) + OneOrMore(data_word, stopOn=label).setParseAction(&#039; &#039;.join)

        # similar to Dict, but simpler call format
        result = dictOf(attr_label, attr_value).parseString(text)
        print(result.dump())
        print(result[&#039;shape&#039;])
        print(result.shape)  # object attribute access works too
        print(result.asDict())
    prints::
        [[&#039;shape&#039;, &#039;SQUARE&#039;], [&#039;posn&#039;, &#039;upper left&#039;], [&#039;color&#039;, &#039;light blue&#039;], [&#039;texture&#039;, &#039;burlap&#039;]]
        - color: light blue
        - posn: upper left
        - shape: SQUARE
        - texture: burlap
        SQUARE
        SQUARE
        {&#039;color&#039;: &#039;light blue&#039;, &#039;shape&#039;: &#039;SQUARE&#039;, &#039;posn&#039;: &#039;upper left&#039;, &#039;texture&#039;: &#039;burlap&#039;}
    &quot;&quot;&quot;
    return Dict( ZeroOrMore( Group ( key + value ) ) )

def originalTextFor(expr, asString=True):
    &quot;&quot;&quot;
    Helper to return the original, untokenized text for a given expression.  Useful to
    restore the parsed fields of an HTML start tag into the raw tag text itself, or to
    revert separate tokens with intervening whitespace back to the original matching
    input text. By default, returns astring containing the original parsed text.  
       
    If the optional C{asString} argument is passed as C{False}, then the return value is a 
    C{L{ParseResults}} containing any results names that were originally matched, and a 
    single token containing the original matched text from the input string.  So if 
    the expression passed to C{L{originalTextFor}} contains expressions with defined
    results names, you must set C{asString} to C{False} if you want to preserve those
    results name values.

    Example::
        src = &quot;this is test &lt;b&gt; bold &lt;i&gt;text&lt;/i&gt; &lt;/b&gt; normal text &quot;
        for tag in (&quot;b&quot;,&quot;i&quot;):
            opener,closer = makeHTMLTags(tag)
            patt = originalTextFor(opener + SkipTo(closer) + closer)
            print(patt.searchString(src)[0])
    prints::
        [&#039;&lt;b&gt; bold &lt;i&gt;text&lt;/i&gt; &lt;/b&gt;&#039;]
        [&#039;&lt;i&gt;text&lt;/i&gt;&#039;]
    &quot;&quot;&quot;
    locMarker = Empty().setParseAction(lambda s,loc,t: loc)
    endlocMarker = locMarker.copy()
    endlocMarker.callPreparse = False
    matchExpr = locMarker(&quot;_original_start&quot;) + expr + endlocMarker(&quot;_original_end&quot;)
    if asString:
        extractText = lambda s,l,t: s[t._original_start:t._original_end]
    else:
        def extractText(s,l,t):
            t[:] = [s[t.pop(&#039;_original_start&#039;):t.pop(&#039;_original_end&#039;)]]
    matchExpr.setParseAction(extractText)
    matchExpr.ignoreExprs = expr.ignoreExprs
    return matchExpr

def ungroup(expr): 
    &quot;&quot;&quot;
    Helper to undo pyparsing&#039;s default grouping of And expressions, even
    if all but one are non-empty.
    &quot;&quot;&quot;
    return TokenConverter(expr).setParseAction(lambda t:t[0])

def locatedExpr(expr):
    &quot;&quot;&quot;
    Helper to decorate a returned token with its starting and ending locations in the input string.
    This helper adds the following results names:
     - locn_start = location where matched expression begins
     - locn_end = location where matched expression ends
     - value = the actual parsed results

    Be careful if the input text contains C{&lt;TAB&gt;} characters, you may want to call
    C{L{ParserElement.parseWithTabs}}

    Example::
        wd = Word(alphas)
        for match in locatedExpr(wd).searchString(&quot;ljsdf123lksdjjf123lkkjj1222&quot;):
            print(match)
    prints::
        [[0, &#039;ljsdf&#039;, 5]]
        [[8, &#039;lksdjjf&#039;, 15]]
        [[18, &#039;lkkjj&#039;, 23]]
    &quot;&quot;&quot;
    locator = Empty().setParseAction(lambda s,l,t: l)
    return Group(locator(&quot;locn_start&quot;) + expr(&quot;value&quot;) + locator.copy().leaveWhitespace()(&quot;locn_end&quot;))


# convenience constants for positional expressions
empty       = Empty().setName(&quot;empty&quot;)
lineStart   = LineStart().setName(&quot;lineStart&quot;)
lineEnd     = LineEnd().setName(&quot;lineEnd&quot;)
stringStart = StringStart().setName(&quot;stringStart&quot;)
stringEnd   = StringEnd().setName(&quot;stringEnd&quot;)

_escapedPunc = Word( _bslash, r&quot;\[]-*.$+^?()~ &quot;, exact=2 ).setParseAction(lambda s,l,t:t[0][1])
_escapedHexChar = Regex(r&quot;\\0?[xX][0-9a-fA-F]+&quot;).setParseAction(lambda s,l,t:unichr(int(t[0].lstrip(r&#039;\0x&#039;),16)))
_escapedOctChar = Regex(r&quot;\\0[0-7]+&quot;).setParseAction(lambda s,l,t:unichr(int(t[0][1:],8)))
_singleChar = _escapedPunc | _escapedHexChar | _escapedOctChar | Word(printables, excludeChars=r&#039;\]&#039;, exact=1) | Regex(r&quot;\w&quot;, re.UNICODE)
_charRange = Group(_singleChar + Suppress(&quot;-&quot;) + _singleChar)
_reBracketExpr = Literal(&quot;[&quot;) + Optional(&quot;^&quot;).setResultsName(&quot;negate&quot;) + Group( OneOrMore( _charRange | _singleChar ) ).setResultsName(&quot;body&quot;) + &quot;]&quot;

def srange(s):
    r&quot;&quot;&quot;
    Helper to easily define string ranges for use in Word construction.  Borrows
    syntax from regexp &#039;[]&#039; string range definitions::
        srange(&quot;[0-9]&quot;)   -&gt; &quot;0123456789&quot;
        srange(&quot;[a-z]&quot;)   -&gt; &quot;abcdefghijklmnopqrstuvwxyz&quot;
        srange(&quot;[a-z$_]&quot;) -&gt; &quot;abcdefghijklmnopqrstuvwxyz$_&quot;
    The input string must be enclosed in []&#039;s, and the returned string is the expanded
    character set joined into a single string.
    The values enclosed in the []&#039;s may be:
     - a single character
     - an escaped character with a leading backslash (such as C{\-} or C{\]})
     - an escaped hex character with a leading C{&#039;\x&#039;} (C{\x21}, which is a C{&#039;!&#039;} character) 
         (C{\0x##} is also supported for backwards compatibility) 
     - an escaped octal character with a leading C{&#039;\0&#039;} (C{\041}, which is a C{&#039;!&#039;} character)
     - a range of any of the above, separated by a dash (C{&#039;a-z&#039;}, etc.)
     - any combination of the above (C{&#039;aeiouy&#039;}, C{&#039;a-zA-Z0-9_$&#039;}, etc.)
    &quot;&quot;&quot;
    _expanded = lambda p: p if not isinstance(p,ParseResults) else &#039;&#039;.join(unichr(c) for c in range(ord(p[0]),ord(p[1])+1))
    try:
        return &quot;&quot;.join(_expanded(part) for part in _reBracketExpr.parseString(s).body)
    except Exception:
        return &quot;&quot;

def matchOnlyAtCol(n):
    &quot;&quot;&quot;
    Helper method for defining parse actions that require matching at a specific
    column in the input text.
    &quot;&quot;&quot;
    def verifyCol(strg,locn,toks):
        if col(locn,strg) != n:
            raise ParseException(strg,locn,&quot;matched token not at column %d&quot; % n)
    return verifyCol

def replaceWith(replStr):
    &quot;&quot;&quot;
    Helper method for common parse actions that simply return a literal value.  Especially
    useful when used with C{L{transformString&lt;ParserElement.transformString&gt;}()}.

    Example::
        num = Word(nums).setParseAction(lambda toks: int(toks[0]))
        na = oneOf(&quot;N/A NA&quot;).setParseAction(replaceWith(math.nan))
        term = na | num
        
        OneOrMore(term).parseString(&quot;324 234 N/A 234&quot;) # -&gt; [324, 234, nan, 234]
    &quot;&quot;&quot;
    return lambda s,l,t: [replStr]

def removeQuotes(s,l,t):
    &quot;&quot;&quot;
    Helper parse action for removing quotation marks from parsed quoted strings.

    Example::
        # by default, quotation marks are included in parsed results
        quotedString.parseString(&quot;&#039;Now is the Winter of our Discontent&#039;&quot;) # -&gt; [&quot;&#039;Now is the Winter of our Discontent&#039;&quot;]

        # use removeQuotes to strip quotation marks from parsed results
        quotedString.setParseAction(removeQuotes)
        quotedString.parseString(&quot;&#039;Now is the Winter of our Discontent&#039;&quot;) # -&gt; [&quot;Now is the Winter of our Discontent&quot;]
    &quot;&quot;&quot;
    return t[0][1:-1]

def tokenMap(func, *args):
    &quot;&quot;&quot;
    Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional 
    args are passed, they are forwarded to the given function as additional arguments after
    the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
    parsed data to an integer using base 16.

    Example (compare the last to example in L{ParserElement.transformString}::
        hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
        hex_ints.runTests(&#039;&#039;&#039;
            00 11 22 aa FF 0a 0d 1a
            &#039;&#039;&#039;)
        
        upperword = Word(alphas).setParseAction(tokenMap(str.upper))
        OneOrMore(upperword).runTests(&#039;&#039;&#039;
            my kingdom for a horse
            &#039;&#039;&#039;)

        wd = Word(alphas).setParseAction(tokenMap(str.title))
        OneOrMore(wd).setParseAction(&#039; &#039;.join).runTests(&#039;&#039;&#039;
            now is the winter of our discontent made glorious summer by this sun of york
            &#039;&#039;&#039;)
    prints::
        00 11 22 aa FF 0a 0d 1a
        [0, 17, 34, 170, 255, 10, 13, 26]

        my kingdom for a horse
        [&#039;MY&#039;, &#039;KINGDOM&#039;, &#039;FOR&#039;, &#039;A&#039;, &#039;HORSE&#039;]

        now is the winter of our discontent made glorious summer by this sun of york
        [&#039;Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York&#039;]
    &quot;&quot;&quot;
    def pa(s,l,t):
        return [func(tokn, *args) for tokn in t]

    try:
        func_name = getattr(func, &#039;__name__&#039;, 
                            getattr(func, &#039;__class__&#039;).__name__)
    except Exception:
        func_name = str(func)
    pa.__name__ = func_name

    return pa

upcaseTokens = tokenMap(lambda t: _ustr(t).upper())
&quot;&quot;&quot;(Deprecated) Helper parse action to convert tokens to upper case. Deprecated in favor of L{pyparsing_common.upcaseTokens}&quot;&quot;&quot;

downcaseTokens = tokenMap(lambda t: _ustr(t).lower())
&quot;&quot;&quot;(Deprecated) Helper parse action to convert tokens to lower case. Deprecated in favor of L{pyparsing_common.downcaseTokens}&quot;&quot;&quot;
    
def _makeTags(tagStr, xml):
    &quot;&quot;&quot;Internal helper to construct opening and closing tag expressions, given a tag name&quot;&quot;&quot;
    if isinstance(tagStr,basestring):
        resname = tagStr
        tagStr = Keyword(tagStr, caseless=not xml)
    else:
        resname = tagStr.name

    tagAttrName = Word(alphas,alphanums+&quot;_-:&quot;)
    if (xml):
        tagAttrValue = dblQuotedString.copy().setParseAction( removeQuotes )
        openTag = Suppress(&quot;&lt;&quot;) + tagStr(&quot;tag&quot;) + \
                Dict(ZeroOrMore(Group( tagAttrName + Suppress(&quot;=&quot;) + tagAttrValue ))) + \
                Optional(&quot;/&quot;,default=[False]).setResultsName(&quot;empty&quot;).setParseAction(lambda s,l,t:t[0]==&#039;/&#039;) + Suppress(&quot;&gt;&quot;)
    else:
        printablesLessRAbrack = &quot;&quot;.join(c for c in printables if c not in &quot;&gt;&quot;)
        tagAttrValue = quotedString.copy().setParseAction( removeQuotes ) | Word(printablesLessRAbrack)
        openTag = Suppress(&quot;&lt;&quot;) + tagStr(&quot;tag&quot;) + \
                Dict(ZeroOrMore(Group( tagAttrName.setParseAction(downcaseTokens) + \
                Optional( Suppress(&quot;=&quot;) + tagAttrValue ) ))) + \
                Optional(&quot;/&quot;,default=[False]).setResultsName(&quot;empty&quot;).setParseAction(lambda s,l,t:t[0]==&#039;/&#039;) + Suppress(&quot;&gt;&quot;)
    closeTag = Combine(_L(&quot;&lt;/&quot;) + tagStr + &quot;&gt;&quot;)

    openTag = openTag.setResultsName(&quot;start&quot;+&quot;&quot;.join(resname.replace(&quot;:&quot;,&quot; &quot;).title().split())).setName(&quot;&lt;%s&gt;&quot; % resname)
    closeTag = closeTag.setResultsName(&quot;end&quot;+&quot;&quot;.join(resname.replace(&quot;:&quot;,&quot; &quot;).title().split())).setName(&quot;&lt;/%s&gt;&quot; % resname)
    openTag.tag = resname
    closeTag.tag = resname
    return openTag, closeTag

def makeHTMLTags(tagStr):
    &quot;&quot;&quot;
    Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
    tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.

    Example::
        text = &#039;&lt;td&gt;More info at the &lt;a href=&quot;http://pyparsing.wikispaces.com&quot;&gt;pyparsing&lt;/a&gt; wiki page&lt;/td&gt;&#039;
        # makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
        a,a_end = makeHTMLTags(&quot;A&quot;)
        link_expr = a + SkipTo(a_end)(&quot;link_text&quot;) + a_end
        
        for link in link_expr.searchString(text):
            # attributes in the &lt;A&gt; tag (like &quot;href&quot; shown here) are also accessible as named results
            print(link.link_text, &#039;-&gt;&#039;, link.href)
    prints::
        pyparsing -&gt; http://pyparsing.wikispaces.com
    &quot;&quot;&quot;
    return _makeTags( tagStr, False )

def makeXMLTags(tagStr):
    &quot;&quot;&quot;
    Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
    tags only in the given upper/lower case.

    Example: similar to L{makeHTMLTags}
    &quot;&quot;&quot;
    return _makeTags( tagStr, True )

def withAttribute(*args,**attrDict):
    &quot;&quot;&quot;
    Helper to create a validating parse action to be used with start tags created
    with C{L{makeXMLTags}} or C{L{makeHTMLTags}}. Use C{withAttribute} to qualify a starting tag
    with a required attribute value, to avoid false matches on common tags such as
    C{&lt;TD&gt;} or C{&lt;DIV&gt;}.

    Call C{withAttribute} with a series of attribute names and values. Specify the list
    of filter attributes names and values as:
     - keyword arguments, as in C{(align=&quot;right&quot;)}, or
     - as an explicit dict with C{**} operator, when an attribute name is also a Python
          reserved word, as in C{**{&quot;class&quot;:&quot;Customer&quot;, &quot;align&quot;:&quot;right&quot;}}
     - a list of name-value tuples, as in ( (&quot;ns1:class&quot;, &quot;Customer&quot;), (&quot;ns2:align&quot;,&quot;right&quot;) )
    For attribute names with a namespace prefix, you must use the second form.  Attribute
    names are matched insensitive to upper/lower case.
       
    If just testing for C{class} (with or without a namespace), use C{L{withClass}}.

    To verify that the attribute exists, but without specifying a value, pass
    C{withAttribute.ANY_VALUE} as the value.

    Example::
        html = &#039;&#039;&#039;
            &lt;div&gt;
            Some text
            &lt;div type=&quot;grid&quot;&gt;1 4 0 1 0&lt;/div&gt;
            &lt;div type=&quot;graph&quot;&gt;1,3 2,3 1,1&lt;/div&gt;
            &lt;div&gt;this has no type&lt;/div&gt;
            &lt;/div&gt;
                
        &#039;&#039;&#039;
        div,div_end = makeHTMLTags(&quot;div&quot;)

        # only match div tag having a type attribute with value &quot;grid&quot;
        div_grid = div().setParseAction(withAttribute(type=&quot;grid&quot;))
        grid_expr = div_grid + SkipTo(div | div_end)(&quot;body&quot;)
        for grid_header in grid_expr.searchString(html):
            print(grid_header.body)
        
        # construct a match with any div tag having a type attribute, regardless of the value
        div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
        div_expr = div_any_type + SkipTo(div | div_end)(&quot;body&quot;)
        for div_header in div_expr.searchString(html):
            print(div_header.body)
    prints::
        1 4 0 1 0

        1 4 0 1 0
        1,3 2,3 1,1
    &quot;&quot;&quot;
    if args:
        attrs = args[:]
    else:
        attrs = attrDict.items()
    attrs = [(k,v) for k,v in attrs]
    def pa(s,l,tokens):
        for attrName,attrValue in attrs:
            if attrName not in tokens:
                raise ParseException(s,l,&quot;no matching attribute &quot; + attrName)
            if attrValue != withAttribute.ANY_VALUE and tokens[attrName] != attrValue:
                raise ParseException(s,l,&quot;attribute &#039;%s&#039; has value &#039;%s&#039;, must be &#039;%s&#039;&quot; %
                                            (attrName, tokens[attrName], attrValue))
    return pa
withAttribute.ANY_VALUE = object()

def withClass(classname, namespace=&#039;&#039;):
    &quot;&quot;&quot;
    Simplified version of C{L{withAttribute}} when matching on a div class - made
    difficult because C{class} is a reserved word in Python.

    Example::
        html = &#039;&#039;&#039;
            &lt;div&gt;
            Some text
            &lt;div class=&quot;grid&quot;&gt;1 4 0 1 0&lt;/div&gt;
            &lt;div class=&quot;graph&quot;&gt;1,3 2,3 1,1&lt;/div&gt;
            &lt;div&gt;this &amp;lt;div&amp;gt; has no class&lt;/div&gt;
            &lt;/div&gt;
                
        &#039;&#039;&#039;
        div,div_end = makeHTMLTags(&quot;div&quot;)
        div_grid = div().setParseAction(withClass(&quot;grid&quot;))
        
        grid_expr = div_grid + SkipTo(div | div_end)(&quot;body&quot;)
        for grid_header in grid_expr.searchString(html):
            print(grid_header.body)
        
        div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
        div_expr = div_any_type + SkipTo(div | div_end)(&quot;body&quot;)
        for div_header in div_expr.searchString(html):
            print(div_header.body)
    prints::
        1 4 0 1 0

        1 4 0 1 0
        1,3 2,3 1,1
    &quot;&quot;&quot;
    classattr = &quot;%s:class&quot; % namespace if namespace else &quot;class&quot;
    return withAttribute(**{classattr : classname})        

opAssoc = _Constants()
opAssoc.LEFT = object()
opAssoc.RIGHT = object()

def infixNotation( baseExpr, opList, lpar=Suppress(&#039;(&#039;), rpar=Suppress(&#039;)&#039;) ):
    &quot;&quot;&quot;
    Helper method for constructing grammars of expressions made up of
    operators working in a precedence hierarchy.  Operators may be unary or
    binary, left- or right-associative.  Parse actions can also be attached
    to operator expressions. The generated parser will also recognize the use 
    of parentheses to override operator precedences (see example below).
    
    Note: if you define a deep operator list, you may see performance issues
    when using infixNotation. See L{ParserElement.enablePackrat} for a
    mechanism to potentially improve your parser performance.

    Parameters:
     - baseExpr - expression representing the most basic element for the nested
     - opList - list of tuples, one for each operator precedence level in the
      expression grammar; each tuple is of the form
      (opExpr, numTerms, rightLeftAssoc, parseAction), where:
       - opExpr is the pyparsing expression for the operator;
          may also be a string, which will be converted to a Literal;
          if numTerms is 3, opExpr is a tuple of two expressions, for the
          two operators separating the 3 terms
       - numTerms is the number of terms for this operator (must
          be 1, 2, or 3)
       - rightLeftAssoc is the indicator whether the operator is
          right or left associative, using the pyparsing-defined
          constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
       - parseAction is the parse action to be associated with
          expressions matching this operator expression (the
          parse action tuple member may be omitted)
     - lpar - expression for matching left-parentheses (default=C{Suppress(&#039;(&#039;)})
     - rpar - expression for matching right-parentheses (default=C{Suppress(&#039;)&#039;)})

    Example::
        # simple example of four-function arithmetic with ints and variable names
        integer = pyparsing_common.signed_integer
        varname = pyparsing_common.identifier 
        
        arith_expr = infixNotation(integer | varname,
            [
            (&#039;-&#039;, 1, opAssoc.RIGHT),
            (oneOf(&#039;* /&#039;), 2, opAssoc.LEFT),
            (oneOf(&#039;+ -&#039;), 2, opAssoc.LEFT),
            ])
        
        arith_expr.runTests(&#039;&#039;&#039;
            5+3*6
            (5+3)*6
            -2--11
            &#039;&#039;&#039;, fullDump=False)
    prints::
        5+3*6
        [[5, &#039;+&#039;, [3, &#039;*&#039;, 6]]]

        (5+3)*6
        [[[5, &#039;+&#039;, 3], &#039;*&#039;, 6]]

        -2--11
        [[[&#039;-&#039;, 2], &#039;-&#039;, [&#039;-&#039;, 11]]]
    &quot;&quot;&quot;
    ret = Forward()
    lastExpr = baseExpr | ( lpar + ret + rpar )
    for i,operDef in enumerate(opList):
        opExpr,arity,rightLeftAssoc,pa = (operDef + (None,))[:4]
        termName = &quot;%s term&quot; % opExpr if arity &lt; 3 else &quot;%s%s term&quot; % opExpr
        if arity == 3:
            if opExpr is None or len(opExpr) != 2:
                raise ValueError(&quot;if numterms=3, opExpr must be a tuple or list of two expressions&quot;)
            opExpr1, opExpr2 = opExpr
        thisExpr = Forward().setName(termName)
        if rightLeftAssoc == opAssoc.LEFT:
            if arity == 1:
                matchExpr = FollowedBy(lastExpr + opExpr) + Group( lastExpr + OneOrMore( opExpr ) )
            elif arity == 2:
                if opExpr is not None:
                    matchExpr = FollowedBy(lastExpr + opExpr + lastExpr) + Group( lastExpr + OneOrMore( opExpr + lastExpr ) )
                else:
                    matchExpr = FollowedBy(lastExpr+lastExpr) + Group( lastExpr + OneOrMore(lastExpr) )
            elif arity == 3:
                matchExpr = FollowedBy(lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr) + \
                            Group( lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr )
            else:
                raise ValueError(&quot;operator must be unary (1), binary (2), or ternary (3)&quot;)
        elif rightLeftAssoc == opAssoc.RIGHT:
            if arity == 1:
                # try to avoid LR with this extra test
                if not isinstance(opExpr, Optional):
                    opExpr = Optional(opExpr)
                matchExpr = FollowedBy(opExpr.expr + thisExpr) + Group( opExpr + thisExpr )
            elif arity == 2:
                if opExpr is not None:
                    matchExpr = FollowedBy(lastExpr + opExpr + thisExpr) + Group( lastExpr + OneOrMore( opExpr + thisExpr ) )
                else:
                    matchExpr = FollowedBy(lastExpr + thisExpr) + Group( lastExpr + OneOrMore( thisExpr ) )
            elif arity == 3:
                matchExpr = FollowedBy(lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr) + \
                            Group( lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr )
            else:
                raise ValueError(&quot;operator must be unary (1), binary (2), or ternary (3)&quot;)
        else:
            raise ValueError(&quot;operator must indicate right or left associativity&quot;)
        if pa:
            matchExpr.setParseAction( pa )
        thisExpr &lt;&lt;= ( matchExpr.setName(termName) | lastExpr )
        lastExpr = thisExpr
    ret &lt;&lt;= lastExpr
    return ret

operatorPrecedence = infixNotation
&quot;&quot;&quot;(Deprecated) Former name of C{L{infixNotation}}, will be dropped in a future release.&quot;&quot;&quot;

dblQuotedString = Combine(Regex(r&#039;&quot;(?:[^&quot;\n\r\\]|(?:&quot;&quot;)|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*&#039;)+&#039;&quot;&#039;).setName(&quot;string enclosed in double quotes&quot;)
sglQuotedString = Combine(Regex(r&quot;&#039;(?:[^&#039;\n\r\\]|(?:&#039;&#039;)|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*&quot;)+&quot;&#039;&quot;).setName(&quot;string enclosed in single quotes&quot;)
quotedString = Combine(Regex(r&#039;&quot;(?:[^&quot;\n\r\\]|(?:&quot;&quot;)|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*&#039;)+&#039;&quot;&#039;|
                       Regex(r&quot;&#039;(?:[^&#039;\n\r\\]|(?:&#039;&#039;)|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*&quot;)+&quot;&#039;&quot;).setName(&quot;quotedString using single or double quotes&quot;)
unicodeString = Combine(_L(&#039;u&#039;) + quotedString.copy()).setName(&quot;unicode string literal&quot;)

def nestedExpr(opener=&quot;(&quot;, closer=&quot;)&quot;, content=None, ignoreExpr=quotedString.copy()):
    &quot;&quot;&quot;
    Helper method for defining nested lists enclosed in opening and closing
    delimiters (&quot;(&quot; and &quot;)&quot; are the default).

    Parameters:
     - opener - opening character for a nested list (default=C{&quot;(&quot;}); can also be a pyparsing expression
     - closer - closing character for a nested list (default=C{&quot;)&quot;}); can also be a pyparsing expression
     - content - expression for items within the nested lists (default=C{None})
     - ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})

    If an expression is not provided for the content argument, the nested
    expression will capture all whitespace-delimited content between delimiters
    as a list of separate values.

    Use the C{ignoreExpr} argument to define expressions that may contain
    opening or closing characters that should not be treated as opening
    or closing characters for nesting, such as quotedString or a comment
    expression.  Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
    The default is L{quotedString}, but if no expressions are to be ignored,
    then pass C{None} for this argument.

    Example::
        data_type = oneOf(&quot;void int short long char float double&quot;)
        decl_data_type = Combine(data_type + Optional(Word(&#039;*&#039;)))
        ident = Word(alphas+&#039;_&#039;, alphanums+&#039;_&#039;)
        number = pyparsing_common.number
        arg = Group(decl_data_type + ident)
        LPAR,RPAR = map(Suppress, &quot;()&quot;)

        code_body = nestedExpr(&#039;{&#039;, &#039;}&#039;, ignoreExpr=(quotedString | cStyleComment))

        c_function = (decl_data_type(&quot;type&quot;) 
                      + ident(&quot;name&quot;)
                      + LPAR + Optional(delimitedList(arg), [])(&quot;args&quot;) + RPAR 
                      + code_body(&quot;body&quot;))
        c_function.ignore(cStyleComment)
        
        source_code = &#039;&#039;&#039;
            int is_odd(int x) { 
                return (x%2); 
            }
                
            int dec_to_hex(char hchar) { 
                if (hchar &gt;= &#039;0&#039; &amp;&amp; hchar &lt;= &#039;9&#039;) { 
                    return (ord(hchar)-ord(&#039;0&#039;)); 
                } else { 
                    return (10+ord(hchar)-ord(&#039;A&#039;));
                } 
            }
        &#039;&#039;&#039;
        for func in c_function.searchString(source_code):
            print(&quot;%(name)s (%(type)s) args: %(args)s&quot; % func)

    prints::
        is_odd (int) args: [[&#039;int&#039;, &#039;x&#039;]]
        dec_to_hex (int) args: [[&#039;char&#039;, &#039;hchar&#039;]]
    &quot;&quot;&quot;
    if opener == closer:
        raise ValueError(&quot;opening and closing strings cannot be the same&quot;)
    if content is None:
        if isinstance(opener,basestring) and isinstance(closer,basestring):
            if len(opener) == 1 and len(closer)==1:
                if ignoreExpr is not None:
                    content = (Combine(OneOrMore(~ignoreExpr +
                                    CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS,exact=1))
                                ).setParseAction(lambda t:t[0].strip()))
                else:
                    content = (empty.copy()+CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS
                                ).setParseAction(lambda t:t[0].strip()))
            else:
                if ignoreExpr is not None:
                    content = (Combine(OneOrMore(~ignoreExpr + 
                                    ~Literal(opener) + ~Literal(closer) +
                                    CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
                                ).setParseAction(lambda t:t[0].strip()))
                else:
                    content = (Combine(OneOrMore(~Literal(opener) + ~Literal(closer) +
                                    CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
                                ).setParseAction(lambda t:t[0].strip()))
        else:
            raise ValueError(&quot;opening and closing arguments must be strings if no content expression is given&quot;)
    ret = Forward()
    if ignoreExpr is not None:
        ret &lt;&lt;= Group( Suppress(opener) + ZeroOrMore( ignoreExpr | ret | content ) + Suppress(closer) )
    else:
        ret &lt;&lt;= Group( Suppress(opener) + ZeroOrMore( ret | content )  + Suppress(closer) )
    ret.setName(&#039;nested %s%s expression&#039; % (opener,closer))
    return ret

def indentedBlock(blockStatementExpr, indentStack, indent=True):
    &quot;&quot;&quot;
    Helper method for defining space-delimited indentation blocks, such as
    those used to define block statements in Python source code.

    Parameters:
     - blockStatementExpr - expression defining syntax of statement that
            is repeated within the indented block
     - indentStack - list created by caller to manage indentation stack
            (multiple statementWithIndentedBlock expressions within a single grammar
            should share a common indentStack)
     - indent - boolean indicating whether block must be indented beyond the
            the current level; set to False for block of left-most statements
            (default=C{True})

    A valid block must contain at least one C{blockStatement}.

    Example::
        data = &#039;&#039;&#039;
        def A(z):
          A1
          B = 100
          G = A2
          A2
          A3
        B
        def BB(a,b,c):
          BB1
          def BBA():
            bba1
            bba2
            bba3
        C
        D
        def spam(x,y):
             def eggs(z):
                 pass
        &#039;&#039;&#039;


        indentStack = [1]
        stmt = Forward()

        identifier = Word(alphas, alphanums)
        funcDecl = (&quot;def&quot; + identifier + Group( &quot;(&quot; + Optional( delimitedList(identifier) ) + &quot;)&quot; ) + &quot;:&quot;)
        func_body = indentedBlock(stmt, indentStack)
        funcDef = Group( funcDecl + func_body )

        rvalue = Forward()
        funcCall = Group(identifier + &quot;(&quot; + Optional(delimitedList(rvalue)) + &quot;)&quot;)
        rvalue &lt;&lt; (funcCall | identifier | Word(nums))
        assignment = Group(identifier + &quot;=&quot; + rvalue)
        stmt &lt;&lt; ( funcDef | assignment | identifier )

        module_body = OneOrMore(stmt)

        parseTree = module_body.parseString(data)
        parseTree.pprint()
    prints::
        [[&#039;def&#039;,
          &#039;A&#039;,
          [&#039;(&#039;, &#039;z&#039;, &#039;)&#039;],
          &#039;:&#039;,
          [[&#039;A1&#039;], [[&#039;B&#039;, &#039;=&#039;, &#039;100&#039;]], [[&#039;G&#039;, &#039;=&#039;, &#039;A2&#039;]], [&#039;A2&#039;], [&#039;A3&#039;]]],
         &#039;B&#039;,
         [&#039;def&#039;,
          &#039;BB&#039;,
          [&#039;(&#039;, &#039;a&#039;, &#039;b&#039;, &#039;c&#039;, &#039;)&#039;],
          &#039;:&#039;,
          [[&#039;BB1&#039;], [[&#039;def&#039;, &#039;BBA&#039;, [&#039;(&#039;, &#039;)&#039;], &#039;:&#039;, [[&#039;bba1&#039;], [&#039;bba2&#039;], [&#039;bba3&#039;]]]]]],
         &#039;C&#039;,
         &#039;D&#039;,
         [&#039;def&#039;,
          &#039;spam&#039;,
          [&#039;(&#039;, &#039;x&#039;, &#039;y&#039;, &#039;)&#039;],
          &#039;:&#039;,
          [[[&#039;def&#039;, &#039;eggs&#039;, [&#039;(&#039;, &#039;z&#039;, &#039;)&#039;], &#039;:&#039;, [[&#039;pass&#039;]]]]]]] 
    &quot;&quot;&quot;
    def checkPeerIndent(s,l,t):
        if l &gt;= len(s): return
        curCol = col(l,s)
        if curCol != indentStack[-1]:
            if curCol &gt; indentStack[-1]:
                raise ParseFatalException(s,l,&quot;illegal nesting&quot;)
            raise ParseException(s,l,&quot;not a peer entry&quot;)

    def checkSubIndent(s,l,t):
        curCol = col(l,s)
        if curCol &gt; indentStack[-1]:
            indentStack.append( curCol )
        else:
            raise ParseException(s,l,&quot;not a subentry&quot;)

    def checkUnindent(s,l,t):
        if l &gt;= len(s): return
        curCol = col(l,s)
        if not(indentStack and curCol &lt; indentStack[-1] and curCol &lt;= indentStack[-2]):
            raise ParseException(s,l,&quot;not an unindent&quot;)
        indentStack.pop()

    NL = OneOrMore(LineEnd().setWhitespaceChars(&quot;\t &quot;).suppress())
    INDENT = (Empty() + Empty().setParseAction(checkSubIndent)).setName(&#039;INDENT&#039;)
    PEER   = Empty().setParseAction(checkPeerIndent).setName(&#039;&#039;)
    UNDENT = Empty().setParseAction(checkUnindent).setName(&#039;UNINDENT&#039;)
    if indent:
        smExpr = Group( Optional(NL) +
            #~ FollowedBy(blockStatementExpr) +
            INDENT + (OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) + UNDENT)
    else:
        smExpr = Group( Optional(NL) +
            (OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) )
    blockStatementExpr.ignore(_bslash + LineEnd())
    return smExpr.setName(&#039;indented block&#039;)

alphas8bit = srange(r&quot;[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]&quot;)
punc8bit = srange(r&quot;[\0xa1-\0xbf\0xd7\0xf7]&quot;)

anyOpenTag,anyCloseTag = makeHTMLTags(Word(alphas,alphanums+&quot;_:&quot;).setName(&#039;any tag&#039;))
_htmlEntityMap = dict(zip(&quot;gt lt amp nbsp quot apos&quot;.split(),&#039;&gt;&lt;&amp; &quot;\&#039;&#039;))
commonHTMLEntity = Regex(&#039;&amp;(?P&lt;entity&gt;&#039; + &#039;|&#039;.join(_htmlEntityMap.keys()) +&quot;);&quot;).setName(&quot;common HTML entity&quot;)
def replaceHTMLEntity(t):
    &quot;&quot;&quot;Helper parser action to replace common HTML entities with their special characters&quot;&quot;&quot;
    return _htmlEntityMap.get(t.entity)

# it&#039;s easy to get these comment structures wrong - they&#039;re very common, so may as well make them available
cStyleComment = Combine(Regex(r&quot;/\*(?:[^*]|\*(?!/))*&quot;) + &#039;*/&#039;).setName(&quot;C style comment&quot;)
&quot;Comment of the form C{/* ... */}&quot;

htmlComment = Regex(r&quot;&lt;!--[\s\S]*?--&gt;&quot;).setName(&quot;HTML comment&quot;)
&quot;Comment of the form C{&lt;!-- ... --&gt;}&quot;

restOfLine = Regex(r&quot;.*&quot;).leaveWhitespace().setName(&quot;rest of line&quot;)
dblSlashComment = Regex(r&quot;//(?:\\\n|[^\n])*&quot;).setName(&quot;// comment&quot;)
&quot;Comment of the form C{// ... (to end of line)}&quot;

cppStyleComment = Combine(Regex(r&quot;/\*(?:[^*]|\*(?!/))*&quot;) + &#039;*/&#039;| dblSlashComment).setName(&quot;C++ style comment&quot;)
&quot;Comment of either form C{L{cStyleComment}} or C{L{dblSlashComment}}&quot;

javaStyleComment = cppStyleComment
&quot;Same as C{L{cppStyleComment}}&quot;

pythonStyleComment = Regex(r&quot;#.*&quot;).setName(&quot;Python style comment&quot;)
&quot;Comment of the form C{# ... (to end of line)}&quot;

_commasepitem = Combine(OneOrMore(Word(printables, excludeChars=&#039;,&#039;) +
                                  Optional( Word(&quot; \t&quot;) +
                                            ~Literal(&quot;,&quot;) + ~LineEnd() ) ) ).streamline().setName(&quot;commaItem&quot;)
commaSeparatedList = delimitedList( Optional( quotedString.copy() | _commasepitem, default=&quot;&quot;) ).setName(&quot;commaSeparatedList&quot;)
&quot;&quot;&quot;(Deprecated) Predefined expression of 1 or more printable words or quoted strings, separated by commas.
   This expression is deprecated in favor of L{pyparsing_common.comma_separated_list}.&quot;&quot;&quot;

# some other useful expressions - using lower-case class name since we are really using this as a namespace
class pyparsing_common:
    &quot;&quot;&quot;
    Here are some common low-level expressions that may be useful in jump-starting parser development:
     - numeric forms (L{integers&lt;integer&gt;}, L{reals&lt;real&gt;}, L{scientific notation&lt;sci_real&gt;})
     - common L{programming identifiers&lt;identifier&gt;}
     - network addresses (L{MAC&lt;mac_address&gt;}, L{IPv4&lt;ipv4_address&gt;}, L{IPv6&lt;ipv6_address&gt;})
     - ISO8601 L{dates&lt;iso8601_date&gt;} and L{datetime&lt;iso8601_datetime&gt;}
     - L{UUID&lt;uuid&gt;}
     - L{comma-separated list&lt;comma_separated_list&gt;}
    Parse actions:
     - C{L{convertToInteger}}
     - C{L{convertToFloat}}
     - C{L{convertToDate}}
     - C{L{convertToDatetime}}
     - C{L{stripHTMLTags}}
     - C{L{upcaseTokens}}
     - C{L{downcaseTokens}}

    Example::
        pyparsing_common.number.runTests(&#039;&#039;&#039;
            # any int or real number, returned as the appropriate type
            100
            -100
            +100
            3.14159
            6.02e23
            1e-12
            &#039;&#039;&#039;)

        pyparsing_common.fnumber.runTests(&#039;&#039;&#039;
            # any int or real number, returned as float
            100
            -100
            +100
            3.14159
            6.02e23
            1e-12
            &#039;&#039;&#039;)

        pyparsing_common.hex_integer.runTests(&#039;&#039;&#039;
            # hex numbers
            100
            FF
            &#039;&#039;&#039;)

        pyparsing_common.fraction.runTests(&#039;&#039;&#039;
            # fractions
            1/2
            -3/4
            &#039;&#039;&#039;)

        pyparsing_common.mixed_integer.runTests(&#039;&#039;&#039;
            # mixed fractions
            1
            1/2
            -3/4
            1-3/4
            &#039;&#039;&#039;)

        import uuid
        pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
        pyparsing_common.uuid.runTests(&#039;&#039;&#039;
            # uuid
            12345678-1234-5678-1234-567812345678
            &#039;&#039;&#039;)
    prints::
        # any int or real number, returned as the appropriate type
        100
        [100]

        -100
        [-100]

        +100
        [100]

        3.14159
        [3.14159]

        6.02e23
        [6.02e+23]

        1e-12
        [1e-12]

        # any int or real number, returned as float
        100
        [100.0]

        -100
        [-100.0]

        +100
        [100.0]

        3.14159
        [3.14159]

        6.02e23
        [6.02e+23]

        1e-12
        [1e-12]

        # hex numbers
        100
        [256]

        FF
        [255]

        # fractions
        1/2
        [0.5]

        -3/4
        [-0.75]

        # mixed fractions
        1
        [1]

        1/2
        [0.5]

        -3/4
        [-0.75]

        1-3/4
        [1.75]

        # uuid
        12345678-1234-5678-1234-567812345678
        [UUID(&#039;12345678-1234-5678-1234-567812345678&#039;)]
    &quot;&quot;&quot;

    convertToInteger = tokenMap(int)
    &quot;&quot;&quot;
    Parse action for converting parsed integers to Python int
    &quot;&quot;&quot;

    convertToFloat = tokenMap(float)
    &quot;&quot;&quot;
    Parse action for converting parsed numbers to Python float
    &quot;&quot;&quot;

    integer = Word(nums).setName(&quot;integer&quot;).setParseAction(convertToInteger)
    &quot;&quot;&quot;expression that parses an unsigned integer, returns an int&quot;&quot;&quot;

    hex_integer = Word(hexnums).setName(&quot;hex integer&quot;).setParseAction(tokenMap(int,16))
    &quot;&quot;&quot;expression that parses a hexadecimal integer, returns an int&quot;&quot;&quot;

    signed_integer = Regex(r&#039;[+-]?\d+&#039;).setName(&quot;signed integer&quot;).setParseAction(convertToInteger)
    &quot;&quot;&quot;expression that parses an integer with optional leading sign, returns an int&quot;&quot;&quot;

    fraction = (signed_integer().setParseAction(convertToFloat) + &#039;/&#039; + signed_integer().setParseAction(convertToFloat)).setName(&quot;fraction&quot;)
    &quot;&quot;&quot;fractional expression of an integer divided by an integer, returns a float&quot;&quot;&quot;
    fraction.addParseAction(lambda t: t[0]/t[-1])

    mixed_integer = (fraction | signed_integer + Optional(Optional(&#039;-&#039;).suppress() + fraction)).setName(&quot;fraction or mixed integer-fraction&quot;)
    &quot;&quot;&quot;mixed integer of the form &#039;integer - fraction&#039;, with optional leading integer, returns float&quot;&quot;&quot;
    mixed_integer.addParseAction(sum)

    real = Regex(r&#039;[+-]?\d+\.\d*&#039;).setName(&quot;real number&quot;).setParseAction(convertToFloat)
    &quot;&quot;&quot;expression that parses a floating point number and returns a float&quot;&quot;&quot;

    sci_real = Regex(r&#039;[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)&#039;).setName(&quot;real number with scientific notation&quot;).setParseAction(convertToFloat)
    &quot;&quot;&quot;expression that parses a floating point number with optional scientific notation and returns a float&quot;&quot;&quot;

    # streamlining this expression makes the docs nicer-looking
    number = (sci_real | real | signed_integer).streamline()
    &quot;&quot;&quot;any numeric expression, returns the corresponding Python type&quot;&quot;&quot;

    fnumber = Regex(r&#039;[+-]?\d+\.?\d*([eE][+-]?\d+)?&#039;).setName(&quot;fnumber&quot;).setParseAction(convertToFloat)
    &quot;&quot;&quot;any int or real number, returned as float&quot;&quot;&quot;
    
    identifier = Word(alphas+&#039;_&#039;, alphanums+&#039;_&#039;).setName(&quot;identifier&quot;)
    &quot;&quot;&quot;typical code identifier (leading alpha or &#039;_&#039;, followed by 0 or more alphas, nums, or &#039;_&#039;)&quot;&quot;&quot;
    
    ipv4_address = Regex(r&#039;(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}&#039;).setName(&quot;IPv4 address&quot;)
    &quot;IPv4 address (C{0.0.0.0 - 255.255.255.255})&quot;

    _ipv6_part = Regex(r&#039;[0-9a-fA-F]{1,4}&#039;).setName(&quot;hex_integer&quot;)
    _full_ipv6_address = (_ipv6_part + (&#039;:&#039; + _ipv6_part)*7).setName(&quot;full IPv6 address&quot;)
    _short_ipv6_address = (Optional(_ipv6_part + (&#039;:&#039; + _ipv6_part)*(0,6)) + &quot;::&quot; + Optional(_ipv6_part + (&#039;:&#039; + _ipv6_part)*(0,6))).setName(&quot;short IPv6 address&quot;)
    _short_ipv6_address.addCondition(lambda t: sum(1 for tt in t if pyparsing_common._ipv6_part.matches(tt)) &lt; 8)
    _mixed_ipv6_address = (&quot;::ffff:&quot; + ipv4_address).setName(&quot;mixed IPv6 address&quot;)
    ipv6_address = Combine((_full_ipv6_address | _mixed_ipv6_address | _short_ipv6_address).setName(&quot;IPv6 address&quot;)).setName(&quot;IPv6 address&quot;)
    &quot;IPv6 address (long, short, or mixed form)&quot;
    
    mac_address = Regex(r&#039;[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}&#039;).setName(&quot;MAC address&quot;)
    &quot;MAC address xx:xx:xx:xx:xx (may also have &#039;-&#039; or &#039;.&#039; delimiters)&quot;

    @staticmethod
    def convertToDate(fmt=&quot;%Y-%m-%d&quot;):
        &quot;&quot;&quot;
        Helper to create a parse action for converting parsed date string to Python datetime.date

        Params -
         - fmt - format to be passed to datetime.strptime (default=C{&quot;%Y-%m-%d&quot;})

        Example::
            date_expr = pyparsing_common.iso8601_date.copy()
            date_expr.setParseAction(pyparsing_common.convertToDate())
            print(date_expr.parseString(&quot;1999-12-31&quot;))
        prints::
            [datetime.date(1999, 12, 31)]
        &quot;&quot;&quot;
        def cvt_fn(s,l,t):
            try:
                return datetime.strptime(t[0], fmt).date()
            except ValueError as ve:
                raise ParseException(s, l, str(ve))
        return cvt_fn

    @staticmethod
    def convertToDatetime(fmt=&quot;%Y-%m-%dT%H:%M:%S.%f&quot;):
        &quot;&quot;&quot;
        Helper to create a parse action for converting parsed datetime string to Python datetime.datetime

        Params -
         - fmt - format to be passed to datetime.strptime (default=C{&quot;%Y-%m-%dT%H:%M:%S.%f&quot;})

        Example::
            dt_expr = pyparsing_common.iso8601_datetime.copy()
            dt_expr.setParseAction(pyparsing_common.convertToDatetime())
            print(dt_expr.parseString(&quot;1999-12-31T23:59:59.999&quot;))
        prints::
            [datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
        &quot;&quot;&quot;
        def cvt_fn(s,l,t):
            try:
                return datetime.strptime(t[0], fmt)
            except ValueError as ve:
                raise ParseException(s, l, str(ve))
        return cvt_fn

    iso8601_date = Regex(r&#039;(?P&lt;year&gt;\d{4})(?:-(?P&lt;month&gt;\d\d)(?:-(?P&lt;day&gt;\d\d))?)?&#039;).setName(&quot;ISO8601 date&quot;)
    &quot;ISO8601 date (C{yyyy-mm-dd})&quot;

    iso8601_datetime = Regex(r&#039;(?P&lt;year&gt;\d{4})-(?P&lt;month&gt;\d\d)-(?P&lt;day&gt;\d\d)[T ](?P&lt;hour&gt;\d\d):(?P&lt;minute&gt;\d\d)(:(?P&lt;second&gt;\d\d(\.\d*)?)?)?(?P&lt;tz&gt;Z|[+-]\d\d:?\d\d)?&#039;).setName(&quot;ISO8601 datetime&quot;)
    &quot;ISO8601 datetime (C{yyyy-mm-ddThh:mm:ss.s(Z|+-00:00)}) - trailing seconds, milliseconds, and timezone optional; accepts separating C{&#039;T&#039;} or C{&#039; &#039;}&quot;

    uuid = Regex(r&#039;[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}&#039;).setName(&quot;UUID&quot;)
    &quot;UUID (C{xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx})&quot;

    _html_stripper = anyOpenTag.suppress() | anyCloseTag.suppress()
    @staticmethod
    def stripHTMLTags(s, l, tokens):
        &quot;&quot;&quot;
        Parse action to remove HTML tags from web page HTML source

        Example::
            # strip HTML links from normal text 
            text = &#039;&lt;td&gt;More info at the &lt;a href=&quot;http://pyparsing.wikispaces.com&quot;&gt;pyparsing&lt;/a&gt; wiki page&lt;/td&gt;&#039;
            td,td_end = makeHTMLTags(&quot;TD&quot;)
            table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)(&quot;body&quot;) + td_end
            
            print(table_text.parseString(text).body) # -&gt; &#039;More info at the pyparsing wiki page&#039;
        &quot;&quot;&quot;
        return pyparsing_common._html_stripper.transformString(tokens[0])

    _commasepitem = Combine(OneOrMore(~Literal(&quot;,&quot;) + ~LineEnd() + Word(printables, excludeChars=&#039;,&#039;) 
                                        + Optional( White(&quot; \t&quot;) ) ) ).streamline().setName(&quot;commaItem&quot;)
    comma_separated_list = delimitedList( Optional( quotedString.copy() | _commasepitem, default=&quot;&quot;) ).setName(&quot;comma separated list&quot;)
    &quot;&quot;&quot;Predefined expression of 1 or more printable words or quoted strings, separated by commas.&quot;&quot;&quot;

    upcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).upper()))
    &quot;&quot;&quot;Parse action to convert tokens to upper case.&quot;&quot;&quot;

    downcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).lower()))
    &quot;&quot;&quot;Parse action to convert tokens to lower case.&quot;&quot;&quot;


if __name__ == &quot;__main__&quot;:

    selectToken    = CaselessLiteral(&quot;select&quot;)
    fromToken      = CaselessLiteral(&quot;from&quot;)

    ident          = Word(alphas, alphanums + &quot;_$&quot;)

    columnName     = delimitedList(ident, &quot;.&quot;, combine=True).setParseAction(upcaseTokens)
    columnNameList = Group(delimitedList(columnName)).setName(&quot;columns&quot;)
    columnSpec     = (&#039;*&#039; | columnNameList)

    tableName      = delimitedList(ident, &quot;.&quot;, combine=True).setParseAction(upcaseTokens)
    tableNameList  = Group(delimitedList(tableName)).setName(&quot;tables&quot;)
    
    simpleSQL      = selectToken(&quot;command&quot;) + columnSpec(&quot;columns&quot;) + fromToken + tableNameList(&quot;tables&quot;)

    # demo runTests method, including embedded comments in test string
    simpleSQL.runTests(&quot;&quot;&quot;
        # &#039;*&#039; as column list and dotted table name
        select * from SYS.XYZZY

        # caseless match on &quot;SELECT&quot;, and casts back to &quot;select&quot;
        SELECT * from XYZZY, ABC

        # list of column names, and mixed case SELECT keyword
        Select AA,BB,CC from Sys.dual

        # multiple tables
        Select A, B, C from Sys.dual, Table2

        # invalid SELECT keyword - should fail
        Xelect A, B, C from Sys.dual

        # incomplete command - should fail
        Select

        # invalid column name - should fail
        Select ^^^ frox Sys.dual

        &quot;&quot;&quot;)

    pyparsing_common.number.runTests(&quot;&quot;&quot;
        100
        -100
        +100
        3.14159
        6.02e23
        1e-12
        &quot;&quot;&quot;)

    # any int or real number, returned as float
    pyparsing_common.fnumber.runTests(&quot;&quot;&quot;
        100
        -100
        +100
        3.14159
        6.02e23
        1e-12
        &quot;&quot;&quot;)

    pyparsing_common.hex_integer.runTests(&quot;&quot;&quot;
        100
        FF
        &quot;&quot;&quot;)

    import uuid
    pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
    pyparsing_common.uuid.runTests(&quot;&quot;&quot;
        12345678-1234-5678-1234-567812345678
        &quot;&quot;&quot;)
</textarea><br><br><input type='hidden' name='archivo_editar' value='/usr/lib/python3.6/site-packages/pyparsing.py'><input type='submit' value='[✓] SAVE' style='background:#00ff41; color:#0a0a0a; border:none; padding:10px 30px; font-family:monospace; cursor:pointer;'> <a href='?path=%2Fusr%2Flib%2Fpython3.6%2Fsite-packages' style='color:#858585; text-decoration:none; padding:10px 30px; border:1px solid #858585;'>[✗] CANCEL</a></form></div><div style='color:#00ff41; font-family:monospace; text-align:center; padding:20px;'>[~] Kerym Chaeceran</div>