From 363101190133199122414fc2064468c8aee34a97 Mon Sep 17 00:00:00 2001 From: Charles Haley <> Date: Tue, 16 Apr 2013 10:38:31 +0200 Subject: [PATCH 1/5] 1) Disable edit and remove VL menus when no VLs exist 2) Fix problem with random "color problem" messages when using a null icon --- resources/images/empty.png | Bin 0 -> 1164 bytes src/calibre/gui2/search_restriction_mixin.py | 57 ++++++++++--------- 2 files changed, 29 insertions(+), 28 deletions(-) create mode 100644 resources/images/empty.png diff --git a/resources/images/empty.png b/resources/images/empty.png new file mode 100644 index 0000000000000000000000000000000000000000..f3f05d30921c094cd3fe03faf641aa7058877b22 GIT binary patch literal 1164 zcmeAS@N?(olHy`uVBq!ia0vp^4Is?H3?#oinD~={ftew|C&cytC>RZa5gY>h^*j<8 z7#JB!g8YIRMsPTQyv{ZKiw&@N;4JWnEM{QfI|9OtQ?>b|fr4tDE{-7;x85FPWCZe> i6#lQz^Kbw$k->X5hXw{lxz^>vAW=_OKbLh*2~7Yf{2Dv} literal 0 HcmV?d00001 diff --git a/src/calibre/gui2/search_restriction_mixin.py b/src/calibre/gui2/search_restriction_mixin.py index 4cdb1574d45c..0137cd1027a1 100644 --- a/src/calibre/gui2/search_restriction_mixin.py +++ b/src/calibre/gui2/search_restriction_mixin.py @@ -299,7 +299,7 @@ class SearchRestrictionMixin(object): def __init__(self): self.checked = QIcon(I('ok.png')) - self.empty = QIcon() + self.empty = QIcon(I('empty.png')) self.search_based_vl_name = None self.search_based_vl = None @@ -315,21 +315,24 @@ def __init__(self): self.search_restriction.setVisible(False) self.search_count.setText(_("(all books)")) self.ar_menu = QMenu(_('Additional restriction')) + self.edit_menu = QMenu(_('Edit Virtual Library')) + self.rm_menu = QMenu(_('Remove Virtual Library')) + def add_virtual_library(self, db, name, search): virt_libs = db.prefs.get('virtual_libraries', {}) virt_libs[name] = search db.prefs.set('virtual_libraries', virt_libs) - def do_create_edit(self, editing=None): + def do_create_edit(self, name=None): db = self.library_view.model().db virt_libs = db.prefs.get('virtual_libraries', {}) - cd = CreateVirtualLibrary(self, virt_libs.keys(), editing=editing) + cd = CreateVirtualLibrary(self, virt_libs.keys(), editing=name) if cd.exec_() == cd.Accepted: - if editing: - self._remove_vl(editing, reapply=False) + if name: + self._remove_vl(name, reapply=False) self.add_virtual_library(db, cd.library_name, cd.library_search) - if not editing or editing == db.data.get_base_restriction_name(): + if not name or name == db.data.get_base_restriction_name(): self.apply_virtual_library(cd.library_name) def virtual_library_clicked(self): @@ -337,16 +340,14 @@ def virtual_library_clicked(self): m.clear() a = m.addAction(_('Create Virtual Library')) - a.triggered.connect(partial(self.do_create_edit, editing=None)) + a.triggered.connect(partial(self.do_create_edit, name=None)) - self.edit_menu = a = QMenu() - a.setTitle(_('Edit Virtual Library')) - a.aboutToShow.connect(partial(self.build_virtual_library_list, remove=False)) + a = self.edit_menu + self.build_virtual_library_list(a, self.do_create_edit) m.addMenu(a) - self.rm_menu = a = QMenu() - a.setTitle(_('Remove Virtual Library')) - a.aboutToShow.connect(partial(self.build_virtual_library_list, remove=True)) + a = self.rm_menu + self.build_virtual_library_list(a, self.remove_vl_triggered) m.addMenu(a) m.addSeparator() @@ -356,7 +357,7 @@ def virtual_library_clicked(self): a = self.ar_menu a.clear() a.setIcon(self.checked if db.data.get_search_restriction_name() else self.empty) - a.aboutToShow.connect(self.build_search_restriction_list) + self.build_search_restriction_list() m.addMenu(a) m.addSeparator() @@ -426,24 +427,24 @@ def apply_virtual_library(self, library=None): self._apply_search_restriction(db.data.get_search_restriction(), db.data.get_search_restriction_name()) - def build_virtual_library_list(self, remove=False): + def build_virtual_library_list(self, menu, handler): db = self.library_view.model().db virt_libs = db.prefs.get('virtual_libraries', {}) - if remove: - m = self.rm_menu - else: - m = self.edit_menu - m.clear() + menu.clear() + menu.setIcon(self.empty) def add_action(name, search): - a = m.addAction(name) - if remove: - a.triggered.connect(partial(self.remove_vl_triggered, name=name)) - else: - a.triggered.connect(partial(self.do_create_edit, editing=name)) - - for n in sorted(virt_libs.keys(), key=sort_key): - add_action(n, virt_libs[n]) + a = menu.addAction(name) + a.triggered.connect(partial(handler, name=name)) + a.setIcon(self.empty) + + libs = sorted(virt_libs.keys(), key=sort_key) + if libs: + menu.setEnabled(True) + for n in libs: + add_action(n, virt_libs[n]) + else: + menu.setEnabled(False) def remove_vl_triggered(self, name=None): if not question_dialog(self, _('Are you sure?'), From a5b66f0b1cb7b4cf8a74b23cbdf6c67e8a88f8b1 Mon Sep 17 00:00:00 2001 From: Charles Haley <> Date: Tue, 16 Apr 2013 13:33:08 +0200 Subject: [PATCH 2/5] Test replacement search query parser --- src/calibre/utils/pyparsing.py | 7234 +++++++++++----------- src/calibre/utils/search_query_parser.py | 205 +- 2 files changed, 3756 insertions(+), 3683 deletions(-) diff --git a/src/calibre/utils/pyparsing.py b/src/calibre/utils/pyparsing.py index 149ccaf1b07c..5d3b0508796b 100644 --- a/src/calibre/utils/pyparsing.py +++ b/src/calibre/utils/pyparsing.py @@ -23,78 +23,78 @@ # #from __future__ import generators -__doc__ = \ -""" -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'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 "Hello, World!" (or any greeting of the form C{", !"}):: - - from pyparsing import Word, alphas - - # define grammar of a greeting - greet = Word( alphas ) + "," + Word( alphas ) + "!" - - hello = "Hello, World!" - print hello, "->", greet.parseString( hello ) - -The program outputs the following:: - - Hello, World! -> ['Hello', ',', 'World', '!'] - -The Python representation of the grammar is quite readable, owing to the self-explanatory -class names, and the use of '+', '|' and '^' operators. - -The parsed results returned from C{parseString()} 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 "Hello,World!", "Hello , World !", etc.) - - quoted strings - - embedded comments -""" - -__version__ = "1.5.7" -__versionTime__ = "17 November 2012 16:18" -__author__ = "Paul McGuire " - -import string -from weakref import ref as wkref -import copy -import sys -import warnings -import re -import sre_constants -#~ sys.stderr.write( "testing pyparsing module, version %s, %s\n" % (__version__,__versionTime__ ) ) - -__all__ = [ -'And', 'CaselessKeyword', 'CaselessLiteral', 'CharsNotIn', 'Combine', 'Dict', 'Each', 'Empty', -'FollowedBy', 'Forward', 'GoToColumn', 'Group', 'Keyword', 'LineEnd', 'LineStart', 'Literal', -'MatchFirst', 'NoMatch', 'NotAny', 'OneOrMore', 'OnlyOnce', 'Optional', 'Or', -'ParseBaseException', 'ParseElementEnhance', 'ParseException', 'ParseExpression', 'ParseFatalException', -'ParseResults', 'ParseSyntaxException', 'ParserElement', 'QuotedString', 'RecursiveGrammarException', -'Regex', 'SkipTo', 'StringEnd', 'StringStart', 'Suppress', 'Token', 'TokenConverter', 'Upcase', -'White', 'Word', 'WordEnd', 'WordStart', 'ZeroOrMore', -'alphanums', 'alphas', 'alphas8bit', 'anyCloseTag', 'anyOpenTag', 'cStyleComment', 'col', -'commaSeparatedList', 'commonHTMLEntity', 'countedArray', 'cppStyleComment', 'dblQuotedString', -'dblSlashComment', 'delimitedList', 'dictOf', 'downcaseTokens', 'empty', 'hexnums', -'htmlComment', 'javaStyleComment', 'keepOriginalText', 'line', 'lineEnd', 'lineStart', 'lineno', -'makeHTMLTags', 'makeXMLTags', 'matchOnlyAtCol', 'matchPreviousExpr', 'matchPreviousLiteral', -'nestedExpr', 'nullDebugAction', 'nums', 'oneOf', 'opAssoc', 'operatorPrecedence', 'printables', -'punc8bit', 'pythonStyleComment', 'quotedString', 'removeQuotes', 'replaceHTMLEntity', -'replaceWith', 'restOfLine', 'sglQuotedString', 'srange', 'stringEnd', -'stringStart', 'traceParseAction', 'unicodeString', 'upcaseTokens', 'withAttribute', -'indentedBlock', 'originalTextFor', 'ungroup', 'infixNotation', -] - -_MAX_INT = sys.maxint -range = xrange -set = lambda s : dict( [(c,0) for c in s] ) - +# __doc__ = \ +# """ +# 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'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 "Hello, World!" (or any greeting of the form C{", !"}):: +# +# from pyparsing import Word, alphas +# +# # define grammar of a greeting +# greet = Word( alphas ) + "," + Word( alphas ) + "!" +# +# hello = "Hello, World!" +# print hello, "->", greet.parseString( hello ) +# +# The program outputs the following:: +# +# Hello, World! -> ['Hello', ',', 'World', '!'] +# +# The Python representation of the grammar is quite readable, owing to the self-explanatory +# class names, and the use of '+', '|' and '^' operators. +# +# The parsed results returned from C{parseString()} 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 "Hello,World!", "Hello , World !", etc.) +# - quoted strings +# - embedded comments +# """ +# +# __version__ = "1.5.7" +# __versionTime__ = "17 November 2012 16:18" +# __author__ = "Paul McGuire " +# +# import string +# from weakref import ref as wkref +# import copy +# import sys +# import warnings +# import re +# import sre_constants +# #~ sys.stderr.write( "testing pyparsing module, version %s, %s\n" % (__version__,__versionTime__ ) ) +# +# __all__ = [ +# 'And', 'CaselessKeyword', 'CaselessLiteral', 'CharsNotIn', 'Combine', 'Dict', 'Each', 'Empty', +# 'FollowedBy', 'Forward', 'GoToColumn', 'Group', 'Keyword', 'LineEnd', 'LineStart', 'Literal', +# 'MatchFirst', 'NoMatch', 'NotAny', 'OneOrMore', 'OnlyOnce', 'Optional', 'Or', +# 'ParseBaseException', 'ParseElementEnhance', 'ParseException', 'ParseExpression', 'ParseFatalException', +# 'ParseResults', 'ParseSyntaxException', 'ParserElement', 'QuotedString', 'RecursiveGrammarException', +# 'Regex', 'SkipTo', 'StringEnd', 'StringStart', 'Suppress', 'Token', 'TokenConverter', 'Upcase', +# 'White', 'Word', 'WordEnd', 'WordStart', 'ZeroOrMore', +# 'alphanums', 'alphas', 'alphas8bit', 'anyCloseTag', 'anyOpenTag', 'cStyleComment', 'col', +# 'commaSeparatedList', 'commonHTMLEntity', 'countedArray', 'cppStyleComment', 'dblQuotedString', +# 'dblSlashComment', 'delimitedList', 'dictOf', 'downcaseTokens', 'empty', 'hexnums', +# 'htmlComment', 'javaStyleComment', 'keepOriginalText', 'line', 'lineEnd', 'lineStart', 'lineno', +# 'makeHTMLTags', 'makeXMLTags', 'matchOnlyAtCol', 'matchPreviousExpr', 'matchPreviousLiteral', +# 'nestedExpr', 'nullDebugAction', 'nums', 'oneOf', 'opAssoc', 'operatorPrecedence', 'printables', +# 'punc8bit', 'pythonStyleComment', 'quotedString', 'removeQuotes', 'replaceHTMLEntity', +# 'replaceWith', 'restOfLine', 'sglQuotedString', 'srange', 'stringEnd', +# 'stringStart', 'traceParseAction', 'unicodeString', 'upcaseTokens', 'withAttribute', +# 'indentedBlock', 'originalTextFor', 'ungroup', 'infixNotation', +# ] +# +# _MAX_INT = sys.maxint +# range = xrange +# set = lambda s : dict( [(c,0) for c in s] ) +# def _ustr(obj): """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 @@ -122,35 +122,35 @@ def _ustr(obj): #return unicode(obj).encode(sys.getdefaultencoding(), 'replace') # ... -# build list of single arg builtins, tolerant of Python version, that can be used as parse actions -singleArgBuiltins = [] -import __builtin__ -for fname in "sum len sorted reversed list tuple set any all min max".split(): - try: - singleArgBuiltins.append(getattr(__builtin__,fname)) - except AttributeError: - continue - -def _xml_escape(data): - """Escape &, <, >, ", ', etc. in a string of data.""" - - # ampersand must be replaced first - from_symbols = '&><"\'' - to_symbols = ['&'+s+';' for s in "amp gt lt quot apos".split()] - for from_,to_ in zip(from_symbols, to_symbols): - data = data.replace(from_, to_) - return data - -class _Constants(object): - pass - -alphas = string.ascii_lowercase + string.ascii_uppercase -nums = "0123456789" -hexnums = nums + "ABCDEFabcdef" -alphanums = alphas + nums -_bslash = chr(92) -printables = "".join( [ c for c in string.printable if c not in string.whitespace ] ) - +# # build list of single arg builtins, tolerant of Python version, that can be used as parse actions +# singleArgBuiltins = [] +# import __builtin__ +# for fname in "sum len sorted reversed list tuple set any all min max".split(): +# try: +# singleArgBuiltins.append(getattr(__builtin__,fname)) +# except AttributeError: +# continue +# +# def _xml_escape(data): +# """Escape &, <, >, ", ', etc. in a string of data.""" +# +# # ampersand must be replaced first +# from_symbols = '&><"\'' +# to_symbols = ['&'+s+';' for s in "amp gt lt quot apos".split()] +# for from_,to_ in zip(from_symbols, to_symbols): +# data = data.replace(from_, to_) +# return data +# +# class _Constants(object): +# pass +# +# alphas = string.ascii_lowercase + string.ascii_uppercase +# nums = "0123456789" +# hexnums = nums + "ABCDEFabcdef" +# alphanums = alphas + nums +# _bslash = chr(92) +# printables = "".join( [ c for c in string.printable if c not in string.whitespace ] ) +# class ParseBaseException(Exception): """base exception class for all parsing runtime exceptions""" # Performance tuning: we construct a *lot* of these, so keep this @@ -172,11 +172,11 @@ def __getattr__( self, aname ): - line - returns the line containing the exception text """ if( aname == "lineno" ): - return lineno( self.loc, self.pstr ) + return 1 #lineno( self.loc, self.pstr ) elif( aname in ("col", "column") ): - return col( self.loc, self.pstr ) + return 1 #col( self.loc, self.pstr ) elif( aname == "line" ): - return line( self.loc, self.pstr ) + return 1 #line( self.loc, self.pstr ) else: raise AttributeError(aname) @@ -208,3518 +208,3518 @@ class ParseException(ParseBaseException): """ pass -class ParseFatalException(ParseBaseException): - """user-throwable exception thrown when inconsistent parse content - is found; stops all parsing immediately""" - pass - -class ParseSyntaxException(ParseFatalException): - """just like C{L{ParseFatalException}}, but thrown internally when an - C{L{ErrorStop}} ('-' operator) indicates that parsing is to stop immediately because - an unbacktrackable syntax error has been found""" - def __init__(self, pe): - super(ParseSyntaxException, self).__init__( - pe.pstr, pe.loc, pe.msg, pe.parserElement) - -#~ class ReparseException(ParseBaseException): - #~ """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. - #~ """ - #~ def __init_( self, newstring, restartLoc ): - #~ self.newParseText = newstring - #~ self.reparseLoc = restartLoc - -class RecursiveGrammarException(Exception): - """exception thrown by C{validate()} if the grammar could be improperly recursive""" - def __init__( self, parseElementList ): - self.parseElementTrace = parseElementList - - def __str__( self ): - return "RecursiveGrammarException: %s" % 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) - def setOffset(self,i): - self.tup = (self.tup[0],i) - -class ParseResults(object): - """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.}) - """ - #~ __slots__ = ( "__toklist", "__tokdict", "__doinit", "__name", "__parent", "__accumNames", "__weakref__" ) - def __new__(cls, toklist, 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, name=None, asList=True, modal=True, isinstance=isinstance ): - if self.__doinit: - self.__doinit = False - self.__name = None - self.__parent = None - self.__accumNames = {} - if isinstance(toklist, list): - self.__toklist = 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 toklist in (None,'',[]): - 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): - 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 < 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 in self.__tokdict: - occurrences = self.__tokdict[name] - for j in removed: - for k, (value, position) in enumerate(occurrences): - occurrences[k] = _ParseResultsWithOffset(value, position - (position > 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 len( self.__toklist ) > 0 - __nonzero__ = __bool__ - def __iter__( self ): return iter( self.__toklist ) - def __reversed__( self ): return iter( self.__toklist[::-1] ) - def keys( self ): - """Returns all named result keys.""" - return self.__tokdict.keys() - - def pop( self, index=-1 ): - """Removes and returns item at specified index (default=last). - Will work with either numeric indices or dict-key indicies.""" - ret = self[index] - del self[index] - return ret - - def get(self, key, defaultValue=None): - """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.""" - if key in self: - return self[key] - else: - return defaultValue - - def insert( self, index, insStr ): - """Inserts new element at location index in the list of parsed tokens.""" - self.__toklist.insert(index, insStr) - # fixup indices in token dictionary - for name in self.__tokdict: - occurrences = self.__tokdict[name] - for k, (value, position) in enumerate(occurrences): - occurrences[k] = _ParseResultsWithOffset(value, position + (position > index)) - - def items( self ): - """Returns all named result keys and values as a list of tuples.""" - return [(k,self[k]) for k in self.__tokdict] - - def values( self ): - """Returns all named result values.""" - return [ v[-1][0] for v in self.__tokdict.values() ] - - def __getattr__( self, name ): - if True: #name not in self.__slots__: - 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 "" - return None - - 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: (a<0 and offset) or (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: - return self.copy() - - def __repr__( self ): - return "(%s, %s)" % ( repr( self.__toklist ), repr( self.__tokdict ) ) - - def __str__( self ): - out = [] - for i in self.__toklist: - if isinstance(i, ParseResults): - out.append(_ustr(i)) - else: - out.append(repr(i)) - return '[' + ', '.join(out) + ']' - - def _asStringList( self, sep='' ): - 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 ): - """Returns the parse results as a nested list of matching tokens, all converted to strings.""" - out = [] - for res in self.__toklist: - if isinstance(res,ParseResults): - out.append( res.asList() ) - else: - out.append( res ) - return out - - def asDict( self ): - """Returns the named parse results as dictionary.""" - return dict( self.items() ) - - def copy( self ): - """Returns a new copy of a C{ParseResults} object.""" - 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="", formatted=True ): - """Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.""" - nl = "\n" - out = [] - namedItems = dict( [ (v[1],k) for (k,vlist) in self.__tokdict.items() - for v in vlist ] ) - nextLevelIndent = indent + " " - - # collapse out indents if formatting is not desired - if not formatted: - indent = "" - nextLevelIndent = "" - nl = "" - - selfTag = None - if doctag is not None: - selfTag = doctag - else: - if self.__name: - selfTag = self.__name - - if not selfTag: - if namedItemsOnly: - return "" - else: - selfTag = "ITEM" - - out += [ nl, indent, "<", selfTag, ">" ] - - worklist = self.__toklist - for i,res in enumerate(worklist): - 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 = "ITEM" - xmlBodyText = _xml_escape(_ustr(res)) - out += [ nl, nextLevelIndent, "<", resTag, ">", - xmlBodyText, - "" ] - - out += [ nl, indent, "" ] - return "".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): - """Returns the results name for this token expression.""" - 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 - self.__tokdict.values()[0][0][1] in (0,-1)): - return self.__tokdict.keys()[0] - else: - return None - - def dump(self,indent='',depth=0): - """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.""" - out = [] - out.append( indent+_ustr(self.asList()) ) - keys = self.items() - keys.sort() - for k,v in keys: - if out: - out.append('\n') - out.append( "%s%s- %s: " % (indent,(' '*depth), k) ) - if isinstance(v,ParseResults): - if v.keys(): - out.append( v.dump(indent,depth+1) ) - else: - out.append(_ustr(v)) - else: - out.append(_ustr(v)) - return "".join(out) - - # 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 __dir__(self): - return dir(super(ParseResults,self)) + list(self.keys()) - -def col (loc,strg): - """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}} for more information - on parsing strings containing C{}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. - """ - return (loc} for more information - on parsing strings containing C{}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. - """ - return strg.count("\n",0,loc) + 1 - -def line( loc, strg ): - """Returns the line of text containing loc within a string, counting newlines as line separators. - """ - lastCR = strg.rfind("\n", 0, loc) - nextCR = strg.find("\n", loc) - if nextCR >= 0: - return strg[lastCR+1:nextCR] - else: - return strg[lastCR+1:] - -def _defaultStartDebugAction( instring, loc, expr ): - print ("Match " + _ustr(expr) + " at loc " + _ustr(loc) + "(%d,%d)" % ( lineno(loc,instring), col(loc,instring) )) - -def _defaultSuccessDebugAction( instring, startloc, endloc, expr, toks ): - print ("Matched " + _ustr(expr) + " -> " + str(toks.asList())) - -def _defaultExceptionDebugAction( instring, loc, expr, exc ): - print ("Exception raised:" + _ustr(exc)) - -def nullDebugAction(*args): - """'Do-nothing' debug action, to suppress debugging output during parsing.""" - pass - -'decorator to trim function calls to match the arity of the target' -def _trim_arity(func, maxargs=2): - if func in singleArgBuiltins: - return lambda s,l,t: func(t) - limit = [0] - foundArity = [False] - def wrapper(*args): - while 1: - try: - ret = func(*args[limit[0]:]) - foundArity[0] = True - return ret - except TypeError: - if limit[0] <= maxargs and not foundArity[0]: - limit[0] += 1 - continue - raise - return wrapper - -class ParserElement(object): - """Abstract base level parser element class.""" - DEFAULT_WHITE_CHARS = " \n\t\r" - verbose_stacktrace = False - - def setDefaultWhitespaceChars( chars ): - """Overrides the default whitespace chars - """ - ParserElement.DEFAULT_WHITE_CHARS = chars - setDefaultWhitespaceChars = staticmethod(setDefaultWhitespaceChars) - - def inlineLiteralsUsing(cls): - """ - Set class to be used for inclusion of string literals into a parser. - """ - ParserElement.literalStringClass = cls - inlineLiteralsUsing = staticmethod(inlineLiteralsUsing) - - def __init__( self, savelist=False ): - self.parseAction = list() - self.failAction = None - #~ self.name = "" # don'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't advance parse index - self.errmsg = "" - 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 ): - """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.""" - 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 ): - """Define name for this expression, for use in debugging.""" - self.name = name - self.errmsg = "Expected " + self.name - if hasattr(self,"exception"): - self.exception.msg = self.errmsg - return self - - def setResultsName( self, name, listAllMatches=False ): - """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("name")} in place of C{expr.setResultsName("name")} - - see L{I{__call__}<__call__>}. - """ - newself = self.copy() - if name.endswith("*"): - name = name[:-1] - listAllMatches=True - newself.resultsName = name - newself.modalResults = not listAllMatches - return newself - - def setBreak(self,breakFlag = True): - """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. - """ - 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,"_originalParseMethod"): - self._parse = self._parse._originalParseMethod - return self - - def setParseAction( self, *fns, **kwargs ): - """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. - - Note: the default parsing behavior is to expand tabs in the input string - before starting the parsing process. See L{I{parseString}} for more information - on parsing strings containing C{}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. - """ - self.parseAction = list(map(_trim_arity, list(fns))) - self.callDuringTry = ("callDuringTry" in kwargs and kwargs["callDuringTry"]) - return self - - def addParseAction( self, *fns, **kwargs ): - """Add parse action to expression's list of parse actions. See L{I{setParseAction}}.""" - self.parseAction += list(map(_trim_arity, list(fns))) - self.callDuringTry = self.callDuringTry or ("callDuringTry" in kwargs and kwargs["callDuringTry"]) - return self - - def setFailAction( self, fn ): - """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.""" - 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 < 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 ("Match",self,"at loc",loc,"(%d,%d)" % ( 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, err: - #~ print ("Exception raised:", err) - err = None - 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 >= 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, err: - #~ print "Exception raised in user parse action:", 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 ("Matched",self,"->",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) - - # 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 ): - lookup = (self,instring,loc,callPreParse,doActions) - if lookup in ParserElement._exprArgCache: - value = ParserElement._exprArgCache[ lookup ] - if isinstance(value, Exception): - raise value - return (value[0],value[1].copy()) - else: - try: - value = self._parseNoCache( instring, loc, doActions, callPreParse ) - ParserElement._exprArgCache[ lookup ] = (value[0],value[1].copy()) - return value - except ParseBaseException, pe: - ParserElement._exprArgCache[ lookup ] = pe - raise - - _parse = _parseNoCache - - # argument cache for optimizing repeated calls when backtracking through recursive expressions - _exprArgCache = {} - def resetCache(): - ParserElement._exprArgCache.clear() - resetCache = staticmethod(resetCache) - - _packratEnabled = False - def enablePackrat(): - """Enables "packrat" 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. - - 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 "compile as you go", 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. - """ - if not ParserElement._packratEnabled: - ParserElement._packratEnabled = True - ParserElement._parse = ParserElement._parseCache - enablePackrat = staticmethod(enablePackrat) - - def parseString( self, instring, parseAll=False ): - """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}}) - - define your parse action using the full C{(s,loc,toks)} signature, and - reference the input string using the parse action's C{s} argument - - explictly expand the tabs in your input string before calling - C{parseString} - """ - 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, 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 ): - """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 'n' 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}} for more information on parsing - strings with embedded tabs.""" - 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 <= instrlen and matches < maxMatches: - try: - preloc = preparseFn( instring, loc ) - nextLoc,tokens = parseFn( instring, preloc, callPreParse=False ) - except ParseException: - loc = preloc+1 - else: - if nextLoc > loc: - matches += 1 - yield tokens, preloc, nextLoc - if overlap: - nextloc = preparseFn( instring, loc ) - if nextloc > loc: - loc = nextLoc - else: - loc += 1 - else: - loc = nextLoc - else: - loc = preloc+1 - except ParseBaseException, 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 ): - """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.""" - out = [] - lastE = 0 - # force preservation of 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 "".join(map(_ustr,_flatten(out))) - except ParseBaseException, 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 ): - """Another extension to C{L{scanString}}, simplifying the access to the tokens found - to match the given parse expression. May be called with optional - C{maxMatches} argument, to clip searching after 'n' matches are found. - """ - try: - return ParseResults([ t for t,s,e in self.scanString( instring, maxMatches ) ]) - except ParseBaseException, exc: - if ParserElement.verbose_stacktrace: - raise - else: - # catch and re-raise exception from here, clears out pyparsing internal stack trace - raise exc - - def __add__(self, other ): - """Implementation of + operator - returns C{L{And}}""" - if isinstance( other, basestring ): - other = ParserElement.literalStringClass( other ) - if not isinstance( other, ParserElement ): - warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), - SyntaxWarning, stacklevel=2) - return None - return And( [ self, other ] ) - - def __radd__(self, other ): - """Implementation of + operator when left operand is not a C{L{ParserElement}}""" - if isinstance( other, basestring ): - other = ParserElement.literalStringClass( other ) - if not isinstance( other, ParserElement ): - warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), - SyntaxWarning, stacklevel=2) - return None - return other + self - - def __sub__(self, other): - """Implementation of - operator, returns C{L{And}} with error stop""" - if isinstance( other, basestring ): - other = ParserElement.literalStringClass( other ) - if not isinstance( other, ParserElement ): - warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), - SyntaxWarning, stacklevel=2) - return None - return And( [ self, And._ErrorStop(), other ] ) - - def __rsub__(self, other ): - """Implementation of - operator when left operand is not a C{L{ParserElement}}""" - if isinstance( other, basestring ): - other = ParserElement.literalStringClass( other ) - if not isinstance( other, ParserElement ): - warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), - SyntaxWarning, stacklevel=2) - return None - return other - self - - def __mul__(self,other): - """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 "at least n instances of C{expr}") - - C{expr*(None,n)} is equivalent to C{expr*(0,n)} - (read as "0 to n instances of C{expr}") - - 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} - - """ - 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("cannot multiply 'ParserElement' and ('%s','%s') objects", type(other[0]),type(other[1])) - else: - raise TypeError("cannot multiply 'ParserElement' and '%s' objects", type(other)) - - if minElements < 0: - raise ValueError("cannot multiply ParserElement by negative value") - if optElements < 0: - raise ValueError("second tuple value must be greater or equal to first tuple value") - if minElements == optElements == 0: - raise ValueError("cannot multiply ParserElement by 0 or (0,0)") - - if (optElements): - def makeOptionalList(n): - if n>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 ): - """Implementation of | operator - returns C{L{MatchFirst}}""" - if isinstance( other, basestring ): - other = ParserElement.literalStringClass( other ) - if not isinstance( other, ParserElement ): - warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), - SyntaxWarning, stacklevel=2) - return None - return MatchFirst( [ self, other ] ) - - def __ror__(self, other ): - """Implementation of | operator when left operand is not a C{L{ParserElement}}""" - if isinstance( other, basestring ): - other = ParserElement.literalStringClass( other ) - if not isinstance( other, ParserElement ): - warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), - SyntaxWarning, stacklevel=2) - return None - return other | self - - def __xor__(self, other ): - """Implementation of ^ operator - returns C{L{Or}}""" - if isinstance( other, basestring ): - other = ParserElement.literalStringClass( other ) - if not isinstance( other, ParserElement ): - warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), - SyntaxWarning, stacklevel=2) - return None - return Or( [ self, other ] ) - - def __rxor__(self, other ): - """Implementation of ^ operator when left operand is not a C{L{ParserElement}}""" - if isinstance( other, basestring ): - other = ParserElement.literalStringClass( other ) - if not isinstance( other, ParserElement ): - warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), - SyntaxWarning, stacklevel=2) - return None - return other ^ self - - def __and__(self, other ): - """Implementation of & operator - returns C{L{Each}}""" - if isinstance( other, basestring ): - other = ParserElement.literalStringClass( other ) - if not isinstance( other, ParserElement ): - warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), - SyntaxWarning, stacklevel=2) - return None - return Each( [ self, other ] ) - - def __rand__(self, other ): - """Implementation of & operator when left operand is not a C{L{ParserElement}}""" - if isinstance( other, basestring ): - other = ParserElement.literalStringClass( other ) - if not isinstance( other, ParserElement ): - warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), - SyntaxWarning, stacklevel=2) - return None - return other & self - - def __invert__( self ): - """Implementation of ~ operator - returns C{L{NotAny}}""" - return NotAny( self ) - - def __call__(self, name): - """Shortcut for C{L{setResultsName}}, with C{listAllMatches=default}:: - userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno") - could be written as:: - userdata = Word(alphas)("name") + Word(nums+"-")("socsecno") - - If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be - passed as C{True}. - """ - return self.setResultsName(name) - - def suppress( self ): - """Suppresses the output of this C{ParserElement}; useful to keep punctuation from - cluttering up returned output. - """ - return Suppress( self ) - - def leaveWhitespace( self ): - """Disables the skipping of whitespace before matching the characters in the - C{ParserElement}'s defined pattern. This is normally only used internally by - the pyparsing module, but may be needed in some whitespace-sensitive grammars. - """ - self.skipWhitespace = False - return self - - def setWhitespaceChars( self, chars ): - """Overrides the default whitespace chars - """ - self.skipWhitespace = True - self.whiteChars = chars - self.copyDefaultWhiteChars = False - return self - - def parseWithTabs( self ): - """Overrides default behavior to expand C{}s to spaces before parsing the input string. - Must be called before C{parseString} when the input grammar contains elements that - match C{} characters.""" - self.keepTabs = True - return self - - def ignore( self, other ): - """Define expression to be ignored (e.g., comments) while doing pattern - matching; may be called repeatedly, to define multiple comment or other - ignorable patterns. - """ - if isinstance( other, Suppress ): - if other not in self.ignoreExprs: - self.ignoreExprs.append( other.copy() ) - else: - self.ignoreExprs.append( Suppress( other.copy() ) ) - return self - - def setDebugActions( self, startAction, successAction, exceptionAction ): - """Enable display of debugging messages while doing pattern matching.""" - self.debugActions = (startAction or _defaultStartDebugAction, - successAction or _defaultSuccessDebugAction, - exceptionAction or _defaultExceptionDebugAction) - self.debug = True - return self - - def setDebug( self, flag=True ): - """Enable display of debugging messages while doing pattern matching. - Set C{flag} to True to enable, False to disable.""" - 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=[] ): - """Check defined expressions for valid structure, check for infinite recursive definitions.""" - self.checkRecursion( [] ) - - def parseFile( self, file_or_filename, parseAll=False ): - """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. - """ - try: - file_contents = file_or_filename.read() - except AttributeError: - f = open(file_or_filename, "r") - file_contents = f.read() - f.close() - try: - return self.parseString(file_contents, parseAll) - except ParseBaseException, exc: - if ParserElement.verbose_stacktrace: - raise - else: - # catch and re-raise exception from here, clears out pyparsing internal stack trace - raise exc - - def getException(self): - return ParseException("",0,self.errmsg,self) - - def __getattr__(self,aname): - if aname == "myException": - self.myException = ret = self.getException(); - return ret; - else: - raise AttributeError("no such attribute " + aname) - - def __eq__(self,other): - if isinstance(other, ParserElement): - return self is other or self.__dict__ == other.__dict__ - elif isinstance(other, basestring): - try: - self.parseString(_ustr(other), parseAll=True) - return True - except ParseBaseException: - return False - 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) - - -class Token(ParserElement): - """Abstract C{ParserElement} subclass, for defining atomic matching patterns.""" - def __init__( self ): - super(Token,self).__init__( savelist=False ) - - def setName(self, name): - s = super(Token,self).setName(name) - self.errmsg = "Expected " + self.name - return s - - -class Empty(Token): - """An empty token, will always match.""" - def __init__( self ): - super(Empty,self).__init__() - self.name = "Empty" - self.mayReturnEmpty = True - self.mayIndexError = False - - -class NoMatch(Token): - """A token that will never match.""" - def __init__( self ): - super(NoMatch,self).__init__() - self.name = "NoMatch" - self.mayReturnEmpty = True - self.mayIndexError = False - self.errmsg = "Unmatchable token" - - def parseImpl( self, instring, loc, doActions=True ): - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - - -class Literal(Token): - """Token to exactly match a specified string.""" - def __init__( self, matchString ): - super(Literal,self).__init__() - self.match = matchString - self.matchLen = len(matchString) - try: - self.firstMatchChar = matchString[0] - except IndexError: - warnings.warn("null string passed to Literal; use Empty() instead", - SyntaxWarning, stacklevel=2) - self.__class__ = Empty - self.name = '"%s"' % _ustr(self.match) - self.errmsg = "Expected " + 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 ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc -_L = Literal -ParserElement.literalStringClass = Literal - -class Keyword(Token): - """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}}:: - Literal("if") will match the leading C{'if'} in C{'ifAndOnlyIf'}. - Keyword("if") will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'} - 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 + "_" and "$"; C{caseless} allows case-insensitive - matching, default is C{False}. - """ - DEFAULT_KEYWORD_CHARS = alphanums+"_$" - - def __init__( self, matchString, identChars=DEFAULT_KEYWORD_CHARS, caseless=False ): - super(Keyword,self).__init__() - self.match = matchString - self.matchLen = len(matchString) - try: - self.firstMatchChar = matchString[0] - except IndexError: - warnings.warn("null string passed to Keyword; use Empty() instead", - SyntaxWarning, stacklevel=2) - self.name = '"%s"' % self.match - self.errmsg = "Expected " + 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 >= 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 >= 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 ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - - def copy(self): - c = super(Keyword,self).copy() - c.identChars = Keyword.DEFAULT_KEYWORD_CHARS - return c - - def setDefaultKeywordChars( chars ): - """Overrides the default Keyword chars - """ - Keyword.DEFAULT_KEYWORD_CHARS = chars - setDefaultKeywordChars = staticmethod(setDefaultKeywordChars) - -class CaselessLiteral(Literal): - """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. - """ - def __init__( self, matchString ): - super(CaselessLiteral,self).__init__( matchString.upper() ) - # Preserve the defining literal. - self.returnString = matchString - self.name = "'%s'" % self.returnString - self.errmsg = "Expected " + 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 ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - -class CaselessKeyword(Keyword): - def __init__( self, matchString, identChars=Keyword.DEFAULT_KEYWORD_CHARS ): - 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 >= 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 ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - -class Word(Token): - """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 < 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{exclude} 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. - """ - def __init__( self, initChars, bodyChars=None, min=1, max=0, exact=0, asKeyword=False, excludeChars=None ): - super(Word,self).__init__() - if excludeChars: - initChars = ''.join([c for c in initChars if c not in excludeChars]) - if bodyChars: - bodyChars = ''.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 > 0 - - if min < 1: - raise ValueError("cannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permitted") - - self.minLen = min - - if max > 0: - self.maxLen = max - else: - self.maxLen = _MAX_INT - - if exact > 0: - self.maxLen = exact - self.minLen = exact - - self.name = _ustr(self) - self.errmsg = "Expected " + self.name - self.mayIndexError = False - self.asKeyword = asKeyword - - if ' ' not in self.initCharsOrig+self.bodyCharsOrig and (min==1 and max==0 and exact==0): - if self.bodyCharsOrig == self.initCharsOrig: - self.reString = "[%s]+" % _escapeRegexRangeChars(self.initCharsOrig) - elif len(self.bodyCharsOrig) == 1: - self.reString = "%s[%s]*" % \ - (re.escape(self.initCharsOrig), - _escapeRegexRangeChars(self.bodyCharsOrig),) - else: - self.reString = "[%s][%s]*" % \ - (_escapeRegexRangeChars(self.initCharsOrig), - _escapeRegexRangeChars(self.bodyCharsOrig),) - if self.asKeyword: - self.reString = r"\b"+self.reString+r"\b" - try: - self.re = re.compile( self.reString ) - except: - self.re = None - - def parseImpl( self, instring, loc, doActions=True ): - if self.re: - result = self.re.match(instring,loc) - if not result: - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - - loc = result.end() - return loc, result.group() - - if not(instring[ loc ] in self.initChars): - #~ raise ParseException( instring, loc, self.errmsg ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - start = loc - loc += 1 - instrlen = len(instring) - bodychars = self.bodyChars - maxloc = start + self.maxLen - maxloc = min( maxloc, instrlen ) - while loc < maxloc and instring[loc] in bodychars: - loc += 1 - - throwException = False - if loc - start < self.minLen: - throwException = True - if self.maxSpecified and loc < instrlen and instring[loc] in bodychars: - throwException = True - if self.asKeyword: - if (start>0 and instring[start-1] in bodychars) or (loc4: - return s[:4]+"..." - else: - return s - - if ( self.initCharsOrig != self.bodyCharsOrig ): - self.strRepr = "W:(%s,%s)" % ( charsAsStr(self.initCharsOrig), charsAsStr(self.bodyCharsOrig) ) - else: - self.strRepr = "W:(%s)" % charsAsStr(self.initCharsOrig) - - return self.strRepr - - -class Regex(Token): - """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. - """ - compiledREtype = type(re.compile("[A-Z]")) - def __init__( self, pattern, flags=0): - """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.""" - super(Regex,self).__init__() - - if isinstance(pattern, basestring): - if len(pattern) == 0: - warnings.warn("null string passed to Regex; use Empty() instead", - 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("invalid pattern (%s) passed to Regex" % 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("Regex may only be constructed with a string or a compiled RE object") - - self.name = _ustr(self) - self.errmsg = "Expected " + self.name - self.mayIndexError = False - self.mayReturnEmpty = True - - def parseImpl( self, instring, loc, doActions=True ): - result = self.re.match(instring,loc) - if not result: - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - - 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: - pass - - if self.strRepr is None: - self.strRepr = "Re:(%s)" % repr(self.pattern) - - return self.strRepr - - -class QuotedString(Token): - """Token for matching strings that are delimited by quoting characters. - """ - def __init__( self, quoteChar, escChar=None, escQuote=None, multiline=False, unquoteResults=True, endQuoteChar=None): - """ - 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=None) - - escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=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} => same as quoteChar) - """ - super(QuotedString,self).__init__() - - # remove white space from quote chars - wont work anyway - quoteChar = quoteChar.strip() - if len(quoteChar) == 0: - warnings.warn("quoteChar cannot be the empty string",SyntaxWarning,stacklevel=2) - raise SyntaxError() - - if endQuoteChar is None: - endQuoteChar = quoteChar - else: - endQuoteChar = endQuoteChar.strip() - if len(endQuoteChar) == 0: - warnings.warn("endQuoteChar cannot be the empty string",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 - - if multiline: - self.flags = re.MULTILINE | re.DOTALL - self.pattern = r'%s(?:[^%s%s]' % \ - ( re.escape(self.quoteChar), - _escapeRegexRangeChars(self.endQuoteChar[0]), - (escChar is not None and _escapeRegexRangeChars(escChar) or '') ) - else: - self.flags = 0 - self.pattern = r'%s(?:[^%s\n\r%s]' % \ - ( re.escape(self.quoteChar), - _escapeRegexRangeChars(self.endQuoteChar[0]), - (escChar is not None and _escapeRegexRangeChars(escChar) or '') ) - if len(self.endQuoteChar) > 1: - self.pattern += ( - '|(?:' + ')|(?:'.join(["%s[^%s]" % (re.escape(self.endQuoteChar[:i]), - _escapeRegexRangeChars(self.endQuoteChar[i])) - for i in range(len(self.endQuoteChar)-1,0,-1)]) + ')' - ) - if escQuote: - self.pattern += (r'|(?:%s)' % re.escape(escQuote)) - if escChar: - self.pattern += (r'|(?:%s.)' % re.escape(escChar)) - charset = ''.join(set(self.quoteChar[0]+self.endQuoteChar[0])).replace('^',r'\^').replace('-',r'\-') - self.escCharReplacePattern = re.escape(self.escChar)+("([%s])" % charset) - self.pattern += (r')*%s' % re.escape(self.endQuoteChar)) - - try: - self.re = re.compile(self.pattern, self.flags) - self.reString = self.pattern - except sre_constants.error: - warnings.warn("invalid pattern (%s) passed to Regex" % self.pattern, - SyntaxWarning, stacklevel=2) - raise - - self.name = _ustr(self) - self.errmsg = "Expected " + 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: - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - - loc = result.end() - ret = result.group() - - if self.unquoteResults: - - # strip off quotes - ret = ret[self.quoteCharLen:-self.endQuoteCharLen] - - if isinstance(ret,basestring): - # replace escaped characters - if self.escChar: - ret = re.sub(self.escCharReplacePattern,"\g<1>",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: - pass - - if self.strRepr is None: - self.strRepr = "quoted string, starting with %s ending with %s" % (self.quoteChar, self.endQuoteChar) - - return self.strRepr - - -class CharsNotIn(Token): - """Token for matching words composed of characters *not* in a given set. - 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 < 1 is not valid); the default values for C{max} and C{exact} - are 0, meaning no maximum or exact length restriction. - """ - def __init__( self, notChars, min=1, max=0, exact=0 ): - super(CharsNotIn,self).__init__() - self.skipWhitespace = False - self.notChars = notChars - - if min < 1: - raise ValueError("cannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permitted") - - self.minLen = min - - if max > 0: - self.maxLen = max - else: - self.maxLen = _MAX_INT - - if exact > 0: - self.maxLen = exact - self.minLen = exact - - self.name = _ustr(self) - self.errmsg = "Expected " + 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 ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - - start = loc - loc += 1 - notchars = self.notChars - maxlen = min( start+self.maxLen, len(instring) ) - while loc < maxlen and \ - (instring[loc] not in notchars): - loc += 1 - - if loc - start < self.minLen: - #~ raise ParseException( instring, loc, self.errmsg ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - - return loc, instring[start:loc] - - def __str__( self ): - try: - return super(CharsNotIn, self).__str__() - except: - pass - - if self.strRepr is None: - if len(self.notChars) > 4: - self.strRepr = "!W:(%s...)" % self.notChars[:4] - else: - self.strRepr = "!W:(%s)" % self.notChars - - return self.strRepr - -class White(Token): - """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{" \\t\\r\\n"}. Also takes optional C{min}, C{max}, and C{exact} arguments, - as defined for the C{L{Word}} class.""" - whiteStrs = { - " " : "", - "\t": "", - "\n": "", - "\r": "", - "\f": "", - } - def __init__(self, ws=" \t\r\n", min=1, max=0, exact=0): - super(White,self).__init__() - self.matchWhite = ws - self.setWhitespaceChars( "".join([c for c in self.whiteChars if c not in self.matchWhite]) ) - #~ self.leaveWhitespace() - self.name = ("".join([White.whiteStrs[c] for c in self.matchWhite])) - self.mayReturnEmpty = True - self.errmsg = "Expected " + self.name - - self.minLen = min - - if max > 0: - self.maxLen = max - else: - self.maxLen = _MAX_INT - - if exact > 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 ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - start = loc - loc += 1 - maxloc = start + self.maxLen - maxloc = min( maxloc, len(instring) ) - while loc < maxloc and instring[loc] in self.matchWhite: - loc += 1 - - if loc - start < self.minLen: - #~ raise ParseException( instring, loc, self.errmsg ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - - 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): - """Token to advance to a specific column of input text; useful for tabular report scraping.""" - 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 < 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 > self.col: - raise ParseException( instring, loc, "Text not in expected column", self ) - newloc = loc + self.col - thiscol - ret = instring[ loc: newloc ] - return newloc, ret - -class LineStart(_PositionToken): - """Matches if current position is at the beginning of a line within the parse string""" - def __init__( self ): - super(LineStart,self).__init__() - self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") ) - self.errmsg = "Expected start of line" - - def preParse( self, instring, loc ): - preloc = super(LineStart,self).preParse(instring,loc) - if instring[preloc] == "\n": - loc += 1 - return loc - - def parseImpl( self, instring, loc, doActions=True ): - if not( loc==0 or - (loc == self.preParse( instring, 0 )) or - (instring[loc-1] == "\n") ): #col(loc, instring) != 1: - #~ raise ParseException( instring, loc, "Expected start of line" ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - return loc, [] - -class LineEnd(_PositionToken): - """Matches if current position is at the end of a line within the parse string""" - def __init__( self ): - super(LineEnd,self).__init__() - self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") ) - self.errmsg = "Expected end of line" - - def parseImpl( self, instring, loc, doActions=True ): - if loc len(instring): - return loc, [] - else: - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - -class WordStart(_PositionToken): - """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. - """ - def __init__(self, wordChars = printables): - super(WordStart,self).__init__() - self.wordChars = set(wordChars) - self.errmsg = "Not at the start of a word" - - def parseImpl(self, instring, loc, doActions=True ): - if loc != 0: - if (instring[loc-1] in self.wordChars or - instring[loc] not in self.wordChars): - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - return loc, [] - -class WordEnd(_PositionToken): - """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. - """ - def __init__(self, wordChars = printables): - super(WordEnd,self).__init__() - self.wordChars = set(wordChars) - self.skipWhitespace = False - self.errmsg = "Not at the end of a word" - - def parseImpl(self, instring, loc, doActions=True ): - instrlen = len(instring) - if instrlen>0 and loc maxExcLoc: - maxException = err - maxExcLoc = err.loc - except IndexError: - if len(instring) > maxExcLoc: - maxException = ParseException(instring,len(instring),e.errmsg,self) - maxExcLoc = len(instring) - else: - if loc2 > maxMatchLoc: - maxMatchLoc = loc2 - maxMatchExp = e - - if maxMatchLoc < 0: - if maxException is not None: - raise maxException - else: - raise ParseException(instring, loc, "no defined alternatives to match", self) - - return maxMatchExp._parse( instring, loc, doActions ) - - 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,"name"): - return self.name - - if self.strRepr is None: - self.strRepr = "{" + " ^ ".join( [ _ustr(e) for e in self.exprs ] ) + "}" - - return self.strRepr - - def checkRecursion( self, parseElementList ): - subRecCheckList = parseElementList[:] + [ self ] - for e in self.exprs: - e.checkRecursion( subRecCheckList ) - - -class MatchFirst(ParseExpression): - """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{'|'} operator. - """ - def __init__( self, exprs, savelist = False ): - super(MatchFirst,self).__init__(exprs, savelist) - if exprs: - self.mayReturnEmpty = False - for e in self.exprs: - if e.mayReturnEmpty: - self.mayReturnEmpty = True - break - 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, err: - if err.loc > maxExcLoc: - maxException = err - maxExcLoc = err.loc - except IndexError: - if len(instring) > 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: - raise maxException - else: - raise ParseException(instring, loc, "no defined alternatives to match", 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,"name"): - return self.name - - if self.strRepr is None: - self.strRepr = "{" + " | ".join( [ _ustr(e) for e in self.exprs ] ) + "}" - - return self.strRepr - - def checkRecursion( self, parseElementList ): - subRecCheckList = parseElementList[:] + [ self ] - for e in self.exprs: - e.checkRecursion( subRecCheckList ) - - -class Each(ParseExpression): - """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{'&'} operator. - """ - def __init__( self, exprs, savelist = True ): - super(Each,self).__init__(exprs, savelist) - self.mayReturnEmpty = True - for e in self.exprs: - if not e.mayReturnEmpty: - self.mayReturnEmpty = False - break - self.skipWhitespace = True - self.initExprGroups = True - - def parseImpl( self, instring, loc, doActions=True ): - if self.initExprGroups: - opt1 = [ e.expr for e in self.exprs if isinstance(e,Optional) ] - opt2 = [ e for e in self.exprs if e.mayReturnEmpty and e not in opt1 ] - 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(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 = ", ".join( [ _ustr(e) for e in tmpReqd ] ) - raise ParseException(instring,loc,"Missing one or more required elements (%s)" % 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 = ParseResults([]) - for r in resultlist: - dups = {} - for k in r.keys(): - if k in finalResults.keys(): - tmp = ParseResults(finalResults[k]) - tmp += ParseResults(r[k]) - dups[k] = tmp - finalResults += ParseResults(r) - for k,v in dups.items(): - finalResults[k] = v - return loc, finalResults - - def __str__( self ): - if hasattr(self,"name"): - return self.name - - if self.strRepr is None: - self.strRepr = "{" + " & ".join( [ _ustr(e) for e in self.exprs ] ) + "}" - - return self.strRepr - - def checkRecursion( self, parseElementList ): - subRecCheckList = parseElementList[:] + [ self ] - for e in self.exprs: - e.checkRecursion( subRecCheckList ) - - -class ParseElementEnhance(ParserElement): - """Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.""" - def __init__( self, expr, savelist=False ): - super(ParseElementEnhance,self).__init__(savelist) - if isinstance( expr, basestring ): - expr = 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("",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: - pass - - if self.strRepr is None and self.expr is not None: - self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.expr) ) - return self.strRepr - - -class FollowedBy(ParseElementEnhance): - """Lookahead matching of the given parse expression. C{FollowedBy} - does *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.""" - 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): - """Lookahead to disallow matching with the given parse expression. C{NotAny} - does *not* advance the parsing position within the input string, it only - verifies that the specified parse expression does *not* match at the current - position. Also, C{NotAny} does *not* skip over leading whitespace. C{NotAny} - always returns a null token list. May be constructed using the '~' operator.""" - def __init__( self, expr ): - super(NotAny,self).__init__(expr) - #~ self.leaveWhitespace() - self.skipWhitespace = False # do NOT use self.leaveWhitespace(), don't want to propagate to exprs - self.mayReturnEmpty = True - self.errmsg = "Found unwanted token, "+_ustr(self.expr) - - def parseImpl( self, instring, loc, doActions=True ): - try: - self.expr.tryParse( instring, loc ) - except (ParseException,IndexError): - pass - else: - #~ raise ParseException(instring, loc, self.errmsg ) - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - return loc, [] - - def __str__( self ): - if hasattr(self,"name"): - return self.name - - if self.strRepr is None: - self.strRepr = "~{" + _ustr(self.expr) + "}" - - return self.strRepr - - -class ZeroOrMore(ParseElementEnhance): - """Optional repetition of zero or more of the given expression.""" - def __init__( self, expr ): - super(ZeroOrMore,self).__init__(expr) - self.mayReturnEmpty = True - - def parseImpl( self, instring, loc, doActions=True ): - tokens = [] - try: - loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False ) - hasIgnoreExprs = ( len(self.ignoreExprs) > 0 ) - while 1: - if hasIgnoreExprs: - preloc = self._skipIgnorables( instring, loc ) - else: - preloc = loc - loc, tmptokens = self.expr._parse( instring, preloc, doActions ) - if tmptokens or tmptokens.keys(): - tokens += tmptokens - except (ParseException,IndexError): - pass - - return loc, tokens - - def __str__( self ): - if hasattr(self,"name"): - return self.name - - if self.strRepr is None: - self.strRepr = "[" + _ustr(self.expr) + "]..." - - return self.strRepr - - def setResultsName( self, name, listAllMatches=False ): - ret = super(ZeroOrMore,self).setResultsName(name,listAllMatches) - ret.saveAsList = True - return ret - - -class OneOrMore(ParseElementEnhance): - """Repetition of one or more of the given expression.""" - def parseImpl( self, instring, loc, doActions=True ): - # must be at least one - loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False ) - try: - hasIgnoreExprs = ( len(self.ignoreExprs) > 0 ) - while 1: - if hasIgnoreExprs: - preloc = self._skipIgnorables( instring, loc ) - else: - preloc = loc - loc, tmptokens = self.expr._parse( instring, preloc, doActions ) - if tmptokens or tmptokens.keys(): - tokens += tmptokens - except (ParseException,IndexError): - pass - - return loc, tokens - - def __str__( self ): - if hasattr(self,"name"): - return self.name - - if self.strRepr is None: - self.strRepr = "{" + _ustr(self.expr) + "}..." - - return self.strRepr - - def setResultsName( self, name, listAllMatches=False ): - ret = super(OneOrMore,self).setResultsName(name,listAllMatches) - ret.saveAsList = True - return ret - -class _NullToken(object): - def __bool__(self): - return False - __nonzero__ = __bool__ - def __str__(self): - return "" - -_optionalNotMatched = _NullToken() -class Optional(ParseElementEnhance): - """Optional matching of the given expression. - A default return string can also be specified, if the optional expression - is not found. - """ - def __init__( self, exprs, default=_optionalNotMatched ): - super(Optional,self).__init__( exprs, savelist=False ) - 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,"name"): - return self.name - - if self.strRepr is None: - self.strRepr = "[" + _ustr(self.expr) + "]" - - return self.strRepr - - -class SkipTo(ParseElementEnhance): - """Token for skipping over all undefined text until the matched expression is found. - If C{include} is set to true, the matched expression is also parsed (the skipped text - and matched expression are returned as a 2-element list). The C{ignore} - argument is used to define grammars (typically quoted strings and comments) that - might contain false matches. - """ - 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 failOn is not None and isinstance(failOn, basestring): - self.failOn = Literal(failOn) - else: - self.failOn = failOn - self.errmsg = "No match found for "+_ustr(self.expr) - - def parseImpl( self, instring, loc, doActions=True ): - startLoc = loc - instrlen = len(instring) - expr = self.expr - failParse = False - while loc <= instrlen: - try: - if self.failOn: - try: - self.failOn.tryParse(instring, loc) - except ParseBaseException: - pass - else: - failParse = True - raise ParseException(instring, loc, "Found expression " + str(self.failOn)) - failParse = False - if self.ignoreExpr is not None: - while 1: - try: - loc = self.ignoreExpr.tryParse(instring,loc) - # print "found ignoreExpr, advance to", loc - except ParseBaseException: - break - expr._parse( instring, loc, doActions=False, callPreParse=False ) - skipText = instring[startLoc:loc] - if self.includeMatch: - loc,mat = expr._parse(instring,loc,doActions,callPreParse=False) - if mat: - skipRes = ParseResults( skipText ) - skipRes += mat - return loc, [ skipRes ] - else: - return loc, [ skipText ] - else: - return loc, [ skipText ] - except (ParseException,IndexError): - if failParse: - raise - else: - loc += 1 - exc = self.myException - exc.loc = loc - exc.pstr = instring - raise exc - -class Forward(ParseElementEnhance): - """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 '<<' operator. - - Note: take care when assigning to C{Forward} not to overlook precedence of operators. - Specifically, '|' has a lower precedence than '<<', so that:: - fwdExpr << a | b | c - will actually be evaluated as:: - (fwdExpr << 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 << (a | b | c) - Converting to use the '<<=' operator instead will avoid this problem. - """ - 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.mayReturnEmpty = other.mayReturnEmpty - 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 None - __ilshift__ = __lshift__ - - 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,"name"): - return self.name - - self._revertClass = self.__class__ - self.__class__ = _ForwardNoRecurse - try: - if self.expr is not None: - retString = _ustr(self.expr) - else: - retString = "None" - finally: - self.__class__ = self._revertClass - return self.__class__.__name__ + ": " + retString - - def copy(self): - if self.expr is not None: - return super(Forward,self).copy() - else: - ret = Forward() - ret << self - return ret - -class _ForwardNoRecurse(Forward): - def __str__( self ): - return "..." - -class TokenConverter(ParseElementEnhance): - """Abstract subclass of C{ParseExpression}, for converting parsed results.""" - def __init__( self, expr, savelist=False ): - super(TokenConverter,self).__init__( expr )#, savelist ) - self.saveAsList = False - -class Upcase(TokenConverter): - """Converter to upper case all matching tokens.""" - def __init__(self, *args): - super(Upcase,self).__init__(*args) - warnings.warn("Upcase class is deprecated, use upcaseTokens parse action instead", - DeprecationWarning,stacklevel=2) - - def postParse( self, instring, loc, tokenlist ): - return list(map( str.upper, tokenlist )) - - -class Combine(TokenConverter): - """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{'adjacent=False'} in the constructor. - """ - def __init__( self, expr, joinString="", 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([ "".join(tokenlist._asStringList(self.joinString)) ], modal=self.modalResults) - - if self.resultsName and len(retToks.keys())>0: - return [ retToks ] - else: - return retToks - -class Group(TokenConverter): - """Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.""" - def __init__( self, expr ): - super(Group,self).__init__( expr ) - self.saveAsList = True - - def postParse( self, instring, loc, tokenlist ): - return [ tokenlist ] - -class Dict(TokenConverter): - """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. - """ - def __init__( self, exprs ): - super(Dict,self).__init__( exprs ) - 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("",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.keys()): - tokenlist[ikey] = _ParseResultsWithOffset(dictvalue,i) - else: - tokenlist[ikey] = _ParseResultsWithOffset(dictvalue[0],i) - - if self.resultsName: - return [ tokenlist ] - else: - return tokenlist - - -class Suppress(TokenConverter): - """Converter for ignoring the results of a parsed expression.""" - def postParse( self, instring, loc, tokenlist ): - return [] - - def suppress( self ): - return self - - -class OnlyOnce(object): - """Wrapper for parse actions, to ensure they are only called once.""" - 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,"") - def reset(self): - self.called = False - -def traceParseAction(f): - """Decorator for debugging parse actions.""" - f = _trim_arity(f) - def z(*paArgs): - thisFunc = f.func_name - s,l,t = paArgs[-3:] - if len(paArgs)>3: - thisFunc = paArgs[0].__class__.__name__ + '.' + thisFunc - sys.stderr.write( ">>entering %s(line: '%s', %d, %s)\n" % (thisFunc,line(l,s),l,t) ) - try: - ret = f(*paArgs) - except Exception, exc: - sys.stderr.write( "<}} ('-' operator) indicates that parsing is to stop immediately because +# an unbacktrackable syntax error has been found""" +# def __init__(self, pe): +# super(ParseSyntaxException, self).__init__( +# pe.pstr, pe.loc, pe.msg, pe.parserElement) +# +# #~ class ReparseException(ParseBaseException): +# #~ """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. +# #~ """ +# #~ def __init_( self, newstring, restartLoc ): +# #~ self.newParseText = newstring +# #~ self.reparseLoc = restartLoc +# +# class RecursiveGrammarException(Exception): +# """exception thrown by C{validate()} if the grammar could be improperly recursive""" +# def __init__( self, parseElementList ): +# self.parseElementTrace = parseElementList +# +# def __str__( self ): +# return "RecursiveGrammarException: %s" % 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) +# def setOffset(self,i): +# self.tup = (self.tup[0],i) +# +# class ParseResults(object): +# """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.}) +# """ +# #~ __slots__ = ( "__toklist", "__tokdict", "__doinit", "__name", "__parent", "__accumNames", "__weakref__" ) +# def __new__(cls, toklist, 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, name=None, asList=True, modal=True, isinstance=isinstance ): +# if self.__doinit: +# self.__doinit = False +# self.__name = None +# self.__parent = None +# self.__accumNames = {} +# if isinstance(toklist, list): +# self.__toklist = 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 toklist in (None,'',[]): +# 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): +# 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 < 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 in self.__tokdict: +# occurrences = self.__tokdict[name] +# for j in removed: +# for k, (value, position) in enumerate(occurrences): +# occurrences[k] = _ParseResultsWithOffset(value, position - (position > 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 len( self.__toklist ) > 0 +# __nonzero__ = __bool__ +# def __iter__( self ): return iter( self.__toklist ) +# def __reversed__( self ): return iter( self.__toklist[::-1] ) +# def keys( self ): +# """Returns all named result keys.""" +# return self.__tokdict.keys() +# +# def pop( self, index=-1 ): +# """Removes and returns item at specified index (default=last). +# Will work with either numeric indices or dict-key indicies.""" +# ret = self[index] +# del self[index] +# return ret +# +# def get(self, key, defaultValue=None): +# """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.""" +# if key in self: +# return self[key] +# else: +# return defaultValue +# +# def insert( self, index, insStr ): +# """Inserts new element at location index in the list of parsed tokens.""" +# self.__toklist.insert(index, insStr) +# # fixup indices in token dictionary +# for name in self.__tokdict: +# occurrences = self.__tokdict[name] +# for k, (value, position) in enumerate(occurrences): +# occurrences[k] = _ParseResultsWithOffset(value, position + (position > index)) +# +# def items( self ): +# """Returns all named result keys and values as a list of tuples.""" +# return [(k,self[k]) for k in self.__tokdict] +# +# def values( self ): +# """Returns all named result values.""" +# return [ v[-1][0] for v in self.__tokdict.values() ] +# +# def __getattr__( self, name ): +# if True: #name not in self.__slots__: +# 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 "" +# return None +# +# 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: (a<0 and offset) or (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: +# return self.copy() +# +# def __repr__( self ): +# return "(%s, %s)" % ( repr( self.__toklist ), repr( self.__tokdict ) ) +# +# def __str__( self ): +# out = [] +# for i in self.__toklist: +# if isinstance(i, ParseResults): +# out.append(_ustr(i)) +# else: +# out.append(repr(i)) +# return '[' + ', '.join(out) + ']' +# +# def _asStringList( self, sep='' ): +# 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 ): +# """Returns the parse results as a nested list of matching tokens, all converted to strings.""" +# out = [] +# for res in self.__toklist: +# if isinstance(res,ParseResults): +# out.append( res.asList() ) +# else: +# out.append( res ) +# return out +# +# def asDict( self ): +# """Returns the named parse results as dictionary.""" +# return dict( self.items() ) +# +# def copy( self ): +# """Returns a new copy of a C{ParseResults} object.""" +# 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="", formatted=True ): +# """Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.""" +# nl = "\n" +# out = [] +# namedItems = dict( [ (v[1],k) for (k,vlist) in self.__tokdict.items() +# for v in vlist ] ) +# nextLevelIndent = indent + " " +# +# # collapse out indents if formatting is not desired +# if not formatted: +# indent = "" +# nextLevelIndent = "" +# nl = "" +# +# selfTag = None +# if doctag is not None: +# selfTag = doctag +# else: +# if self.__name: +# selfTag = self.__name +# +# if not selfTag: +# if namedItemsOnly: +# return "" +# else: +# selfTag = "ITEM" +# +# out += [ nl, indent, "<", selfTag, ">" ] +# +# worklist = self.__toklist +# for i,res in enumerate(worklist): +# 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 = "ITEM" +# xmlBodyText = _xml_escape(_ustr(res)) +# out += [ nl, nextLevelIndent, "<", resTag, ">", +# xmlBodyText, +# "" ] +# +# out += [ nl, indent, "" ] +# return "".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): +# """Returns the results name for this token expression.""" +# 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 +# self.__tokdict.values()[0][0][1] in (0,-1)): +# return self.__tokdict.keys()[0] +# else: +# return None +# +# def dump(self,indent='',depth=0): +# """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.""" +# out = [] +# out.append( indent+_ustr(self.asList()) ) +# keys = self.items() +# keys.sort() +# for k,v in keys: +# if out: +# out.append('\n') +# out.append( "%s%s- %s: " % (indent,(' '*depth), k) ) +# if isinstance(v,ParseResults): +# if v.keys(): +# out.append( v.dump(indent,depth+1) ) +# else: +# out.append(_ustr(v)) +# else: +# out.append(_ustr(v)) +# return "".join(out) +# +# # 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 __dir__(self): +# return dir(super(ParseResults,self)) + list(self.keys()) +# +# def col (loc,strg): +# """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}} for more information +# on parsing strings containing C{}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. +# """ +# return (loc} for more information +# on parsing strings containing C{}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. +# """ +# return strg.count("\n",0,loc) + 1 +# +# def line( loc, strg ): +# """Returns the line of text containing loc within a string, counting newlines as line separators. +# """ +# lastCR = strg.rfind("\n", 0, loc) +# nextCR = strg.find("\n", loc) +# if nextCR >= 0: +# return strg[lastCR+1:nextCR] +# else: +# return strg[lastCR+1:] +# +# def _defaultStartDebugAction( instring, loc, expr ): +# print ("Match " + _ustr(expr) + " at loc " + _ustr(loc) + "(%d,%d)" % ( lineno(loc,instring), col(loc,instring) )) +# +# def _defaultSuccessDebugAction( instring, startloc, endloc, expr, toks ): +# print ("Matched " + _ustr(expr) + " -> " + str(toks.asList())) +# +# def _defaultExceptionDebugAction( instring, loc, expr, exc ): +# print ("Exception raised:" + _ustr(exc)) +# +# def nullDebugAction(*args): +# """'Do-nothing' debug action, to suppress debugging output during parsing.""" +# pass +# +# 'decorator to trim function calls to match the arity of the target' +# def _trim_arity(func, maxargs=2): +# if func in singleArgBuiltins: +# return lambda s,l,t: func(t) +# limit = [0] +# foundArity = [False] +# def wrapper(*args): +# while 1: +# try: +# ret = func(*args[limit[0]:]) +# foundArity[0] = True +# return ret +# except TypeError: +# if limit[0] <= maxargs and not foundArity[0]: +# limit[0] += 1 +# continue +# raise +# return wrapper +# +# class ParserElement(object): +# """Abstract base level parser element class.""" +# DEFAULT_WHITE_CHARS = " \n\t\r" +# verbose_stacktrace = False +# +# def setDefaultWhitespaceChars( chars ): +# """Overrides the default whitespace chars +# """ +# ParserElement.DEFAULT_WHITE_CHARS = chars +# setDefaultWhitespaceChars = staticmethod(setDefaultWhitespaceChars) +# +# def inlineLiteralsUsing(cls): +# """ +# Set class to be used for inclusion of string literals into a parser. +# """ +# ParserElement.literalStringClass = cls +# inlineLiteralsUsing = staticmethod(inlineLiteralsUsing) +# +# def __init__( self, savelist=False ): +# self.parseAction = list() +# self.failAction = None +# #~ self.name = "" # don'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't advance parse index +# self.errmsg = "" +# 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 ): +# """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.""" +# 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 ): +# """Define name for this expression, for use in debugging.""" +# self.name = name +# self.errmsg = "Expected " + self.name +# if hasattr(self,"exception"): +# self.exception.msg = self.errmsg +# return self +# +# def setResultsName( self, name, listAllMatches=False ): +# """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("name")} in place of C{expr.setResultsName("name")} - +# see L{I{__call__}<__call__>}. +# """ +# newself = self.copy() +# if name.endswith("*"): +# name = name[:-1] +# listAllMatches=True +# newself.resultsName = name +# newself.modalResults = not listAllMatches +# return newself +# +# def setBreak(self,breakFlag = True): +# """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. +# """ +# 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,"_originalParseMethod"): +# self._parse = self._parse._originalParseMethod +# return self +# +# def setParseAction( self, *fns, **kwargs ): +# """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. +# +# Note: the default parsing behavior is to expand tabs in the input string +# before starting the parsing process. See L{I{parseString}} for more information +# on parsing strings containing C{}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. +# """ +# self.parseAction = list(map(_trim_arity, list(fns))) +# self.callDuringTry = ("callDuringTry" in kwargs and kwargs["callDuringTry"]) +# return self +# +# def addParseAction( self, *fns, **kwargs ): +# """Add parse action to expression's list of parse actions. See L{I{setParseAction}}.""" +# self.parseAction += list(map(_trim_arity, list(fns))) +# self.callDuringTry = self.callDuringTry or ("callDuringTry" in kwargs and kwargs["callDuringTry"]) +# return self +# +# def setFailAction( self, fn ): +# """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.""" +# 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 < 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 ("Match",self,"at loc",loc,"(%d,%d)" % ( 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, err: +# #~ print ("Exception raised:", err) +# err = None +# 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 >= 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, err: +# #~ print "Exception raised in user parse action:", 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 ("Matched",self,"->",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) +# +# # 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 ): +# lookup = (self,instring,loc,callPreParse,doActions) +# if lookup in ParserElement._exprArgCache: +# value = ParserElement._exprArgCache[ lookup ] +# if isinstance(value, Exception): +# raise value +# return (value[0],value[1].copy()) +# else: +# try: +# value = self._parseNoCache( instring, loc, doActions, callPreParse ) +# ParserElement._exprArgCache[ lookup ] = (value[0],value[1].copy()) +# return value +# except ParseBaseException, pe: +# ParserElement._exprArgCache[ lookup ] = pe +# raise +# +# _parse = _parseNoCache +# +# # argument cache for optimizing repeated calls when backtracking through recursive expressions +# _exprArgCache = {} +# def resetCache(): +# ParserElement._exprArgCache.clear() +# resetCache = staticmethod(resetCache) +# +# _packratEnabled = False +# def enablePackrat(): +# """Enables "packrat" 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. +# +# 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 "compile as you go", 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. +# """ +# if not ParserElement._packratEnabled: +# ParserElement._packratEnabled = True +# ParserElement._parse = ParserElement._parseCache +# enablePackrat = staticmethod(enablePackrat) +# +# def parseString( self, instring, parseAll=False ): +# """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}}) +# - define your parse action using the full C{(s,loc,toks)} signature, and +# reference the input string using the parse action's C{s} argument +# - explictly expand the tabs in your input string before calling +# C{parseString} +# """ +# 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, 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 ): +# """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 'n' 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}} for more information on parsing +# strings with embedded tabs.""" +# 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 <= instrlen and matches < maxMatches: +# try: +# preloc = preparseFn( instring, loc ) +# nextLoc,tokens = parseFn( instring, preloc, callPreParse=False ) +# except ParseException: +# loc = preloc+1 +# else: +# if nextLoc > loc: +# matches += 1 +# yield tokens, preloc, nextLoc +# if overlap: +# nextloc = preparseFn( instring, loc ) +# if nextloc > loc: +# loc = nextLoc +# else: +# loc += 1 +# else: +# loc = nextLoc +# else: +# loc = preloc+1 +# except ParseBaseException, 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 ): +# """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.""" +# out = [] +# lastE = 0 +# # force preservation of 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 "".join(map(_ustr,_flatten(out))) +# except ParseBaseException, 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 ): +# """Another extension to C{L{scanString}}, simplifying the access to the tokens found +# to match the given parse expression. May be called with optional +# C{maxMatches} argument, to clip searching after 'n' matches are found. +# """ +# try: +# return ParseResults([ t for t,s,e in self.scanString( instring, maxMatches ) ]) +# except ParseBaseException, exc: +# if ParserElement.verbose_stacktrace: +# raise +# else: +# # catch and re-raise exception from here, clears out pyparsing internal stack trace +# raise exc +# +# def __add__(self, other ): +# """Implementation of + operator - returns C{L{And}}""" +# if isinstance( other, basestring ): +# other = ParserElement.literalStringClass( other ) +# if not isinstance( other, ParserElement ): +# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), +# SyntaxWarning, stacklevel=2) +# return None +# return And( [ self, other ] ) +# +# def __radd__(self, other ): +# """Implementation of + operator when left operand is not a C{L{ParserElement}}""" +# if isinstance( other, basestring ): +# other = ParserElement.literalStringClass( other ) +# if not isinstance( other, ParserElement ): +# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), +# SyntaxWarning, stacklevel=2) +# return None +# return other + self +# +# def __sub__(self, other): +# """Implementation of - operator, returns C{L{And}} with error stop""" +# if isinstance( other, basestring ): +# other = ParserElement.literalStringClass( other ) +# if not isinstance( other, ParserElement ): +# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), +# SyntaxWarning, stacklevel=2) +# return None +# return And( [ self, And._ErrorStop(), other ] ) +# +# def __rsub__(self, other ): +# """Implementation of - operator when left operand is not a C{L{ParserElement}}""" +# if isinstance( other, basestring ): +# other = ParserElement.literalStringClass( other ) +# if not isinstance( other, ParserElement ): +# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), +# SyntaxWarning, stacklevel=2) +# return None +# return other - self +# +# def __mul__(self,other): +# """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 "at least n instances of C{expr}") +# - C{expr*(None,n)} is equivalent to C{expr*(0,n)} +# (read as "0 to n instances of C{expr}") +# - 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} +# +# """ +# 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("cannot multiply 'ParserElement' and ('%s','%s') objects", type(other[0]),type(other[1])) +# else: +# raise TypeError("cannot multiply 'ParserElement' and '%s' objects", type(other)) +# +# if minElements < 0: +# raise ValueError("cannot multiply ParserElement by negative value") +# if optElements < 0: +# raise ValueError("second tuple value must be greater or equal to first tuple value") +# if minElements == optElements == 0: +# raise ValueError("cannot multiply ParserElement by 0 or (0,0)") +# +# if (optElements): +# def makeOptionalList(n): +# if n>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 ): +# """Implementation of | operator - returns C{L{MatchFirst}}""" +# if isinstance( other, basestring ): +# other = ParserElement.literalStringClass( other ) +# if not isinstance( other, ParserElement ): +# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), +# SyntaxWarning, stacklevel=2) +# return None +# return MatchFirst( [ self, other ] ) +# +# def __ror__(self, other ): +# """Implementation of | operator when left operand is not a C{L{ParserElement}}""" +# if isinstance( other, basestring ): +# other = ParserElement.literalStringClass( other ) +# if not isinstance( other, ParserElement ): +# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), +# SyntaxWarning, stacklevel=2) +# return None +# return other | self +# +# def __xor__(self, other ): +# """Implementation of ^ operator - returns C{L{Or}}""" +# if isinstance( other, basestring ): +# other = ParserElement.literalStringClass( other ) +# if not isinstance( other, ParserElement ): +# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), +# SyntaxWarning, stacklevel=2) +# return None +# return Or( [ self, other ] ) +# +# def __rxor__(self, other ): +# """Implementation of ^ operator when left operand is not a C{L{ParserElement}}""" +# if isinstance( other, basestring ): +# other = ParserElement.literalStringClass( other ) +# if not isinstance( other, ParserElement ): +# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), +# SyntaxWarning, stacklevel=2) +# return None +# return other ^ self +# +# def __and__(self, other ): +# """Implementation of & operator - returns C{L{Each}}""" +# if isinstance( other, basestring ): +# other = ParserElement.literalStringClass( other ) +# if not isinstance( other, ParserElement ): +# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), +# SyntaxWarning, stacklevel=2) +# return None +# return Each( [ self, other ] ) +# +# def __rand__(self, other ): +# """Implementation of & operator when left operand is not a C{L{ParserElement}}""" +# if isinstance( other, basestring ): +# other = ParserElement.literalStringClass( other ) +# if not isinstance( other, ParserElement ): +# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), +# SyntaxWarning, stacklevel=2) +# return None +# return other & self +# +# def __invert__( self ): +# """Implementation of ~ operator - returns C{L{NotAny}}""" +# return NotAny( self ) +# +# def __call__(self, name): +# """Shortcut for C{L{setResultsName}}, with C{listAllMatches=default}:: +# userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno") +# could be written as:: +# userdata = Word(alphas)("name") + Word(nums+"-")("socsecno") +# +# If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be +# passed as C{True}. +# """ +# return self.setResultsName(name) +# +# def suppress( self ): +# """Suppresses the output of this C{ParserElement}; useful to keep punctuation from +# cluttering up returned output. +# """ +# return Suppress( self ) +# +# def leaveWhitespace( self ): +# """Disables the skipping of whitespace before matching the characters in the +# C{ParserElement}'s defined pattern. This is normally only used internally by +# the pyparsing module, but may be needed in some whitespace-sensitive grammars. +# """ +# self.skipWhitespace = False +# return self +# +# def setWhitespaceChars( self, chars ): +# """Overrides the default whitespace chars +# """ +# self.skipWhitespace = True +# self.whiteChars = chars +# self.copyDefaultWhiteChars = False +# return self +# +# def parseWithTabs( self ): +# """Overrides default behavior to expand C{}s to spaces before parsing the input string. +# Must be called before C{parseString} when the input grammar contains elements that +# match C{} characters.""" +# self.keepTabs = True +# return self +# +# def ignore( self, other ): +# """Define expression to be ignored (e.g., comments) while doing pattern +# matching; may be called repeatedly, to define multiple comment or other +# ignorable patterns. +# """ +# if isinstance( other, Suppress ): +# if other not in self.ignoreExprs: +# self.ignoreExprs.append( other.copy() ) +# else: +# self.ignoreExprs.append( Suppress( other.copy() ) ) +# return self +# +# def setDebugActions( self, startAction, successAction, exceptionAction ): +# """Enable display of debugging messages while doing pattern matching.""" +# self.debugActions = (startAction or _defaultStartDebugAction, +# successAction or _defaultSuccessDebugAction, +# exceptionAction or _defaultExceptionDebugAction) +# self.debug = True +# return self +# +# def setDebug( self, flag=True ): +# """Enable display of debugging messages while doing pattern matching. +# Set C{flag} to True to enable, False to disable.""" +# 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=[] ): +# """Check defined expressions for valid structure, check for infinite recursive definitions.""" +# self.checkRecursion( [] ) +# +# def parseFile( self, file_or_filename, parseAll=False ): +# """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. +# """ +# try: +# file_contents = file_or_filename.read() +# except AttributeError: +# f = open(file_or_filename, "r") +# file_contents = f.read() +# f.close() +# try: +# return self.parseString(file_contents, parseAll) +# except ParseBaseException, exc: +# if ParserElement.verbose_stacktrace: +# raise +# else: +# # catch and re-raise exception from here, clears out pyparsing internal stack trace +# raise exc +# +# def getException(self): +# return ParseException("",0,self.errmsg,self) +# +# def __getattr__(self,aname): +# if aname == "myException": +# self.myException = ret = self.getException(); +# return ret; +# else: +# raise AttributeError("no such attribute " + aname) +# +# def __eq__(self,other): +# if isinstance(other, ParserElement): +# return self is other or self.__dict__ == other.__dict__ +# elif isinstance(other, basestring): +# try: +# self.parseString(_ustr(other), parseAll=True) +# return True +# except ParseBaseException: +# return False +# 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) +# +# +# class Token(ParserElement): +# """Abstract C{ParserElement} subclass, for defining atomic matching patterns.""" +# def __init__( self ): +# super(Token,self).__init__( savelist=False ) +# +# def setName(self, name): +# s = super(Token,self).setName(name) +# self.errmsg = "Expected " + self.name +# return s +# +# +# class Empty(Token): +# """An empty token, will always match.""" +# def __init__( self ): +# super(Empty,self).__init__() +# self.name = "Empty" +# self.mayReturnEmpty = True +# self.mayIndexError = False +# +# +# class NoMatch(Token): +# """A token that will never match.""" +# def __init__( self ): +# super(NoMatch,self).__init__() +# self.name = "NoMatch" +# self.mayReturnEmpty = True +# self.mayIndexError = False +# self.errmsg = "Unmatchable token" +# +# def parseImpl( self, instring, loc, doActions=True ): +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# +# class Literal(Token): +# """Token to exactly match a specified string.""" +# def __init__( self, matchString ): +# super(Literal,self).__init__() +# self.match = matchString +# self.matchLen = len(matchString) +# try: +# self.firstMatchChar = matchString[0] +# except IndexError: +# warnings.warn("null string passed to Literal; use Empty() instead", +# SyntaxWarning, stacklevel=2) +# self.__class__ = Empty +# self.name = '"%s"' % _ustr(self.match) +# self.errmsg = "Expected " + 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 ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# _L = Literal +# ParserElement.literalStringClass = Literal +# +# class Keyword(Token): +# """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}}:: +# Literal("if") will match the leading C{'if'} in C{'ifAndOnlyIf'}. +# Keyword("if") will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'} +# 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 + "_" and "$"; C{caseless} allows case-insensitive +# matching, default is C{False}. +# """ +# DEFAULT_KEYWORD_CHARS = alphanums+"_$" +# +# def __init__( self, matchString, identChars=DEFAULT_KEYWORD_CHARS, caseless=False ): +# super(Keyword,self).__init__() +# self.match = matchString +# self.matchLen = len(matchString) +# try: +# self.firstMatchChar = matchString[0] +# except IndexError: +# warnings.warn("null string passed to Keyword; use Empty() instead", +# SyntaxWarning, stacklevel=2) +# self.name = '"%s"' % self.match +# self.errmsg = "Expected " + 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 >= 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 >= 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 ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# def copy(self): +# c = super(Keyword,self).copy() +# c.identChars = Keyword.DEFAULT_KEYWORD_CHARS +# return c +# +# def setDefaultKeywordChars( chars ): +# """Overrides the default Keyword chars +# """ +# Keyword.DEFAULT_KEYWORD_CHARS = chars +# setDefaultKeywordChars = staticmethod(setDefaultKeywordChars) +# +# class CaselessLiteral(Literal): +# """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. +# """ +# def __init__( self, matchString ): +# super(CaselessLiteral,self).__init__( matchString.upper() ) +# # Preserve the defining literal. +# self.returnString = matchString +# self.name = "'%s'" % self.returnString +# self.errmsg = "Expected " + 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 ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# class CaselessKeyword(Keyword): +# def __init__( self, matchString, identChars=Keyword.DEFAULT_KEYWORD_CHARS ): +# 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 >= 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 ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# class Word(Token): +# """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 < 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{exclude} 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. +# """ +# def __init__( self, initChars, bodyChars=None, min=1, max=0, exact=0, asKeyword=False, excludeChars=None ): +# super(Word,self).__init__() +# if excludeChars: +# initChars = ''.join([c for c in initChars if c not in excludeChars]) +# if bodyChars: +# bodyChars = ''.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 > 0 +# +# if min < 1: +# raise ValueError("cannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permitted") +# +# self.minLen = min +# +# if max > 0: +# self.maxLen = max +# else: +# self.maxLen = _MAX_INT +# +# if exact > 0: +# self.maxLen = exact +# self.minLen = exact +# +# self.name = _ustr(self) +# self.errmsg = "Expected " + self.name +# self.mayIndexError = False +# self.asKeyword = asKeyword +# +# if ' ' not in self.initCharsOrig+self.bodyCharsOrig and (min==1 and max==0 and exact==0): +# if self.bodyCharsOrig == self.initCharsOrig: +# self.reString = "[%s]+" % _escapeRegexRangeChars(self.initCharsOrig) +# elif len(self.bodyCharsOrig) == 1: +# self.reString = "%s[%s]*" % \ +# (re.escape(self.initCharsOrig), +# _escapeRegexRangeChars(self.bodyCharsOrig),) +# else: +# self.reString = "[%s][%s]*" % \ +# (_escapeRegexRangeChars(self.initCharsOrig), +# _escapeRegexRangeChars(self.bodyCharsOrig),) +# if self.asKeyword: +# self.reString = r"\b"+self.reString+r"\b" +# try: +# self.re = re.compile( self.reString ) +# except: +# self.re = None +# +# def parseImpl( self, instring, loc, doActions=True ): +# if self.re: +# result = self.re.match(instring,loc) +# if not result: +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# loc = result.end() +# return loc, result.group() +# +# if not(instring[ loc ] in self.initChars): +# #~ raise ParseException( instring, loc, self.errmsg ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# start = loc +# loc += 1 +# instrlen = len(instring) +# bodychars = self.bodyChars +# maxloc = start + self.maxLen +# maxloc = min( maxloc, instrlen ) +# while loc < maxloc and instring[loc] in bodychars: +# loc += 1 +# +# throwException = False +# if loc - start < self.minLen: +# throwException = True +# if self.maxSpecified and loc < instrlen and instring[loc] in bodychars: +# throwException = True +# if self.asKeyword: +# if (start>0 and instring[start-1] in bodychars) or (loc4: +# return s[:4]+"..." +# else: +# return s +# +# if ( self.initCharsOrig != self.bodyCharsOrig ): +# self.strRepr = "W:(%s,%s)" % ( charsAsStr(self.initCharsOrig), charsAsStr(self.bodyCharsOrig) ) +# else: +# self.strRepr = "W:(%s)" % charsAsStr(self.initCharsOrig) +# +# return self.strRepr +# +# +# class Regex(Token): +# """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. +# """ +# compiledREtype = type(re.compile("[A-Z]")) +# def __init__( self, pattern, flags=0): +# """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.""" +# super(Regex,self).__init__() +# +# if isinstance(pattern, basestring): +# if len(pattern) == 0: +# warnings.warn("null string passed to Regex; use Empty() instead", +# 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("invalid pattern (%s) passed to Regex" % 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("Regex may only be constructed with a string or a compiled RE object") +# +# self.name = _ustr(self) +# self.errmsg = "Expected " + self.name +# self.mayIndexError = False +# self.mayReturnEmpty = True +# +# def parseImpl( self, instring, loc, doActions=True ): +# result = self.re.match(instring,loc) +# if not result: +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# 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: +# pass +# +# if self.strRepr is None: +# self.strRepr = "Re:(%s)" % repr(self.pattern) +# +# return self.strRepr +# +# +# class QuotedString(Token): +# """Token for matching strings that are delimited by quoting characters. +# """ +# def __init__( self, quoteChar, escChar=None, escQuote=None, multiline=False, unquoteResults=True, endQuoteChar=None): +# """ +# 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=None) +# - escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=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} => same as quoteChar) +# """ +# super(QuotedString,self).__init__() +# +# # remove white space from quote chars - wont work anyway +# quoteChar = quoteChar.strip() +# if len(quoteChar) == 0: +# warnings.warn("quoteChar cannot be the empty string",SyntaxWarning,stacklevel=2) +# raise SyntaxError() +# +# if endQuoteChar is None: +# endQuoteChar = quoteChar +# else: +# endQuoteChar = endQuoteChar.strip() +# if len(endQuoteChar) == 0: +# warnings.warn("endQuoteChar cannot be the empty string",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 +# +# if multiline: +# self.flags = re.MULTILINE | re.DOTALL +# self.pattern = r'%s(?:[^%s%s]' % \ +# ( re.escape(self.quoteChar), +# _escapeRegexRangeChars(self.endQuoteChar[0]), +# (escChar is not None and _escapeRegexRangeChars(escChar) or '') ) +# else: +# self.flags = 0 +# self.pattern = r'%s(?:[^%s\n\r%s]' % \ +# ( re.escape(self.quoteChar), +# _escapeRegexRangeChars(self.endQuoteChar[0]), +# (escChar is not None and _escapeRegexRangeChars(escChar) or '') ) +# if len(self.endQuoteChar) > 1: +# self.pattern += ( +# '|(?:' + ')|(?:'.join(["%s[^%s]" % (re.escape(self.endQuoteChar[:i]), +# _escapeRegexRangeChars(self.endQuoteChar[i])) +# for i in range(len(self.endQuoteChar)-1,0,-1)]) + ')' +# ) +# if escQuote: +# self.pattern += (r'|(?:%s)' % re.escape(escQuote)) +# if escChar: +# self.pattern += (r'|(?:%s.)' % re.escape(escChar)) +# charset = ''.join(set(self.quoteChar[0]+self.endQuoteChar[0])).replace('^',r'\^').replace('-',r'\-') +# self.escCharReplacePattern = re.escape(self.escChar)+("([%s])" % charset) +# self.pattern += (r')*%s' % re.escape(self.endQuoteChar)) +# +# try: +# self.re = re.compile(self.pattern, self.flags) +# self.reString = self.pattern +# except sre_constants.error: +# warnings.warn("invalid pattern (%s) passed to Regex" % self.pattern, +# SyntaxWarning, stacklevel=2) +# raise +# +# self.name = _ustr(self) +# self.errmsg = "Expected " + 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: +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# loc = result.end() +# ret = result.group() +# +# if self.unquoteResults: +# +# # strip off quotes +# ret = ret[self.quoteCharLen:-self.endQuoteCharLen] +# +# if isinstance(ret,basestring): +# # replace escaped characters +# if self.escChar: +# ret = re.sub(self.escCharReplacePattern,"\g<1>",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: +# pass +# +# if self.strRepr is None: +# self.strRepr = "quoted string, starting with %s ending with %s" % (self.quoteChar, self.endQuoteChar) +# +# return self.strRepr +# +# +# class CharsNotIn(Token): +# """Token for matching words composed of characters *not* in a given set. +# 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 < 1 is not valid); the default values for C{max} and C{exact} +# are 0, meaning no maximum or exact length restriction. +# """ +# def __init__( self, notChars, min=1, max=0, exact=0 ): +# super(CharsNotIn,self).__init__() +# self.skipWhitespace = False +# self.notChars = notChars +# +# if min < 1: +# raise ValueError("cannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permitted") +# +# self.minLen = min +# +# if max > 0: +# self.maxLen = max +# else: +# self.maxLen = _MAX_INT +# +# if exact > 0: +# self.maxLen = exact +# self.minLen = exact +# +# self.name = _ustr(self) +# self.errmsg = "Expected " + 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 ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# start = loc +# loc += 1 +# notchars = self.notChars +# maxlen = min( start+self.maxLen, len(instring) ) +# while loc < maxlen and \ +# (instring[loc] not in notchars): +# loc += 1 +# +# if loc - start < self.minLen: +# #~ raise ParseException( instring, loc, self.errmsg ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# return loc, instring[start:loc] +# +# def __str__( self ): +# try: +# return super(CharsNotIn, self).__str__() +# except: +# pass +# +# if self.strRepr is None: +# if len(self.notChars) > 4: +# self.strRepr = "!W:(%s...)" % self.notChars[:4] +# else: +# self.strRepr = "!W:(%s)" % self.notChars +# +# return self.strRepr +# +# class White(Token): +# """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{" \\t\\r\\n"}. Also takes optional C{min}, C{max}, and C{exact} arguments, +# as defined for the C{L{Word}} class.""" +# whiteStrs = { +# " " : "", +# "\t": "", +# "\n": "", +# "\r": "", +# "\f": "", +# } +# def __init__(self, ws=" \t\r\n", min=1, max=0, exact=0): +# super(White,self).__init__() +# self.matchWhite = ws +# self.setWhitespaceChars( "".join([c for c in self.whiteChars if c not in self.matchWhite]) ) +# #~ self.leaveWhitespace() +# self.name = ("".join([White.whiteStrs[c] for c in self.matchWhite])) +# self.mayReturnEmpty = True +# self.errmsg = "Expected " + self.name +# +# self.minLen = min +# +# if max > 0: +# self.maxLen = max +# else: +# self.maxLen = _MAX_INT +# +# if exact > 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 ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# start = loc +# loc += 1 +# maxloc = start + self.maxLen +# maxloc = min( maxloc, len(instring) ) +# while loc < maxloc and instring[loc] in self.matchWhite: +# loc += 1 +# +# if loc - start < self.minLen: +# #~ raise ParseException( instring, loc, self.errmsg ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# 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): +# """Token to advance to a specific column of input text; useful for tabular report scraping.""" +# 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 < 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 > self.col: +# raise ParseException( instring, loc, "Text not in expected column", self ) +# newloc = loc + self.col - thiscol +# ret = instring[ loc: newloc ] +# return newloc, ret +# +# class LineStart(_PositionToken): +# """Matches if current position is at the beginning of a line within the parse string""" +# def __init__( self ): +# super(LineStart,self).__init__() +# self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") ) +# self.errmsg = "Expected start of line" +# +# def preParse( self, instring, loc ): +# preloc = super(LineStart,self).preParse(instring,loc) +# if instring[preloc] == "\n": +# loc += 1 +# return loc +# +# def parseImpl( self, instring, loc, doActions=True ): +# if not( loc==0 or +# (loc == self.preParse( instring, 0 )) or +# (instring[loc-1] == "\n") ): #col(loc, instring) != 1: +# #~ raise ParseException( instring, loc, "Expected start of line" ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# return loc, [] +# +# class LineEnd(_PositionToken): +# """Matches if current position is at the end of a line within the parse string""" +# def __init__( self ): +# super(LineEnd,self).__init__() +# self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") ) +# self.errmsg = "Expected end of line" +# +# def parseImpl( self, instring, loc, doActions=True ): +# if loc len(instring): +# return loc, [] +# else: +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# class WordStart(_PositionToken): +# """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. +# """ +# def __init__(self, wordChars = printables): +# super(WordStart,self).__init__() +# self.wordChars = set(wordChars) +# self.errmsg = "Not at the start of a word" +# +# def parseImpl(self, instring, loc, doActions=True ): +# if loc != 0: +# if (instring[loc-1] in self.wordChars or +# instring[loc] not in self.wordChars): +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# return loc, [] +# +# class WordEnd(_PositionToken): +# """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. +# """ +# def __init__(self, wordChars = printables): +# super(WordEnd,self).__init__() +# self.wordChars = set(wordChars) +# self.skipWhitespace = False +# self.errmsg = "Not at the end of a word" +# +# def parseImpl(self, instring, loc, doActions=True ): +# instrlen = len(instring) +# if instrlen>0 and loc", "|".join( [ _escapeRegexChars(sym) for sym in symbols] )) - try: - if len(symbols)==len("".join(symbols)): - return Regex( "[%s]" % "".join( [ _escapeRegexRangeChars(sym) for sym in symbols] ) ) - else: - return Regex( "|".join( [ re.escape(sym) for sym in symbols] ) ) - except: - warnings.warn("Exception creating Regex for oneOf, building MatchFirst", - SyntaxWarning, stacklevel=2) - - - # last resort, just use MatchFirst - return MatchFirst( [ parseElementClass(sym) for sym in symbols ] ) - -def dictOf( key, value ): - """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. - """ - return Dict( ZeroOrMore( Group ( key + value ) ) ) - -def originalTextFor(expr, asString=True): - """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. Simpler to use than the parse action C{L{keepOriginalText}}, and does not - require the inspect module to chase up the call stack. By default, returns a - string 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.""" - locMarker = Empty().setParseAction(lambda s,loc,t: loc) - endlocMarker = locMarker.copy() - endlocMarker.callPreparse = False - matchExpr = locMarker("_original_start") + expr + endlocMarker("_original_end") - if asString: - extractText = lambda s,l,t: s[t._original_start:t._original_end] - else: - def extractText(s,l,t): - del t[:] - t.insert(0, s[t._original_start:t._original_end]) - del t["_original_start"] - del t["_original_end"] - matchExpr.setParseAction(extractText) - return matchExpr - -def ungroup(expr): - """Helper to undo pyparsing's default grouping of And expressions, even - if all but one are non-empty.""" - return TokenConverter(expr).setParseAction(lambda t:t[0]) - -# convenience constants for positional expressions -empty = Empty().setName("empty") -lineStart = LineStart().setName("lineStart") -lineEnd = LineEnd().setName("lineEnd") -stringStart = StringStart().setName("stringStart") -stringEnd = StringEnd().setName("stringEnd") - -_escapedPunc = Word( _bslash, r"\[]-*.$+^?()~ ", exact=2 ).setParseAction(lambda s,l,t:t[0][1]) -_printables_less_backslash = "".join([ c for c in printables if c not in r"\]" ]) -_escapedHexChar = Regex(r"\\0?[xX][0-9a-fA-F]+").setParseAction(lambda s,l,t:unichr(int(t[0].lstrip(r'\0x'),16))) -_escapedOctChar = Regex(r"\\0[0-7]+").setParseAction(lambda s,l,t:unichr(int(t[0][1:],8))) -_singleChar = _escapedPunc | _escapedHexChar | _escapedOctChar | Word(_printables_less_backslash,exact=1) -_charRange = Group(_singleChar + Suppress("-") + _singleChar) -_reBracketExpr = Literal("[") + Optional("^").setResultsName("negate") + Group( OneOrMore( _charRange | _singleChar ) ).setResultsName("body") + "]" - -_expanded = lambda p: (isinstance(p,ParseResults) and ''.join([ unichr(c) for c in range(ord(p[0]),ord(p[1])+1) ]) or p) - -def srange(s): - r"""Helper to easily define string ranges for use in Word construction. Borrows - syntax from regexp '[]' string range definitions:: - srange("[0-9]") -> "0123456789" - srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz" - srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_" - The input string must be enclosed in []'s, and the returned string is the expanded - character set joined into a single string. - The values enclosed in the []'s may be:: - a single character - an escaped character with a leading backslash (such as \- or \]) - an escaped hex character with a leading '\x' (\x21, which is a '!' character) - (\0x## is also supported for backwards compatibility) - an escaped octal character with a leading '\0' (\041, which is a '!' character) - a range of any of the above, separated by a dash ('a-z', etc.) - any combination of the above ('aeiouy', 'a-zA-Z0-9_$', etc.) - """ - try: - return "".join([_expanded(part) for part in _reBracketExpr.parseString(s).body]) - except: - return "" - -def matchOnlyAtCol(n): - """Helper method for defining parse actions that require matching at a specific - column in the input text. - """ - def verifyCol(strg,locn,toks): - if col(locn,strg) != n: - raise ParseException(strg,locn,"matched token not at column %d" % n) - return verifyCol - -def replaceWith(replStr): - """Helper method for common parse actions that simply return a literal value. Especially - useful when used with C{L{transformString}()}. - """ - def _replFunc(*args): - return [replStr] - return _replFunc - -def removeQuotes(s,l,t): - """Helper parse action for removing quotation marks from parsed quoted strings. - To use, add this parse action to quoted string using:: - quotedString.setParseAction( removeQuotes ) - """ - return t[0][1:-1] - -def upcaseTokens(s,l,t): - """Helper parse action to convert tokens to upper case.""" - return [ tt.upper() for tt in map(_ustr,t) ] - -def downcaseTokens(s,l,t): - """Helper parse action to convert tokens to lower case.""" - return [ tt.lower() for tt in map(_ustr,t) ] - -def keepOriginalText(s,startLoc,t): - """DEPRECATED - use new helper method C{L{originalTextFor}}. - Helper parse action to preserve original parsed text, - overriding any nested parse actions.""" - try: - endloc = getTokensEndLoc() - except ParseException: - raise ParseFatalException("incorrect usage of keepOriginalText - may only be called as a parse action") - del t[:] - t += ParseResults(s[startLoc:endloc]) - return t - -def getTokensEndLoc(): - """Method to be called from within a parse action to determine the end - location of the parsed tokens.""" - import inspect - fstack = inspect.stack() - try: - # search up the stack (through intervening argument normalizers) for correct calling routine - for f in fstack[2:]: - if f[3] == "_parseNoCache": - endloc = f[0].f_locals["loc"] - return endloc - else: - raise ParseFatalException("incorrect usage of getTokensEndLoc - may only be called from within a parse action") - finally: - del fstack - -def _makeTags(tagStr, xml): - """Internal helper to construct opening and closing tag expressions, given a tag name""" - if isinstance(tagStr,basestring): - resname = tagStr - tagStr = Keyword(tagStr, caseless=not xml) - else: - resname = tagStr.name - - tagAttrName = Word(alphas,alphanums+"_-:") - if (xml): - tagAttrValue = dblQuotedString.copy().setParseAction( removeQuotes ) - openTag = Suppress("<") + tagStr("tag") + \ - Dict(ZeroOrMore(Group( tagAttrName + Suppress("=") + tagAttrValue ))) + \ - Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">") - else: - printablesLessRAbrack = "".join( [ c for c in printables if c not in ">" ] ) - tagAttrValue = quotedString.copy().setParseAction( removeQuotes ) | Word(printablesLessRAbrack) - openTag = Suppress("<") + tagStr("tag") + \ - Dict(ZeroOrMore(Group( tagAttrName.setParseAction(downcaseTokens) + \ - Optional( Suppress("=") + tagAttrValue ) ))) + \ - Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">") - closeTag = Combine(_L("") - - openTag = openTag.setResultsName("start"+"".join(resname.replace(":"," ").title().split())).setName("<%s>" % tagStr) - closeTag = closeTag.setResultsName("end"+"".join(resname.replace(":"," ").title().split())).setName("" % tagStr) - openTag.tag = resname - closeTag.tag = resname - return openTag, closeTag - -def makeHTMLTags(tagStr): - """Helper to construct opening and closing tag expressions for HTML, given a tag name""" - return _makeTags( tagStr, False ) - -def makeXMLTags(tagStr): - """Helper to construct opening and closing tag expressions for XML, given a tag name""" - return _makeTags( tagStr, True ) - -def withAttribute(*args,**attrDict): - """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{} or C{
}. - - 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="right")}, or - - as an explicit dict with C{**} operator, when an attribute name is also a Python - reserved word, as in C{**{"class":"Customer", "align":"right"}} - - a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") ) - For attribute names with a namespace prefix, you must use the second form. Attribute - names are matched insensitive to upper/lower case. - - To verify that the attribute exists, but without specifying a value, pass - C{withAttribute.ANY_VALUE} as the value. - """ - 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,"no matching attribute " + attrName) - if attrValue != withAttribute.ANY_VALUE and tokens[attrName] != attrValue: - raise ParseException(s,l,"attribute '%s' has value '%s', must be '%s'" % - (attrName, tokens[attrName], attrValue)) - return pa -withAttribute.ANY_VALUE = object() - -opAssoc = _Constants() -opAssoc.LEFT = object() -opAssoc.RIGHT = object() - -def infixNotation( baseExpr, opList, lpar=Suppress('('), rpar=Suppress(')') ): - """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. - - 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=Suppress('(')) - - rpar - expression for matching right-parentheses (default=Suppress(')')) - """ - ret = Forward() - lastExpr = baseExpr | ( lpar + ret + rpar ) - for i,operDef in enumerate(opList): - opExpr,arity,rightLeftAssoc,pa = (operDef + (None,))[:4] - if arity == 3: - if opExpr is None or len(opExpr) != 2: - raise ValueError("if numterms=3, opExpr must be a tuple or list of two expressions") - opExpr1, opExpr2 = opExpr - thisExpr = Forward()#.setName("expr%d" % i) - 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("operator must be unary (1), binary (2), or ternary (3)") - 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("operator must be unary (1), binary (2), or ternary (3)") - else: - raise ValueError("operator must indicate right or left associativity") - if pa: - matchExpr.setParseAction( pa ) - thisExpr << ( matchExpr | lastExpr ) - lastExpr = thisExpr - ret << lastExpr - return ret -operatorPrecedence = infixNotation - -dblQuotedString = Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\x[0-9a-fA-F]+)|(?:\\.))*"').setName("string enclosed in double quotes") -sglQuotedString = Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\x[0-9a-fA-F]+)|(?:\\.))*'").setName("string enclosed in single quotes") -quotedString = Regex(r'''(?:"(?:[^"\n\r\\]|(?:"")|(?:\\x[0-9a-fA-F]+)|(?:\\.))*")|(?:'(?:[^'\n\r\\]|(?:'')|(?:\\x[0-9a-fA-F]+)|(?:\\.))*')''').setName("quotedString using single or double quotes") -unicodeString = Combine(_L('u') + quotedString.copy()) - -def nestedExpr(opener="(", closer=")", content=None, ignoreExpr=quotedString.copy()): - """Helper method for defining nested lists enclosed in opening and closing - delimiters ("(" and ")" are the default). - - Parameters: - - opener - opening character for a nested list (default="("); can also be a pyparsing expression - - closer - closing character for a nested list (default=")"); can also be a pyparsing expression - - content - expression for items within the nested lists (default=None) - - ignoreExpr - expression for ignoring opening and closing delimiters (default=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. - """ - if opener == closer: - raise ValueError("opening and closing strings cannot be the same") - 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("opening and closing arguments must be strings if no content expression is given") - ret = Forward() - if ignoreExpr is not None: - ret << Group( Suppress(opener) + ZeroOrMore( ignoreExpr | ret | content ) + Suppress(closer) ) - else: - ret << Group( Suppress(opener) + ZeroOrMore( ret | content ) + Suppress(closer) ) - return ret - -def indentedBlock(blockStatementExpr, indentStack, indent=True): - """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=True) - - A valid block must contain at least one C{blockStatement}. - """ - def checkPeerIndent(s,l,t): - if l >= len(s): return - curCol = col(l,s) - if curCol != indentStack[-1]: - if curCol > indentStack[-1]: - raise ParseFatalException(s,l,"illegal nesting") - raise ParseException(s,l,"not a peer entry") - - def checkSubIndent(s,l,t): - curCol = col(l,s) - if curCol > indentStack[-1]: - indentStack.append( curCol ) - else: - raise ParseException(s,l,"not a subentry") - - def checkUnindent(s,l,t): - if l >= len(s): return - curCol = col(l,s) - if not(indentStack and curCol < indentStack[-1] and curCol <= indentStack[-2]): - raise ParseException(s,l,"not an unindent") - indentStack.pop() - - NL = OneOrMore(LineEnd().setWhitespaceChars("\t ").suppress()) - INDENT = Empty() + Empty().setParseAction(checkSubIndent) - PEER = Empty().setParseAction(checkPeerIndent) - UNDENT = Empty().setParseAction(checkUnindent) - 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 - -alphas8bit = srange(r"[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]") -punc8bit = srange(r"[\0xa1-\0xbf\0xd7\0xf7]") - -anyOpenTag,anyCloseTag = makeHTMLTags(Word(alphas,alphanums+"_:")) -commonHTMLEntity = Combine(_L("&") + oneOf("gt lt amp nbsp quot").setResultsName("entity") +";").streamline() -_htmlEntityMap = dict(zip("gt lt amp nbsp quot".split(),'><& "')) -replaceHTMLEntity = lambda t : t.entity in _htmlEntityMap and _htmlEntityMap[t.entity] or None - -# it's easy to get these comment structures wrong - they're very common, so may as well make them available -cStyleComment = Regex(r"/\*(?:[^*]*\*+)+?/").setName("C style comment") - -htmlComment = Regex(r"") -restOfLine = Regex(r".*").leaveWhitespace() -dblSlashComment = Regex(r"\/\/(\\\n|.)*").setName("// comment") -cppStyleComment = Regex(r"/(?:\*(?:[^*]*\*+)+?/|/[^\n]*(?:\n[^\n]*)*?(?:(?" + str(tokenlist)) - print ("tokens = " + str(tokens)) - print ("tokens.columns = " + str(tokens.columns)) - print ("tokens.tables = " + str(tokens.tables)) - print (tokens.asXML("SQL",True)) - except ParseBaseException, err: - print (teststring + "->") - print (err.line) - print (" "*(err.column-1) + "^") - print (err) - print() - - selectToken = CaselessLiteral( "select" ) - fromToken = CaselessLiteral( "from" ) - - ident = Word( alphas, alphanums + "_$" ) - columnName = delimitedList( ident, ".", combine=True ).setParseAction( upcaseTokens ) - columnNameList = Group( delimitedList( columnName ) )#.setName("columns") - tableName = delimitedList( ident, ".", combine=True ).setParseAction( upcaseTokens ) - tableNameList = Group( delimitedList( tableName ) )#.setName("tables") - simpleSQL = ( selectToken + \ - ( '*' | columnNameList ).setResultsName( "columns" ) + \ - fromToken + \ - tableNameList.setResultsName( "tables" ) ) - - test( "SELECT * from XYZZY, ABC" ) - test( "select * from SYS.XYZZY" ) - test( "Select A from Sys.dual" ) - test( "Select AA,BB,CC from Sys.dual" ) - test( "Select A, B, C from Sys.dual" ) - test( "Select A, B, C from Sys.dual" ) - test( "Xelect A, B, C from Sys.dual" ) - test( "Select A, B, C frox Sys.dual" ) - test( "Select" ) - test( "Select ^^^ frox Sys.dual" ) - test( "Select A, B, C from Sys.dual, Table2 " ) +# 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): +# """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{'+'} operator. +# """ +# +# class _ErrorStop(Empty): +# def __init__(self, *args, **kwargs): +# super(And._ErrorStop,self).__init__(*args, **kwargs) +# self.name = '-' +# self.leaveWhitespace() +# +# def __init__( self, exprs, savelist = True ): +# super(And,self).__init__(exprs, savelist) +# self.mayReturnEmpty = True +# for e in self.exprs: +# if not e.mayReturnEmpty: +# self.mayReturnEmpty = False +# break +# self.setWhitespaceChars( exprs[0].whiteChars ) +# self.skipWhitespace = 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, pe: +# raise ParseSyntaxException(pe) +# except IndexError: +# raise ParseSyntaxException( ParseException(instring, len(instring), self.errmsg, self) ) +# else: +# loc, exprtokens = e._parse( instring, loc, doActions ) +# if exprtokens or exprtokens.keys(): +# resultlist += exprtokens +# return loc, resultlist +# +# def __iadd__(self, other ): +# if isinstance( other, basestring ): +# other = Literal( 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,"name"): +# return self.name +# +# if self.strRepr is None: +# self.strRepr = "{" + " ".join( [ _ustr(e) for e in self.exprs ] ) + "}" +# +# return self.strRepr +# +# +# class Or(ParseExpression): +# """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{'^'} operator. +# """ +# def __init__( self, exprs, savelist = False ): +# super(Or,self).__init__(exprs, savelist) +# self.mayReturnEmpty = False +# for e in self.exprs: +# if e.mayReturnEmpty: +# self.mayReturnEmpty = True +# break +# +# def parseImpl( self, instring, loc, doActions=True ): +# maxExcLoc = -1 +# maxMatchLoc = -1 +# maxException = None +# for e in self.exprs: +# try: +# loc2 = e.tryParse( instring, loc ) +# except ParseException, err: +# if err.loc > maxExcLoc: +# maxException = err +# maxExcLoc = err.loc +# except IndexError: +# if len(instring) > maxExcLoc: +# maxException = ParseException(instring,len(instring),e.errmsg,self) +# maxExcLoc = len(instring) +# else: +# if loc2 > maxMatchLoc: +# maxMatchLoc = loc2 +# maxMatchExp = e +# +# if maxMatchLoc < 0: +# if maxException is not None: +# raise maxException +# else: +# raise ParseException(instring, loc, "no defined alternatives to match", self) +# +# return maxMatchExp._parse( instring, loc, doActions ) +# +# 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,"name"): +# return self.name +# +# if self.strRepr is None: +# self.strRepr = "{" + " ^ ".join( [ _ustr(e) for e in self.exprs ] ) + "}" +# +# return self.strRepr +# +# def checkRecursion( self, parseElementList ): +# subRecCheckList = parseElementList[:] + [ self ] +# for e in self.exprs: +# e.checkRecursion( subRecCheckList ) +# +# +# class MatchFirst(ParseExpression): +# """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{'|'} operator. +# """ +# def __init__( self, exprs, savelist = False ): +# super(MatchFirst,self).__init__(exprs, savelist) +# if exprs: +# self.mayReturnEmpty = False +# for e in self.exprs: +# if e.mayReturnEmpty: +# self.mayReturnEmpty = True +# break +# 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, err: +# if err.loc > maxExcLoc: +# maxException = err +# maxExcLoc = err.loc +# except IndexError: +# if len(instring) > 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: +# raise maxException +# else: +# raise ParseException(instring, loc, "no defined alternatives to match", 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,"name"): +# return self.name +# +# if self.strRepr is None: +# self.strRepr = "{" + " | ".join( [ _ustr(e) for e in self.exprs ] ) + "}" +# +# return self.strRepr +# +# def checkRecursion( self, parseElementList ): +# subRecCheckList = parseElementList[:] + [ self ] +# for e in self.exprs: +# e.checkRecursion( subRecCheckList ) +# +# +# class Each(ParseExpression): +# """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{'&'} operator. +# """ +# def __init__( self, exprs, savelist = True ): +# super(Each,self).__init__(exprs, savelist) +# self.mayReturnEmpty = True +# for e in self.exprs: +# if not e.mayReturnEmpty: +# self.mayReturnEmpty = False +# break +# self.skipWhitespace = True +# self.initExprGroups = True +# +# def parseImpl( self, instring, loc, doActions=True ): +# if self.initExprGroups: +# opt1 = [ e.expr for e in self.exprs if isinstance(e,Optional) ] +# opt2 = [ e for e in self.exprs if e.mayReturnEmpty and e not in opt1 ] +# 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(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 = ", ".join( [ _ustr(e) for e in tmpReqd ] ) +# raise ParseException(instring,loc,"Missing one or more required elements (%s)" % 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 = ParseResults([]) +# for r in resultlist: +# dups = {} +# for k in r.keys(): +# if k in finalResults.keys(): +# tmp = ParseResults(finalResults[k]) +# tmp += ParseResults(r[k]) +# dups[k] = tmp +# finalResults += ParseResults(r) +# for k,v in dups.items(): +# finalResults[k] = v +# return loc, finalResults +# +# def __str__( self ): +# if hasattr(self,"name"): +# return self.name +# +# if self.strRepr is None: +# self.strRepr = "{" + " & ".join( [ _ustr(e) for e in self.exprs ] ) + "}" +# +# return self.strRepr +# +# def checkRecursion( self, parseElementList ): +# subRecCheckList = parseElementList[:] + [ self ] +# for e in self.exprs: +# e.checkRecursion( subRecCheckList ) +# +# +# class ParseElementEnhance(ParserElement): +# """Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.""" +# def __init__( self, expr, savelist=False ): +# super(ParseElementEnhance,self).__init__(savelist) +# if isinstance( expr, basestring ): +# expr = 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("",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: +# pass +# +# if self.strRepr is None and self.expr is not None: +# self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.expr) ) +# return self.strRepr +# +# +# class FollowedBy(ParseElementEnhance): +# """Lookahead matching of the given parse expression. C{FollowedBy} +# does *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.""" +# 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): +# """Lookahead to disallow matching with the given parse expression. C{NotAny} +# does *not* advance the parsing position within the input string, it only +# verifies that the specified parse expression does *not* match at the current +# position. Also, C{NotAny} does *not* skip over leading whitespace. C{NotAny} +# always returns a null token list. May be constructed using the '~' operator.""" +# def __init__( self, expr ): +# super(NotAny,self).__init__(expr) +# #~ self.leaveWhitespace() +# self.skipWhitespace = False # do NOT use self.leaveWhitespace(), don't want to propagate to exprs +# self.mayReturnEmpty = True +# self.errmsg = "Found unwanted token, "+_ustr(self.expr) +# +# def parseImpl( self, instring, loc, doActions=True ): +# try: +# self.expr.tryParse( instring, loc ) +# except (ParseException,IndexError): +# pass +# else: +# #~ raise ParseException(instring, loc, self.errmsg ) +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# return loc, [] +# +# def __str__( self ): +# if hasattr(self,"name"): +# return self.name +# +# if self.strRepr is None: +# self.strRepr = "~{" + _ustr(self.expr) + "}" +# +# return self.strRepr +# +# +# class ZeroOrMore(ParseElementEnhance): +# """Optional repetition of zero or more of the given expression.""" +# def __init__( self, expr ): +# super(ZeroOrMore,self).__init__(expr) +# self.mayReturnEmpty = True +# +# def parseImpl( self, instring, loc, doActions=True ): +# tokens = [] +# try: +# loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False ) +# hasIgnoreExprs = ( len(self.ignoreExprs) > 0 ) +# while 1: +# if hasIgnoreExprs: +# preloc = self._skipIgnorables( instring, loc ) +# else: +# preloc = loc +# loc, tmptokens = self.expr._parse( instring, preloc, doActions ) +# if tmptokens or tmptokens.keys(): +# tokens += tmptokens +# except (ParseException,IndexError): +# pass +# +# return loc, tokens +# +# def __str__( self ): +# if hasattr(self,"name"): +# return self.name +# +# if self.strRepr is None: +# self.strRepr = "[" + _ustr(self.expr) + "]..." +# +# return self.strRepr +# +# def setResultsName( self, name, listAllMatches=False ): +# ret = super(ZeroOrMore,self).setResultsName(name,listAllMatches) +# ret.saveAsList = True +# return ret +# +# +# class OneOrMore(ParseElementEnhance): +# """Repetition of one or more of the given expression.""" +# def parseImpl( self, instring, loc, doActions=True ): +# # must be at least one +# loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False ) +# try: +# hasIgnoreExprs = ( len(self.ignoreExprs) > 0 ) +# while 1: +# if hasIgnoreExprs: +# preloc = self._skipIgnorables( instring, loc ) +# else: +# preloc = loc +# loc, tmptokens = self.expr._parse( instring, preloc, doActions ) +# if tmptokens or tmptokens.keys(): +# tokens += tmptokens +# except (ParseException,IndexError): +# pass +# +# return loc, tokens +# +# def __str__( self ): +# if hasattr(self,"name"): +# return self.name +# +# if self.strRepr is None: +# self.strRepr = "{" + _ustr(self.expr) + "}..." +# +# return self.strRepr +# +# def setResultsName( self, name, listAllMatches=False ): +# ret = super(OneOrMore,self).setResultsName(name,listAllMatches) +# ret.saveAsList = True +# return ret +# +# class _NullToken(object): +# def __bool__(self): +# return False +# __nonzero__ = __bool__ +# def __str__(self): +# return "" +# +# _optionalNotMatched = _NullToken() +# class Optional(ParseElementEnhance): +# """Optional matching of the given expression. +# A default return string can also be specified, if the optional expression +# is not found. +# """ +# def __init__( self, exprs, default=_optionalNotMatched ): +# super(Optional,self).__init__( exprs, savelist=False ) +# 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,"name"): +# return self.name +# +# if self.strRepr is None: +# self.strRepr = "[" + _ustr(self.expr) + "]" +# +# return self.strRepr +# +# +# class SkipTo(ParseElementEnhance): +# """Token for skipping over all undefined text until the matched expression is found. +# If C{include} is set to true, the matched expression is also parsed (the skipped text +# and matched expression are returned as a 2-element list). The C{ignore} +# argument is used to define grammars (typically quoted strings and comments) that +# might contain false matches. +# """ +# 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 failOn is not None and isinstance(failOn, basestring): +# self.failOn = Literal(failOn) +# else: +# self.failOn = failOn +# self.errmsg = "No match found for "+_ustr(self.expr) +# +# def parseImpl( self, instring, loc, doActions=True ): +# startLoc = loc +# instrlen = len(instring) +# expr = self.expr +# failParse = False +# while loc <= instrlen: +# try: +# if self.failOn: +# try: +# self.failOn.tryParse(instring, loc) +# except ParseBaseException: +# pass +# else: +# failParse = True +# raise ParseException(instring, loc, "Found expression " + str(self.failOn)) +# failParse = False +# if self.ignoreExpr is not None: +# while 1: +# try: +# loc = self.ignoreExpr.tryParse(instring,loc) +# # print "found ignoreExpr, advance to", loc +# except ParseBaseException: +# break +# expr._parse( instring, loc, doActions=False, callPreParse=False ) +# skipText = instring[startLoc:loc] +# if self.includeMatch: +# loc,mat = expr._parse(instring,loc,doActions,callPreParse=False) +# if mat: +# skipRes = ParseResults( skipText ) +# skipRes += mat +# return loc, [ skipRes ] +# else: +# return loc, [ skipText ] +# else: +# return loc, [ skipText ] +# except (ParseException,IndexError): +# if failParse: +# raise +# else: +# loc += 1 +# exc = self.myException +# exc.loc = loc +# exc.pstr = instring +# raise exc +# +# class Forward(ParseElementEnhance): +# """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 '<<' operator. +# +# Note: take care when assigning to C{Forward} not to overlook precedence of operators. +# Specifically, '|' has a lower precedence than '<<', so that:: +# fwdExpr << a | b | c +# will actually be evaluated as:: +# (fwdExpr << 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 << (a | b | c) +# Converting to use the '<<=' operator instead will avoid this problem. +# """ +# 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.mayReturnEmpty = other.mayReturnEmpty +# 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 None +# __ilshift__ = __lshift__ +# +# 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,"name"): +# return self.name +# +# self._revertClass = self.__class__ +# self.__class__ = _ForwardNoRecurse +# try: +# if self.expr is not None: +# retString = _ustr(self.expr) +# else: +# retString = "None" +# finally: +# self.__class__ = self._revertClass +# return self.__class__.__name__ + ": " + retString +# +# def copy(self): +# if self.expr is not None: +# return super(Forward,self).copy() +# else: +# ret = Forward() +# ret << self +# return ret +# +# class _ForwardNoRecurse(Forward): +# def __str__( self ): +# return "..." +# +# class TokenConverter(ParseElementEnhance): +# """Abstract subclass of C{ParseExpression}, for converting parsed results.""" +# def __init__( self, expr, savelist=False ): +# super(TokenConverter,self).__init__( expr )#, savelist ) +# self.saveAsList = False +# +# class Upcase(TokenConverter): +# """Converter to upper case all matching tokens.""" +# def __init__(self, *args): +# super(Upcase,self).__init__(*args) +# warnings.warn("Upcase class is deprecated, use upcaseTokens parse action instead", +# DeprecationWarning,stacklevel=2) +# +# def postParse( self, instring, loc, tokenlist ): +# return list(map( str.upper, tokenlist )) +# +# +# class Combine(TokenConverter): +# """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{'adjacent=False'} in the constructor. +# """ +# def __init__( self, expr, joinString="", 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([ "".join(tokenlist._asStringList(self.joinString)) ], modal=self.modalResults) +# +# if self.resultsName and len(retToks.keys())>0: +# return [ retToks ] +# else: +# return retToks +# +# class Group(TokenConverter): +# """Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.""" +# def __init__( self, expr ): +# super(Group,self).__init__( expr ) +# self.saveAsList = True +# +# def postParse( self, instring, loc, tokenlist ): +# return [ tokenlist ] +# +# class Dict(TokenConverter): +# """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. +# """ +# def __init__( self, exprs ): +# super(Dict,self).__init__( exprs ) +# 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("",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.keys()): +# tokenlist[ikey] = _ParseResultsWithOffset(dictvalue,i) +# else: +# tokenlist[ikey] = _ParseResultsWithOffset(dictvalue[0],i) +# +# if self.resultsName: +# return [ tokenlist ] +# else: +# return tokenlist +# +# +# class Suppress(TokenConverter): +# """Converter for ignoring the results of a parsed expression.""" +# def postParse( self, instring, loc, tokenlist ): +# return [] +# +# def suppress( self ): +# return self +# +# +# class OnlyOnce(object): +# """Wrapper for parse actions, to ensure they are only called once.""" +# 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,"") +# def reset(self): +# self.called = False +# +# def traceParseAction(f): +# """Decorator for debugging parse actions.""" +# f = _trim_arity(f) +# def z(*paArgs): +# thisFunc = f.func_name +# s,l,t = paArgs[-3:] +# if len(paArgs)>3: +# thisFunc = paArgs[0].__class__.__name__ + '.' + thisFunc +# sys.stderr.write( ">>entering %s(line: '%s', %d, %s)\n" % (thisFunc,line(l,s),l,t) ) +# try: +# ret = f(*paArgs) +# except Exception, exc: +# sys.stderr.write( "<", "|".join( [ _escapeRegexChars(sym) for sym in symbols] )) +# try: +# if len(symbols)==len("".join(symbols)): +# return Regex( "[%s]" % "".join( [ _escapeRegexRangeChars(sym) for sym in symbols] ) ) +# else: +# return Regex( "|".join( [ re.escape(sym) for sym in symbols] ) ) +# except: +# warnings.warn("Exception creating Regex for oneOf, building MatchFirst", +# SyntaxWarning, stacklevel=2) +# +# +# # last resort, just use MatchFirst +# return MatchFirst( [ parseElementClass(sym) for sym in symbols ] ) +# +# def dictOf( key, value ): +# """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. +# """ +# return Dict( ZeroOrMore( Group ( key + value ) ) ) +# +# def originalTextFor(expr, asString=True): +# """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. Simpler to use than the parse action C{L{keepOriginalText}}, and does not +# require the inspect module to chase up the call stack. By default, returns a +# string 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.""" +# locMarker = Empty().setParseAction(lambda s,loc,t: loc) +# endlocMarker = locMarker.copy() +# endlocMarker.callPreparse = False +# matchExpr = locMarker("_original_start") + expr + endlocMarker("_original_end") +# if asString: +# extractText = lambda s,l,t: s[t._original_start:t._original_end] +# else: +# def extractText(s,l,t): +# del t[:] +# t.insert(0, s[t._original_start:t._original_end]) +# del t["_original_start"] +# del t["_original_end"] +# matchExpr.setParseAction(extractText) +# return matchExpr +# +# def ungroup(expr): +# """Helper to undo pyparsing's default grouping of And expressions, even +# if all but one are non-empty.""" +# return TokenConverter(expr).setParseAction(lambda t:t[0]) +# +# # convenience constants for positional expressions +# empty = Empty().setName("empty") +# lineStart = LineStart().setName("lineStart") +# lineEnd = LineEnd().setName("lineEnd") +# stringStart = StringStart().setName("stringStart") +# stringEnd = StringEnd().setName("stringEnd") +# +# _escapedPunc = Word( _bslash, r"\[]-*.$+^?()~ ", exact=2 ).setParseAction(lambda s,l,t:t[0][1]) +# _printables_less_backslash = "".join([ c for c in printables if c not in r"\]" ]) +# _escapedHexChar = Regex(r"\\0?[xX][0-9a-fA-F]+").setParseAction(lambda s,l,t:unichr(int(t[0].lstrip(r'\0x'),16))) +# _escapedOctChar = Regex(r"\\0[0-7]+").setParseAction(lambda s,l,t:unichr(int(t[0][1:],8))) +# _singleChar = _escapedPunc | _escapedHexChar | _escapedOctChar | Word(_printables_less_backslash,exact=1) +# _charRange = Group(_singleChar + Suppress("-") + _singleChar) +# _reBracketExpr = Literal("[") + Optional("^").setResultsName("negate") + Group( OneOrMore( _charRange | _singleChar ) ).setResultsName("body") + "]" +# +# _expanded = lambda p: (isinstance(p,ParseResults) and ''.join([ unichr(c) for c in range(ord(p[0]),ord(p[1])+1) ]) or p) +# +# def srange(s): +# r"""Helper to easily define string ranges for use in Word construction. Borrows +# syntax from regexp '[]' string range definitions:: +# srange("[0-9]") -> "0123456789" +# srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz" +# srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_" +# The input string must be enclosed in []'s, and the returned string is the expanded +# character set joined into a single string. +# The values enclosed in the []'s may be:: +# a single character +# an escaped character with a leading backslash (such as \- or \]) +# an escaped hex character with a leading '\x' (\x21, which is a '!' character) +# (\0x## is also supported for backwards compatibility) +# an escaped octal character with a leading '\0' (\041, which is a '!' character) +# a range of any of the above, separated by a dash ('a-z', etc.) +# any combination of the above ('aeiouy', 'a-zA-Z0-9_$', etc.) +# """ +# try: +# return "".join([_expanded(part) for part in _reBracketExpr.parseString(s).body]) +# except: +# return "" +# +# def matchOnlyAtCol(n): +# """Helper method for defining parse actions that require matching at a specific +# column in the input text. +# """ +# def verifyCol(strg,locn,toks): +# if col(locn,strg) != n: +# raise ParseException(strg,locn,"matched token not at column %d" % n) +# return verifyCol +# +# def replaceWith(replStr): +# """Helper method for common parse actions that simply return a literal value. Especially +# useful when used with C{L{transformString}()}. +# """ +# def _replFunc(*args): +# return [replStr] +# return _replFunc +# +# def removeQuotes(s,l,t): +# """Helper parse action for removing quotation marks from parsed quoted strings. +# To use, add this parse action to quoted string using:: +# quotedString.setParseAction( removeQuotes ) +# """ +# return t[0][1:-1] +# +# def upcaseTokens(s,l,t): +# """Helper parse action to convert tokens to upper case.""" +# return [ tt.upper() for tt in map(_ustr,t) ] +# +# def downcaseTokens(s,l,t): +# """Helper parse action to convert tokens to lower case.""" +# return [ tt.lower() for tt in map(_ustr,t) ] +# +# def keepOriginalText(s,startLoc,t): +# """DEPRECATED - use new helper method C{L{originalTextFor}}. +# Helper parse action to preserve original parsed text, +# overriding any nested parse actions.""" +# try: +# endloc = getTokensEndLoc() +# except ParseException: +# raise ParseFatalException("incorrect usage of keepOriginalText - may only be called as a parse action") +# del t[:] +# t += ParseResults(s[startLoc:endloc]) +# return t +# +# def getTokensEndLoc(): +# """Method to be called from within a parse action to determine the end +# location of the parsed tokens.""" +# import inspect +# fstack = inspect.stack() +# try: +# # search up the stack (through intervening argument normalizers) for correct calling routine +# for f in fstack[2:]: +# if f[3] == "_parseNoCache": +# endloc = f[0].f_locals["loc"] +# return endloc +# else: +# raise ParseFatalException("incorrect usage of getTokensEndLoc - may only be called from within a parse action") +# finally: +# del fstack +# +# def _makeTags(tagStr, xml): +# """Internal helper to construct opening and closing tag expressions, given a tag name""" +# if isinstance(tagStr,basestring): +# resname = tagStr +# tagStr = Keyword(tagStr, caseless=not xml) +# else: +# resname = tagStr.name +# +# tagAttrName = Word(alphas,alphanums+"_-:") +# if (xml): +# tagAttrValue = dblQuotedString.copy().setParseAction( removeQuotes ) +# openTag = Suppress("<") + tagStr("tag") + \ +# Dict(ZeroOrMore(Group( tagAttrName + Suppress("=") + tagAttrValue ))) + \ +# Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">") +# else: +# printablesLessRAbrack = "".join( [ c for c in printables if c not in ">" ] ) +# tagAttrValue = quotedString.copy().setParseAction( removeQuotes ) | Word(printablesLessRAbrack) +# openTag = Suppress("<") + tagStr("tag") + \ +# Dict(ZeroOrMore(Group( tagAttrName.setParseAction(downcaseTokens) + \ +# Optional( Suppress("=") + tagAttrValue ) ))) + \ +# Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">") +# closeTag = Combine(_L("") +# +# openTag = openTag.setResultsName("start"+"".join(resname.replace(":"," ").title().split())).setName("<%s>" % tagStr) +# closeTag = closeTag.setResultsName("end"+"".join(resname.replace(":"," ").title().split())).setName("" % tagStr) +# openTag.tag = resname +# closeTag.tag = resname +# return openTag, closeTag +# +# def makeHTMLTags(tagStr): +# """Helper to construct opening and closing tag expressions for HTML, given a tag name""" +# return _makeTags( tagStr, False ) +# +# def makeXMLTags(tagStr): +# """Helper to construct opening and closing tag expressions for XML, given a tag name""" +# return _makeTags( tagStr, True ) +# +# def withAttribute(*args,**attrDict): +# """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{} or C{
}. +# +# 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="right")}, or +# - as an explicit dict with C{**} operator, when an attribute name is also a Python +# reserved word, as in C{**{"class":"Customer", "align":"right"}} +# - a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") ) +# For attribute names with a namespace prefix, you must use the second form. Attribute +# names are matched insensitive to upper/lower case. +# +# To verify that the attribute exists, but without specifying a value, pass +# C{withAttribute.ANY_VALUE} as the value. +# """ +# 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,"no matching attribute " + attrName) +# if attrValue != withAttribute.ANY_VALUE and tokens[attrName] != attrValue: +# raise ParseException(s,l,"attribute '%s' has value '%s', must be '%s'" % +# (attrName, tokens[attrName], attrValue)) +# return pa +# withAttribute.ANY_VALUE = object() +# +# opAssoc = _Constants() +# opAssoc.LEFT = object() +# opAssoc.RIGHT = object() +# +# def infixNotation( baseExpr, opList, lpar=Suppress('('), rpar=Suppress(')') ): +# """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. +# +# 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=Suppress('(')) +# - rpar - expression for matching right-parentheses (default=Suppress(')')) +# """ +# ret = Forward() +# lastExpr = baseExpr | ( lpar + ret + rpar ) +# for i,operDef in enumerate(opList): +# opExpr,arity,rightLeftAssoc,pa = (operDef + (None,))[:4] +# if arity == 3: +# if opExpr is None or len(opExpr) != 2: +# raise ValueError("if numterms=3, opExpr must be a tuple or list of two expressions") +# opExpr1, opExpr2 = opExpr +# thisExpr = Forward()#.setName("expr%d" % i) +# 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("operator must be unary (1), binary (2), or ternary (3)") +# 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("operator must be unary (1), binary (2), or ternary (3)") +# else: +# raise ValueError("operator must indicate right or left associativity") +# if pa: +# matchExpr.setParseAction( pa ) +# thisExpr << ( matchExpr | lastExpr ) +# lastExpr = thisExpr +# ret << lastExpr +# return ret +# operatorPrecedence = infixNotation +# +# dblQuotedString = Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\x[0-9a-fA-F]+)|(?:\\.))*"').setName("string enclosed in double quotes") +# sglQuotedString = Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\x[0-9a-fA-F]+)|(?:\\.))*'").setName("string enclosed in single quotes") +# quotedString = Regex(r'''(?:"(?:[^"\n\r\\]|(?:"")|(?:\\x[0-9a-fA-F]+)|(?:\\.))*")|(?:'(?:[^'\n\r\\]|(?:'')|(?:\\x[0-9a-fA-F]+)|(?:\\.))*')''').setName("quotedString using single or double quotes") +# unicodeString = Combine(_L('u') + quotedString.copy()) +# +# def nestedExpr(opener="(", closer=")", content=None, ignoreExpr=quotedString.copy()): +# """Helper method for defining nested lists enclosed in opening and closing +# delimiters ("(" and ")" are the default). +# +# Parameters: +# - opener - opening character for a nested list (default="("); can also be a pyparsing expression +# - closer - closing character for a nested list (default=")"); can also be a pyparsing expression +# - content - expression for items within the nested lists (default=None) +# - ignoreExpr - expression for ignoring opening and closing delimiters (default=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. +# """ +# if opener == closer: +# raise ValueError("opening and closing strings cannot be the same") +# 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("opening and closing arguments must be strings if no content expression is given") +# ret = Forward() +# if ignoreExpr is not None: +# ret << Group( Suppress(opener) + ZeroOrMore( ignoreExpr | ret | content ) + Suppress(closer) ) +# else: +# ret << Group( Suppress(opener) + ZeroOrMore( ret | content ) + Suppress(closer) ) +# return ret +# +# def indentedBlock(blockStatementExpr, indentStack, indent=True): +# """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=True) +# +# A valid block must contain at least one C{blockStatement}. +# """ +# def checkPeerIndent(s,l,t): +# if l >= len(s): return +# curCol = col(l,s) +# if curCol != indentStack[-1]: +# if curCol > indentStack[-1]: +# raise ParseFatalException(s,l,"illegal nesting") +# raise ParseException(s,l,"not a peer entry") +# +# def checkSubIndent(s,l,t): +# curCol = col(l,s) +# if curCol > indentStack[-1]: +# indentStack.append( curCol ) +# else: +# raise ParseException(s,l,"not a subentry") +# +# def checkUnindent(s,l,t): +# if l >= len(s): return +# curCol = col(l,s) +# if not(indentStack and curCol < indentStack[-1] and curCol <= indentStack[-2]): +# raise ParseException(s,l,"not an unindent") +# indentStack.pop() +# +# NL = OneOrMore(LineEnd().setWhitespaceChars("\t ").suppress()) +# INDENT = Empty() + Empty().setParseAction(checkSubIndent) +# PEER = Empty().setParseAction(checkPeerIndent) +# UNDENT = Empty().setParseAction(checkUnindent) +# 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 +# +# alphas8bit = srange(r"[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]") +# punc8bit = srange(r"[\0xa1-\0xbf\0xd7\0xf7]") +# +# anyOpenTag,anyCloseTag = makeHTMLTags(Word(alphas,alphanums+"_:")) +# commonHTMLEntity = Combine(_L("&") + oneOf("gt lt amp nbsp quot").setResultsName("entity") +";").streamline() +# _htmlEntityMap = dict(zip("gt lt amp nbsp quot".split(),'><& "')) +# replaceHTMLEntity = lambda t : t.entity in _htmlEntityMap and _htmlEntityMap[t.entity] or None +# +# # it's easy to get these comment structures wrong - they're very common, so may as well make them available +# cStyleComment = Regex(r"/\*(?:[^*]*\*+)+?/").setName("C style comment") +# +# htmlComment = Regex(r"") +# restOfLine = Regex(r".*").leaveWhitespace() +# dblSlashComment = Regex(r"\/\/(\\\n|.)*").setName("// comment") +# cppStyleComment = Regex(r"/(?:\*(?:[^*]*\*+)+?/|/[^\n]*(?:\n[^\n]*)*?(?:(?" + str(tokenlist)) +# print ("tokens = " + str(tokens)) +# print ("tokens.columns = " + str(tokens.columns)) +# print ("tokens.tables = " + str(tokens.tables)) +# print (tokens.asXML("SQL",True)) +# except ParseBaseException, err: +# print (teststring + "->") +# print (err.line) +# print (" "*(err.column-1) + "^") +# print (err) +# print() +# +# selectToken = CaselessLiteral( "select" ) +# fromToken = CaselessLiteral( "from" ) +# +# ident = Word( alphas, alphanums + "_$" ) +# columnName = delimitedList( ident, ".", combine=True ).setParseAction( upcaseTokens ) +# columnNameList = Group( delimitedList( columnName ) )#.setName("columns") +# tableName = delimitedList( ident, ".", combine=True ).setParseAction( upcaseTokens ) +# tableNameList = Group( delimitedList( tableName ) )#.setName("tables") +# simpleSQL = ( selectToken + \ +# ( '*' | columnNameList ).setResultsName( "columns" ) + \ +# fromToken + \ +# tableNameList.setResultsName( "tables" ) ) +# +# test( "SELECT * from XYZZY, ABC" ) +# test( "select * from SYS.XYZZY" ) +# test( "Select A from Sys.dual" ) +# test( "Select AA,BB,CC from Sys.dual" ) +# test( "Select A, B, C from Sys.dual" ) +# test( "Select A, B, C from Sys.dual" ) +# test( "Xelect A, B, C from Sys.dual" ) +# test( "Select A, B, C frox Sys.dual" ) +# test( "Select" ) +# test( "Select ^^^ frox Sys.dual" ) +# test( "Select A, B, C from Sys.dual, Table2 " ) diff --git a/src/calibre/utils/search_query_parser.py b/src/calibre/utils/search_query_parser.py index cbf1e1b245be..ecf3e11ce82e 100644 --- a/src/calibre/utils/search_query_parser.py +++ b/src/calibre/utils/search_query_parser.py @@ -16,11 +16,9 @@ If this module is run, it will perform a series of unit tests. ''' -import sys, operator, weakref +import sys, operator, weakref, re -from calibre.utils.pyparsing import (CaselessKeyword, Group, Forward, - CharsNotIn, Suppress, OneOrMore, MatchFirst, CaselessLiteral, - Optional, NoMatch, ParseException, QuotedString) +from calibre.utils.pyparsing import ParseException from calibre.constants import preferred_encoding from calibre.utils.icu import sort_key from calibre import prints @@ -96,6 +94,138 @@ def saved_searches(): global ss return ss +''' +Parse a search expression into a series of potentially recursive operations. + +The syntax is a bit twisted. + +prog ::= or_expression + +or_expression ::= and_expression [ 'or' or_expression ] + +and_expression ::= not_expression [ ( [ 'and' ] and_expression ) | ( '(' or_expression ')' ) ] + +not_expression ::= [ 'not' ] base_token + +base_token ::= location_expression | ( '(' or_expression ')' ) + +location_expression ::= [ word [ ':' word ]* +''' +class Parser(object): + + def __init__(self): + self.current_token = 0 + self.tokens = None + + OPCODE = 1 + WORD = 2 + EOF = 3 + + # Had to translate named constants to numeric values + lex_scanner = re.Scanner([ + (r'[():]', lambda x,t: (1, t)), + (r'[^ "():]+', lambda x,t: (2, unicode(t))), + (r'".*?((?= len(self.tokens) + + def advance(self): + self.current_token += 1 + + def parse(self, expr, locations): + self.locations = locations + self.tokens = self.lex_scanner.scan(icu_lower(expr))[0] + self.current_token = 0 + prog = self.or_expression() + if not self.is_eof(): + raise ParseException(_('Extra characters at end of search')) + # prints(self.tokens, '\n', prog) + return prog + + def or_expression(self): + lhs = self.and_expression() + if self.is_eof(): + return lhs + if self.token() == 'or': + self.advance() + return ['or', lhs, self.or_expression()] + return lhs + + def and_expression(self): + lhs = self.not_expression() + if self.is_eof(): + return lhs + if self.token() == 'and': + self.advance() + return ['and', lhs, self.and_expression()] + + # Account for the optional 'and' + if self.token_type() == self.WORD and self.token() != 'or': + return ['and', lhs, self.and_expression()] + elif self.token() == '(': + self.advance() + rhs = self.or_expression() + if self.token() != ')': + raise ParseException('missing )') + else: + self.advance(); + return ['and', lhs, rhs] + return lhs + + def not_expression(self): + if self.token() == 'not': + self.advance() + return ['not', self.not_expression()] + return self.base_token() + + def base_token(self): + if self.token() == '(': + self.advance() + res = self.or_expression() + if self.token() != ')': + raise ParseException('missing )') + self.advance() + return res + if self.token_type() != self.WORD: + raise ParseException('Invalid syntax. Expected a lookup name or a word') + + return self.location_expression() + + def location_expression(self): + loc = self.token() + self.advance() + if self.token() == ':': + if loc in self.locations: + val = '' + else: + val = loc + ':' + loc = 'all' + + self.advance() + while True: + val += self.token() + self.advance() + if self.token() == ':': + val += ':' + self.advance() + else: + break + return ['token', loc, val] + return ['token', 'all', loc] + class SearchQueryParser(object): ''' Parses a search query. @@ -139,65 +269,9 @@ def sqp_change_locations(self, locations): self.sqp_initialize(locations, optimize=self.optimize) def sqp_initialize(self, locations, test=False, optimize=False): + self.locations = locations self._tests_failed = False self.optimize = optimize - # Define a token - standard_locations = map(lambda x : CaselessLiteral(x)+Suppress(':'), - locations) - location = NoMatch() - for l in standard_locations: - location |= l - location = Optional(location, default='all') - word_query = CharsNotIn(u'\t\r\n\u00a0 ' + u'()') - #quoted_query = Suppress('"')+CharsNotIn('"')+Suppress('"') - quoted_query = QuotedString('"', escChar='\\') - query = quoted_query | word_query - Token = Group(location + query).setResultsName('token') - - if test: - print 'Testing Token parser:' - Token.validate() - failed = SearchQueryParser.run_tests(Token, 'token', - ( - ('tag:asd', ['tag', 'asd']), - (u'ddsä', ['all', u'ddsä']), - ('"one \\"two"', ['all', 'one "two']), - ('title:"one \\"1.5\\" two"', ['title', 'one "1.5" two']), - ('title:abc"def', ['title', 'abc"def']), - ) - ) - - Or = Forward() - - Parenthesis = Group( - Suppress('(') + Or + Suppress(')') - ).setResultsName('parenthesis') | Token - - - Not = Forward() - Not << (Group( - Suppress(CaselessKeyword("not")) + Not - ).setResultsName("not") | Parenthesis) - - And = Forward() - And << (Group( - Not + Suppress(CaselessKeyword("and")) + And - ).setResultsName("and") | Group( - Not + OneOrMore(~MatchFirst(list(map(CaselessKeyword, - ('and', 'or')))) + And) - ).setResultsName("and") | Not) - - Or << (Group( - And + Suppress(CaselessKeyword("or")) + Or - ).setResultsName("or") | And) - - if test: - #Or.validate() - self._tests_failed = bool(failed) - - self._parser = Or - self._parser.setDebug(False) - def parse(self, query): # empty the list of searches used for recursion testing @@ -213,9 +287,8 @@ def parse(self, query): def _parse(self, query, candidates=None): self.recurse_level += 1 try: - res = self._parser.parseString(query)[0] + res = Parser().parse(query, self.locations) except RuntimeError: - import repr raise ParseException('Failed to parse query, recursion limit reached: %s'%repr(query)) if candidates is None: candidates = self.universal_set() @@ -227,7 +300,7 @@ def method(self, group_name): return getattr(self, 'evaluate_'+group_name) def evaluate(self, parse_result, candidates): - return self.method(parse_result.getName())(parse_result, candidates) + return self.method(parse_result[0])(parse_result[1:], candidates) def evaluate_and(self, argument, candidates): # RHS checks only those items matched by LHS @@ -249,8 +322,8 @@ def evaluate_not(self, argument, candidates): # return self.universal_set().difference(self.evaluate(argument[0])) return candidates.difference(self.evaluate(argument[0], candidates)) - def evaluate_parenthesis(self, argument, candidates): - return self.evaluate(argument[0], candidates) +# def evaluate_parenthesis(self, argument, candidates): +# return self.evaluate(argument[0], candidates) def evaluate_token(self, argument, candidates): location = argument[0] From 5fc450313ceb35aa8e7191c98c23f789d89b34b3 Mon Sep 17 00:00:00 2001 From: Charles Haley <> Date: Thu, 18 Apr 2013 11:33:44 +0200 Subject: [PATCH 3/5] Improvements to the new query parser. In particular, handle more degenerate cases where colons are significant in the query. Also make the implementation and the grammer more closely resemble each other. --- src/calibre/utils/search_query_parser.py | 112 ++++++++++++----------- 1 file changed, 59 insertions(+), 53 deletions(-) diff --git a/src/calibre/utils/search_query_parser.py b/src/calibre/utils/search_query_parser.py index ecf3e11ce82e..29573cb9c929 100644 --- a/src/calibre/utils/search_query_parser.py +++ b/src/calibre/utils/search_query_parser.py @@ -97,19 +97,28 @@ def saved_searches(): ''' Parse a search expression into a series of potentially recursive operations. -The syntax is a bit twisted. +Note that the interpreter wants binary operators, not n-ary ops. This is why we +recurse instead of iterating when building sequences of the same op. + +The syntax is more than a bit twisted. In particular, the handling of colons +in the base token requires semantic analysis. + +Also note that the query string is lowercased before analysis. This is OK because +calibre's searches are all case-insensitive. + +Grammar: prog ::= or_expression or_expression ::= and_expression [ 'or' or_expression ] -and_expression ::= not_expression [ ( [ 'and' ] and_expression ) | ( '(' or_expression ')' ) ] +and_expression ::= not_expression [ [ 'and' ] and_expression ] -not_expression ::= [ 'not' ] base_token +not_expression ::= [ 'not' ] location_expression -base_token ::= location_expression | ( '(' or_expression ')' ) +location_expression ::= base_token | ( '(' or_expression ')' ) -location_expression ::= [ word [ ':' word ]* +base_token ::= a sequence of letters and colons, perhaps quoted ''' class Parser(object): @@ -119,20 +128,24 @@ def __init__(self): OPCODE = 1 WORD = 2 - EOF = 3 + QUOTED_WORD = 3 + EOF = 4 # Had to translate named constants to numeric values lex_scanner = re.Scanner([ - (r'[():]', lambda x,t: (1, t)), - (r'[^ "():]+', lambda x,t: (2, unicode(t))), - (r'".*?((? 1 and words[0] in self.locations: + loc = words[0] + words = words[1:] + if len(words) == 1 and self.token_type() == self.QUOTED_WORD: + return ['token', loc, self.token(advance=True)] + return ['token', loc, ':'.join(words)] + + return ['token', 'all', ':'.join(words)] class SearchQueryParser(object): ''' @@ -264,6 +269,7 @@ def run_tests(parser, result, tests): def __init__(self, locations, test=False, optimize=False): self.sqp_initialize(locations, test=test, optimize=optimize) + self.parser = Parser() def sqp_change_locations(self, locations): self.sqp_initialize(locations, optimize=self.optimize) @@ -287,7 +293,7 @@ def parse(self, query): def _parse(self, query, candidates=None): self.recurse_level += 1 try: - res = Parser().parse(query, self.locations) + res = self.parser.parse(query, self.locations) except RuntimeError: raise ParseException('Failed to parse query, recursion limit reached: %s'%repr(query)) if candidates is None: From 3e2b7691cd9a9444f8d38c7b2caa2504d11ff9af Mon Sep 17 00:00:00 2001 From: Charles Haley <> Date: Sat, 20 Apr 2013 08:39:27 +0200 Subject: [PATCH 4/5] Get rid of the redundant empty.png --- resources/images/empty.png | Bin 1164 -> 0 bytes src/calibre/gui2/search_restriction_mixin.py | 2 +- 2 files changed, 1 insertion(+), 1 deletion(-) delete mode 100644 resources/images/empty.png diff --git a/resources/images/empty.png b/resources/images/empty.png deleted file mode 100644 index f3f05d30921c094cd3fe03faf641aa7058877b22..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 1164 zcmeAS@N?(olHy`uVBq!ia0vp^4Is?H3?#oinD~={ftew|C&cytC>RZa5gY>h^*j<8 z7#JB!g8YIRMsPTQyv{ZKiw&@N;4JWnEM{QfI|9OtQ?>b|fr4tDE{-7;x85FPWCZe> i6#lQz^Kbw$k->X5hXw{lxz^>vAW=_OKbLh*2~7Yf{2Dv} diff --git a/src/calibre/gui2/search_restriction_mixin.py b/src/calibre/gui2/search_restriction_mixin.py index 0137cd1027a1..9abf9bcfa2ef 100644 --- a/src/calibre/gui2/search_restriction_mixin.py +++ b/src/calibre/gui2/search_restriction_mixin.py @@ -299,7 +299,7 @@ class SearchRestrictionMixin(object): def __init__(self): self.checked = QIcon(I('ok.png')) - self.empty = QIcon(I('empty.png')) + self.empty = QIcon(I('blank.png')) self.search_based_vl_name = None self.search_based_vl = None From e7d4bec981e57183a215c8867347f1fea4ab9bd6 Mon Sep 17 00:00:00 2001 From: Charles Haley <> Date: Sat, 20 Apr 2013 10:05:55 +0200 Subject: [PATCH 5/5] Eliminate pyparsing. Simplify ParseException --- src/calibre/db/search.py | 15 +- src/calibre/gui2/library/models.py | 2 +- src/calibre/gui2/search_restriction_mixin.py | 2 +- src/calibre/library/caches.py | 25 +- src/calibre/utils/pyparsing.py | 3725 ------------------ src/calibre/utils/search_query_parser.py | 23 +- src/calibre/web/feeds/recipes/model.py | 2 +- 7 files changed, 37 insertions(+), 3757 deletions(-) delete mode 100644 src/calibre/utils/pyparsing.py diff --git a/src/calibre/db/search.py b/src/calibre/db/search.py index c7fed18f9d76..4a6eace0f764 100644 --- a/src/calibre/db/search.py +++ b/src/calibre/db/search.py @@ -195,13 +195,13 @@ def __call__(self, query, field_iter): try: qd = now() - timedelta(int(num)) except: - raise ParseException(query, len(query), 'Number conversion error') + raise ParseException(_('Number conversion error: {0}').format(num)) field_count = 3 else: try: qd = parse_date(query, as_utc=False) except: - raise ParseException(query, len(query), 'Date conversion error') + raise ParseException(_('Date conversion error: {0}').format(query)) if '-' in query: field_count = query.count('-') + 1 else: @@ -285,8 +285,8 @@ def __call__(self, query, field_iter, location, datatype, candidates, is_many=Fa try: q = cast(query) * mult except: - raise ParseException(query, len(query), - 'Non-numeric value in query: %r'%query) + raise ParseException( + _('Non-numeric value in query: {0}').format(query)) for val, book_ids in field_iter(): if val is None: @@ -351,8 +351,8 @@ def __call__(self, query, field_iter, candidates, use_primary_find): if ':' in query: q = [q.strip() for q in query.split(':')] if len(q) != 2: - raise ParseException(query, len(query), - 'Invalid query format for colon-separated search') + raise ParseException( + _('Invalid query format for colon-separated search: {0}').format(query)) keyq, valq = q keyq_mkind, keyq = _matchkind(keyq) valq_mkind, valq = _matchkind(valq) @@ -465,7 +465,8 @@ def get_matches(self, location, query, candidates=None, if invert: matches = self.all_book_ids - matches return matches - raise ParseException(query, len(query), 'Recursive query group detected') + raise ParseException( + _('Recursive query group detected: {0}').format(query)) # If the user has asked to restrict searching over all field, apply # that restriction diff --git a/src/calibre/gui2/library/models.py b/src/calibre/gui2/library/models.py index a08c13c79b46..536f63d169d4 100644 --- a/src/calibre/gui2/library/models.py +++ b/src/calibre/gui2/library/models.py @@ -12,7 +12,7 @@ QModelIndex, QVariant, QDateTime, QColor, QPixmap) from calibre.gui2 import NONE, UNDEFINED_QDATETIME, error_dialog -from calibre.utils.pyparsing import ParseException +from calibre.utils.search_query_parser import ParseException from calibre.ebooks.metadata import fmt_sidx, authors_to_string, string_to_authors from calibre.ebooks.metadata.book.base import SafeFormat from calibre.ptempfile import PersistentTemporaryFile diff --git a/src/calibre/gui2/search_restriction_mixin.py b/src/calibre/gui2/search_restriction_mixin.py index 9abf9bcfa2ef..967cf9c04c34 100644 --- a/src/calibre/gui2/search_restriction_mixin.py +++ b/src/calibre/gui2/search_restriction_mixin.py @@ -13,7 +13,7 @@ from calibre.gui2 import error_dialog, question_dialog from calibre.gui2.widgets import ComboBoxWithHelp from calibre.utils.icu import sort_key -from calibre.utils.pyparsing import ParseException +from calibre.utils.search_query_parser import ParseException from calibre.utils.search_query_parser import saved_searches class SelectNames(QDialog): # {{{ diff --git a/src/calibre/library/caches.py b/src/calibre/library/caches.py index 048288ef7143..2b46ab922b8a 100644 --- a/src/calibre/library/caches.py +++ b/src/calibre/library/caches.py @@ -14,7 +14,7 @@ from calibre.utils.config import tweaks, prefs from calibre.utils.date import parse_date, now, UNDEFINED_DATE, clean_date_for_sort from calibre.utils.search_query_parser import SearchQueryParser -from calibre.utils.pyparsing import ParseException +from calibre.utils.search_query_parser import ParseException from calibre.utils.localization import (canonicalize_lang, lang_map, get_udc) from calibre.db.search import CONTAINS_MATCH, EQUALS_MATCH, REGEXP_MATCH, _match from calibre.ebooks.metadata import title_sort, author_to_author_sort @@ -366,25 +366,18 @@ def get_dates_matches(self, location, query, candidates): elif query in self.local_thismonth: qd = now() field_count = 2 - elif query.endswith(self.local_daysago): + elif query.endswith(self.local_daysago) or query.endswith(self.untrans_daysago): num = query[0:-self.local_daysago_len] try: qd = now() - timedelta(int(num)) except: - raise ParseException(query, len(query), 'Number conversion error', self) - field_count = 3 - elif query.endswith(self.untrans_daysago): - num = query[0:-self.untrans_daysago_len] - try: - qd = now() - timedelta(int(num)) - except: - raise ParseException(query, len(query), 'Number conversion error', self) + raise ParseException(_('Number conversion error: {0}').format(num)) field_count = 3 else: try: qd = parse_date(query, as_utc=False) except: - raise ParseException(query, len(query), 'Date conversion error', self) + raise ParseException(_('Date conversion error: {0}').format(query)) if '-' in query: field_count = query.count('-') + 1 else: @@ -460,8 +453,7 @@ def get_numeric_matches(self, location, query, candidates, val_func = None): try: q = cast(query) * mult except: - raise ParseException(query, len(query), - 'Non-numeric value in query', self) + raise ParseException(_('Non-numeric value in query: {0}').format(query)) for id_ in candidates: item = self._data[id_] @@ -501,12 +493,13 @@ def get_user_category_matches(self, location, query, candidates): return matches def get_keypair_matches(self, location, query, candidates): + print query matches = set([]) if query.find(':') >= 0: q = [q.strip() for q in query.split(':')] if len(q) != 2: - raise ParseException(query, len(query), - 'Invalid query format for colon-separated search', self) + raise ParseException( + _('Invalid query format for colon-separated search: {0}').format(query)) (keyq, valq) = q keyq_mkind, keyq = self._matchkind(keyq) valq_mkind, valq = self._matchkind(valq) @@ -655,7 +648,7 @@ def get_matches(self, location, query, candidates=None, if invert: matches = self.universal_set() - matches return matches - raise ParseException(query, len(query), 'Recursive query group detected', self) + raise ParseException(_('Recursive query group detected: {0}').format(query)) # apply the limit if appropriate if location == 'all' and prefs['limit_search_columns'] and \ diff --git a/src/calibre/utils/pyparsing.py b/src/calibre/utils/pyparsing.py deleted file mode 100644 index 5d3b0508796b..000000000000 --- a/src/calibre/utils/pyparsing.py +++ /dev/null @@ -1,3725 +0,0 @@ -# module pyparsing.py -# -# Copyright (c) 2003-2011 Paul T. McGuire -# -# Permission is hereby granted, free of charge, to any person obtaining -# a copy of this software and associated documentation files (the -# "Software"), 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 "AS IS", 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. -# -#from __future__ import generators - -# __doc__ = \ -# """ -# 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'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 "Hello, World!" (or any greeting of the form C{", !"}):: -# -# from pyparsing import Word, alphas -# -# # define grammar of a greeting -# greet = Word( alphas ) + "," + Word( alphas ) + "!" -# -# hello = "Hello, World!" -# print hello, "->", greet.parseString( hello ) -# -# The program outputs the following:: -# -# Hello, World! -> ['Hello', ',', 'World', '!'] -# -# The Python representation of the grammar is quite readable, owing to the self-explanatory -# class names, and the use of '+', '|' and '^' operators. -# -# The parsed results returned from C{parseString()} 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 "Hello,World!", "Hello , World !", etc.) -# - quoted strings -# - embedded comments -# """ -# -# __version__ = "1.5.7" -# __versionTime__ = "17 November 2012 16:18" -# __author__ = "Paul McGuire " -# -# import string -# from weakref import ref as wkref -# import copy -# import sys -# import warnings -# import re -# import sre_constants -# #~ sys.stderr.write( "testing pyparsing module, version %s, %s\n" % (__version__,__versionTime__ ) ) -# -# __all__ = [ -# 'And', 'CaselessKeyword', 'CaselessLiteral', 'CharsNotIn', 'Combine', 'Dict', 'Each', 'Empty', -# 'FollowedBy', 'Forward', 'GoToColumn', 'Group', 'Keyword', 'LineEnd', 'LineStart', 'Literal', -# 'MatchFirst', 'NoMatch', 'NotAny', 'OneOrMore', 'OnlyOnce', 'Optional', 'Or', -# 'ParseBaseException', 'ParseElementEnhance', 'ParseException', 'ParseExpression', 'ParseFatalException', -# 'ParseResults', 'ParseSyntaxException', 'ParserElement', 'QuotedString', 'RecursiveGrammarException', -# 'Regex', 'SkipTo', 'StringEnd', 'StringStart', 'Suppress', 'Token', 'TokenConverter', 'Upcase', -# 'White', 'Word', 'WordEnd', 'WordStart', 'ZeroOrMore', -# 'alphanums', 'alphas', 'alphas8bit', 'anyCloseTag', 'anyOpenTag', 'cStyleComment', 'col', -# 'commaSeparatedList', 'commonHTMLEntity', 'countedArray', 'cppStyleComment', 'dblQuotedString', -# 'dblSlashComment', 'delimitedList', 'dictOf', 'downcaseTokens', 'empty', 'hexnums', -# 'htmlComment', 'javaStyleComment', 'keepOriginalText', 'line', 'lineEnd', 'lineStart', 'lineno', -# 'makeHTMLTags', 'makeXMLTags', 'matchOnlyAtCol', 'matchPreviousExpr', 'matchPreviousLiteral', -# 'nestedExpr', 'nullDebugAction', 'nums', 'oneOf', 'opAssoc', 'operatorPrecedence', 'printables', -# 'punc8bit', 'pythonStyleComment', 'quotedString', 'removeQuotes', 'replaceHTMLEntity', -# 'replaceWith', 'restOfLine', 'sglQuotedString', 'srange', 'stringEnd', -# 'stringStart', 'traceParseAction', 'unicodeString', 'upcaseTokens', 'withAttribute', -# 'indentedBlock', 'originalTextFor', 'ungroup', 'infixNotation', -# ] -# -# _MAX_INT = sys.maxint -# range = xrange -# set = lambda s : dict( [(c,0) for c in s] ) -# -def _ustr(obj): - """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 < returns the unicode object | encodes it with the default encoding | ... >. - """ - if isinstance(obj,unicode): - return obj - - try: - # If this works, then _ustr(obj) has the same behaviour as str(obj), so - # it won't break any existing code. - return str(obj) - - except UnicodeEncodeError: - # The Python docs (http://docs.python.org/ref/customization.html#l2h-182) - # state that "The return value must be a string object". However, does a - # unicode object (being a subclass of basestring) count as a "string - # object"? - # If so, then return a unicode object: - return unicode(obj) - # Else encode it... but how? There are many choices... :) - # Replace unprintables with escape codes? - #return unicode(obj).encode(sys.getdefaultencoding(), 'backslashreplace_errors') - # Replace unprintables with question marks? - #return unicode(obj).encode(sys.getdefaultencoding(), 'replace') - # ... - -# # build list of single arg builtins, tolerant of Python version, that can be used as parse actions -# singleArgBuiltins = [] -# import __builtin__ -# for fname in "sum len sorted reversed list tuple set any all min max".split(): -# try: -# singleArgBuiltins.append(getattr(__builtin__,fname)) -# except AttributeError: -# continue -# -# def _xml_escape(data): -# """Escape &, <, >, ", ', etc. in a string of data.""" -# -# # ampersand must be replaced first -# from_symbols = '&><"\'' -# to_symbols = ['&'+s+';' for s in "amp gt lt quot apos".split()] -# for from_,to_ in zip(from_symbols, to_symbols): -# data = data.replace(from_, to_) -# return data -# -# class _Constants(object): -# pass -# -# alphas = string.ascii_lowercase + string.ascii_uppercase -# nums = "0123456789" -# hexnums = nums + "ABCDEFabcdef" -# alphanums = alphas + nums -# _bslash = chr(92) -# printables = "".join( [ c for c in string.printable if c not in string.whitespace ] ) -# -class ParseBaseException(Exception): - """base exception class for all parsing runtime exceptions""" - # 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 = "" - else: - self.msg = msg - self.pstr = pstr - self.parserElement = elem - - def __getattr__( self, aname ): - """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 - """ - if( aname == "lineno" ): - return 1 #lineno( self.loc, self.pstr ) - elif( aname in ("col", "column") ): - return 1 #col( self.loc, self.pstr ) - elif( aname == "line" ): - return 1 #line( self.loc, self.pstr ) - else: - raise AttributeError(aname) - - def __str__( self ): - return "%s (at char %d), (line:%d, col:%d)" % \ - ( self.msg, self.loc, self.lineno, self.column ) - def __repr__( self ): - return _ustr(self) - def markInputline( self, markerString = ">!<" ): - """Extracts the exception line from the input string, and marks - the location of the exception with a special symbol. - """ - line_str = self.line - line_column = self.column - 1 - if markerString: - line_str = "".join( [line_str[:line_column], - markerString, line_str[line_column:]]) - return line_str.strip() - def __dir__(self): - return "loc msg pstr parserElement lineno col line " \ - "markInputline __str__ __repr__".split() - -class ParseException(ParseBaseException): - """exception thrown when parse expressions don'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 - """ - pass - -# class ParseFatalException(ParseBaseException): -# """user-throwable exception thrown when inconsistent parse content -# is found; stops all parsing immediately""" -# pass -# -# class ParseSyntaxException(ParseFatalException): -# """just like C{L{ParseFatalException}}, but thrown internally when an -# C{L{ErrorStop}} ('-' operator) indicates that parsing is to stop immediately because -# an unbacktrackable syntax error has been found""" -# def __init__(self, pe): -# super(ParseSyntaxException, self).__init__( -# pe.pstr, pe.loc, pe.msg, pe.parserElement) -# -# #~ class ReparseException(ParseBaseException): -# #~ """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. -# #~ """ -# #~ def __init_( self, newstring, restartLoc ): -# #~ self.newParseText = newstring -# #~ self.reparseLoc = restartLoc -# -# class RecursiveGrammarException(Exception): -# """exception thrown by C{validate()} if the grammar could be improperly recursive""" -# def __init__( self, parseElementList ): -# self.parseElementTrace = parseElementList -# -# def __str__( self ): -# return "RecursiveGrammarException: %s" % 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) -# def setOffset(self,i): -# self.tup = (self.tup[0],i) -# -# class ParseResults(object): -# """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.}) -# """ -# #~ __slots__ = ( "__toklist", "__tokdict", "__doinit", "__name", "__parent", "__accumNames", "__weakref__" ) -# def __new__(cls, toklist, 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, name=None, asList=True, modal=True, isinstance=isinstance ): -# if self.__doinit: -# self.__doinit = False -# self.__name = None -# self.__parent = None -# self.__accumNames = {} -# if isinstance(toklist, list): -# self.__toklist = 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 toklist in (None,'',[]): -# 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): -# 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 < 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 in self.__tokdict: -# occurrences = self.__tokdict[name] -# for j in removed: -# for k, (value, position) in enumerate(occurrences): -# occurrences[k] = _ParseResultsWithOffset(value, position - (position > 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 len( self.__toklist ) > 0 -# __nonzero__ = __bool__ -# def __iter__( self ): return iter( self.__toklist ) -# def __reversed__( self ): return iter( self.__toklist[::-1] ) -# def keys( self ): -# """Returns all named result keys.""" -# return self.__tokdict.keys() -# -# def pop( self, index=-1 ): -# """Removes and returns item at specified index (default=last). -# Will work with either numeric indices or dict-key indicies.""" -# ret = self[index] -# del self[index] -# return ret -# -# def get(self, key, defaultValue=None): -# """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.""" -# if key in self: -# return self[key] -# else: -# return defaultValue -# -# def insert( self, index, insStr ): -# """Inserts new element at location index in the list of parsed tokens.""" -# self.__toklist.insert(index, insStr) -# # fixup indices in token dictionary -# for name in self.__tokdict: -# occurrences = self.__tokdict[name] -# for k, (value, position) in enumerate(occurrences): -# occurrences[k] = _ParseResultsWithOffset(value, position + (position > index)) -# -# def items( self ): -# """Returns all named result keys and values as a list of tuples.""" -# return [(k,self[k]) for k in self.__tokdict] -# -# def values( self ): -# """Returns all named result values.""" -# return [ v[-1][0] for v in self.__tokdict.values() ] -# -# def __getattr__( self, name ): -# if True: #name not in self.__slots__: -# 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 "" -# return None -# -# 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: (a<0 and offset) or (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: -# return self.copy() -# -# def __repr__( self ): -# return "(%s, %s)" % ( repr( self.__toklist ), repr( self.__tokdict ) ) -# -# def __str__( self ): -# out = [] -# for i in self.__toklist: -# if isinstance(i, ParseResults): -# out.append(_ustr(i)) -# else: -# out.append(repr(i)) -# return '[' + ', '.join(out) + ']' -# -# def _asStringList( self, sep='' ): -# 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 ): -# """Returns the parse results as a nested list of matching tokens, all converted to strings.""" -# out = [] -# for res in self.__toklist: -# if isinstance(res,ParseResults): -# out.append( res.asList() ) -# else: -# out.append( res ) -# return out -# -# def asDict( self ): -# """Returns the named parse results as dictionary.""" -# return dict( self.items() ) -# -# def copy( self ): -# """Returns a new copy of a C{ParseResults} object.""" -# 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="", formatted=True ): -# """Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.""" -# nl = "\n" -# out = [] -# namedItems = dict( [ (v[1],k) for (k,vlist) in self.__tokdict.items() -# for v in vlist ] ) -# nextLevelIndent = indent + " " -# -# # collapse out indents if formatting is not desired -# if not formatted: -# indent = "" -# nextLevelIndent = "" -# nl = "" -# -# selfTag = None -# if doctag is not None: -# selfTag = doctag -# else: -# if self.__name: -# selfTag = self.__name -# -# if not selfTag: -# if namedItemsOnly: -# return "" -# else: -# selfTag = "ITEM" -# -# out += [ nl, indent, "<", selfTag, ">" ] -# -# worklist = self.__toklist -# for i,res in enumerate(worklist): -# 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 = "ITEM" -# xmlBodyText = _xml_escape(_ustr(res)) -# out += [ nl, nextLevelIndent, "<", resTag, ">", -# xmlBodyText, -# "" ] -# -# out += [ nl, indent, "" ] -# return "".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): -# """Returns the results name for this token expression.""" -# 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 -# self.__tokdict.values()[0][0][1] in (0,-1)): -# return self.__tokdict.keys()[0] -# else: -# return None -# -# def dump(self,indent='',depth=0): -# """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.""" -# out = [] -# out.append( indent+_ustr(self.asList()) ) -# keys = self.items() -# keys.sort() -# for k,v in keys: -# if out: -# out.append('\n') -# out.append( "%s%s- %s: " % (indent,(' '*depth), k) ) -# if isinstance(v,ParseResults): -# if v.keys(): -# out.append( v.dump(indent,depth+1) ) -# else: -# out.append(_ustr(v)) -# else: -# out.append(_ustr(v)) -# return "".join(out) -# -# # 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 __dir__(self): -# return dir(super(ParseResults,self)) + list(self.keys()) -# -# def col (loc,strg): -# """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}} for more information -# on parsing strings containing C{}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. -# """ -# return (loc} for more information -# on parsing strings containing C{}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. -# """ -# return strg.count("\n",0,loc) + 1 -# -# def line( loc, strg ): -# """Returns the line of text containing loc within a string, counting newlines as line separators. -# """ -# lastCR = strg.rfind("\n", 0, loc) -# nextCR = strg.find("\n", loc) -# if nextCR >= 0: -# return strg[lastCR+1:nextCR] -# else: -# return strg[lastCR+1:] -# -# def _defaultStartDebugAction( instring, loc, expr ): -# print ("Match " + _ustr(expr) + " at loc " + _ustr(loc) + "(%d,%d)" % ( lineno(loc,instring), col(loc,instring) )) -# -# def _defaultSuccessDebugAction( instring, startloc, endloc, expr, toks ): -# print ("Matched " + _ustr(expr) + " -> " + str(toks.asList())) -# -# def _defaultExceptionDebugAction( instring, loc, expr, exc ): -# print ("Exception raised:" + _ustr(exc)) -# -# def nullDebugAction(*args): -# """'Do-nothing' debug action, to suppress debugging output during parsing.""" -# pass -# -# 'decorator to trim function calls to match the arity of the target' -# def _trim_arity(func, maxargs=2): -# if func in singleArgBuiltins: -# return lambda s,l,t: func(t) -# limit = [0] -# foundArity = [False] -# def wrapper(*args): -# while 1: -# try: -# ret = func(*args[limit[0]:]) -# foundArity[0] = True -# return ret -# except TypeError: -# if limit[0] <= maxargs and not foundArity[0]: -# limit[0] += 1 -# continue -# raise -# return wrapper -# -# class ParserElement(object): -# """Abstract base level parser element class.""" -# DEFAULT_WHITE_CHARS = " \n\t\r" -# verbose_stacktrace = False -# -# def setDefaultWhitespaceChars( chars ): -# """Overrides the default whitespace chars -# """ -# ParserElement.DEFAULT_WHITE_CHARS = chars -# setDefaultWhitespaceChars = staticmethod(setDefaultWhitespaceChars) -# -# def inlineLiteralsUsing(cls): -# """ -# Set class to be used for inclusion of string literals into a parser. -# """ -# ParserElement.literalStringClass = cls -# inlineLiteralsUsing = staticmethod(inlineLiteralsUsing) -# -# def __init__( self, savelist=False ): -# self.parseAction = list() -# self.failAction = None -# #~ self.name = "" # don'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't advance parse index -# self.errmsg = "" -# 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 ): -# """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.""" -# 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 ): -# """Define name for this expression, for use in debugging.""" -# self.name = name -# self.errmsg = "Expected " + self.name -# if hasattr(self,"exception"): -# self.exception.msg = self.errmsg -# return self -# -# def setResultsName( self, name, listAllMatches=False ): -# """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("name")} in place of C{expr.setResultsName("name")} - -# see L{I{__call__}<__call__>}. -# """ -# newself = self.copy() -# if name.endswith("*"): -# name = name[:-1] -# listAllMatches=True -# newself.resultsName = name -# newself.modalResults = not listAllMatches -# return newself -# -# def setBreak(self,breakFlag = True): -# """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. -# """ -# 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,"_originalParseMethod"): -# self._parse = self._parse._originalParseMethod -# return self -# -# def setParseAction( self, *fns, **kwargs ): -# """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. -# -# Note: the default parsing behavior is to expand tabs in the input string -# before starting the parsing process. See L{I{parseString}} for more information -# on parsing strings containing C{}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. -# """ -# self.parseAction = list(map(_trim_arity, list(fns))) -# self.callDuringTry = ("callDuringTry" in kwargs and kwargs["callDuringTry"]) -# return self -# -# def addParseAction( self, *fns, **kwargs ): -# """Add parse action to expression's list of parse actions. See L{I{setParseAction}}.""" -# self.parseAction += list(map(_trim_arity, list(fns))) -# self.callDuringTry = self.callDuringTry or ("callDuringTry" in kwargs and kwargs["callDuringTry"]) -# return self -# -# def setFailAction( self, fn ): -# """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.""" -# 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 < 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 ("Match",self,"at loc",loc,"(%d,%d)" % ( 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, err: -# #~ print ("Exception raised:", err) -# err = None -# 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 >= 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, err: -# #~ print "Exception raised in user parse action:", 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 ("Matched",self,"->",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) -# -# # 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 ): -# lookup = (self,instring,loc,callPreParse,doActions) -# if lookup in ParserElement._exprArgCache: -# value = ParserElement._exprArgCache[ lookup ] -# if isinstance(value, Exception): -# raise value -# return (value[0],value[1].copy()) -# else: -# try: -# value = self._parseNoCache( instring, loc, doActions, callPreParse ) -# ParserElement._exprArgCache[ lookup ] = (value[0],value[1].copy()) -# return value -# except ParseBaseException, pe: -# ParserElement._exprArgCache[ lookup ] = pe -# raise -# -# _parse = _parseNoCache -# -# # argument cache for optimizing repeated calls when backtracking through recursive expressions -# _exprArgCache = {} -# def resetCache(): -# ParserElement._exprArgCache.clear() -# resetCache = staticmethod(resetCache) -# -# _packratEnabled = False -# def enablePackrat(): -# """Enables "packrat" 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. -# -# 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 "compile as you go", 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. -# """ -# if not ParserElement._packratEnabled: -# ParserElement._packratEnabled = True -# ParserElement._parse = ParserElement._parseCache -# enablePackrat = staticmethod(enablePackrat) -# -# def parseString( self, instring, parseAll=False ): -# """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}}) -# - define your parse action using the full C{(s,loc,toks)} signature, and -# reference the input string using the parse action's C{s} argument -# - explictly expand the tabs in your input string before calling -# C{parseString} -# """ -# 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, 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 ): -# """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 'n' 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}} for more information on parsing -# strings with embedded tabs.""" -# 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 <= instrlen and matches < maxMatches: -# try: -# preloc = preparseFn( instring, loc ) -# nextLoc,tokens = parseFn( instring, preloc, callPreParse=False ) -# except ParseException: -# loc = preloc+1 -# else: -# if nextLoc > loc: -# matches += 1 -# yield tokens, preloc, nextLoc -# if overlap: -# nextloc = preparseFn( instring, loc ) -# if nextloc > loc: -# loc = nextLoc -# else: -# loc += 1 -# else: -# loc = nextLoc -# else: -# loc = preloc+1 -# except ParseBaseException, 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 ): -# """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.""" -# out = [] -# lastE = 0 -# # force preservation of 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 "".join(map(_ustr,_flatten(out))) -# except ParseBaseException, 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 ): -# """Another extension to C{L{scanString}}, simplifying the access to the tokens found -# to match the given parse expression. May be called with optional -# C{maxMatches} argument, to clip searching after 'n' matches are found. -# """ -# try: -# return ParseResults([ t for t,s,e in self.scanString( instring, maxMatches ) ]) -# except ParseBaseException, exc: -# if ParserElement.verbose_stacktrace: -# raise -# else: -# # catch and re-raise exception from here, clears out pyparsing internal stack trace -# raise exc -# -# def __add__(self, other ): -# """Implementation of + operator - returns C{L{And}}""" -# if isinstance( other, basestring ): -# other = ParserElement.literalStringClass( other ) -# if not isinstance( other, ParserElement ): -# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), -# SyntaxWarning, stacklevel=2) -# return None -# return And( [ self, other ] ) -# -# def __radd__(self, other ): -# """Implementation of + operator when left operand is not a C{L{ParserElement}}""" -# if isinstance( other, basestring ): -# other = ParserElement.literalStringClass( other ) -# if not isinstance( other, ParserElement ): -# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), -# SyntaxWarning, stacklevel=2) -# return None -# return other + self -# -# def __sub__(self, other): -# """Implementation of - operator, returns C{L{And}} with error stop""" -# if isinstance( other, basestring ): -# other = ParserElement.literalStringClass( other ) -# if not isinstance( other, ParserElement ): -# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), -# SyntaxWarning, stacklevel=2) -# return None -# return And( [ self, And._ErrorStop(), other ] ) -# -# def __rsub__(self, other ): -# """Implementation of - operator when left operand is not a C{L{ParserElement}}""" -# if isinstance( other, basestring ): -# other = ParserElement.literalStringClass( other ) -# if not isinstance( other, ParserElement ): -# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), -# SyntaxWarning, stacklevel=2) -# return None -# return other - self -# -# def __mul__(self,other): -# """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 "at least n instances of C{expr}") -# - C{expr*(None,n)} is equivalent to C{expr*(0,n)} -# (read as "0 to n instances of C{expr}") -# - 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} -# -# """ -# 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("cannot multiply 'ParserElement' and ('%s','%s') objects", type(other[0]),type(other[1])) -# else: -# raise TypeError("cannot multiply 'ParserElement' and '%s' objects", type(other)) -# -# if minElements < 0: -# raise ValueError("cannot multiply ParserElement by negative value") -# if optElements < 0: -# raise ValueError("second tuple value must be greater or equal to first tuple value") -# if minElements == optElements == 0: -# raise ValueError("cannot multiply ParserElement by 0 or (0,0)") -# -# if (optElements): -# def makeOptionalList(n): -# if n>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 ): -# """Implementation of | operator - returns C{L{MatchFirst}}""" -# if isinstance( other, basestring ): -# other = ParserElement.literalStringClass( other ) -# if not isinstance( other, ParserElement ): -# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), -# SyntaxWarning, stacklevel=2) -# return None -# return MatchFirst( [ self, other ] ) -# -# def __ror__(self, other ): -# """Implementation of | operator when left operand is not a C{L{ParserElement}}""" -# if isinstance( other, basestring ): -# other = ParserElement.literalStringClass( other ) -# if not isinstance( other, ParserElement ): -# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), -# SyntaxWarning, stacklevel=2) -# return None -# return other | self -# -# def __xor__(self, other ): -# """Implementation of ^ operator - returns C{L{Or}}""" -# if isinstance( other, basestring ): -# other = ParserElement.literalStringClass( other ) -# if not isinstance( other, ParserElement ): -# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), -# SyntaxWarning, stacklevel=2) -# return None -# return Or( [ self, other ] ) -# -# def __rxor__(self, other ): -# """Implementation of ^ operator when left operand is not a C{L{ParserElement}}""" -# if isinstance( other, basestring ): -# other = ParserElement.literalStringClass( other ) -# if not isinstance( other, ParserElement ): -# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), -# SyntaxWarning, stacklevel=2) -# return None -# return other ^ self -# -# def __and__(self, other ): -# """Implementation of & operator - returns C{L{Each}}""" -# if isinstance( other, basestring ): -# other = ParserElement.literalStringClass( other ) -# if not isinstance( other, ParserElement ): -# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), -# SyntaxWarning, stacklevel=2) -# return None -# return Each( [ self, other ] ) -# -# def __rand__(self, other ): -# """Implementation of & operator when left operand is not a C{L{ParserElement}}""" -# if isinstance( other, basestring ): -# other = ParserElement.literalStringClass( other ) -# if not isinstance( other, ParserElement ): -# warnings.warn("Cannot combine element of type %s with ParserElement" % type(other), -# SyntaxWarning, stacklevel=2) -# return None -# return other & self -# -# def __invert__( self ): -# """Implementation of ~ operator - returns C{L{NotAny}}""" -# return NotAny( self ) -# -# def __call__(self, name): -# """Shortcut for C{L{setResultsName}}, with C{listAllMatches=default}:: -# userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno") -# could be written as:: -# userdata = Word(alphas)("name") + Word(nums+"-")("socsecno") -# -# If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be -# passed as C{True}. -# """ -# return self.setResultsName(name) -# -# def suppress( self ): -# """Suppresses the output of this C{ParserElement}; useful to keep punctuation from -# cluttering up returned output. -# """ -# return Suppress( self ) -# -# def leaveWhitespace( self ): -# """Disables the skipping of whitespace before matching the characters in the -# C{ParserElement}'s defined pattern. This is normally only used internally by -# the pyparsing module, but may be needed in some whitespace-sensitive grammars. -# """ -# self.skipWhitespace = False -# return self -# -# def setWhitespaceChars( self, chars ): -# """Overrides the default whitespace chars -# """ -# self.skipWhitespace = True -# self.whiteChars = chars -# self.copyDefaultWhiteChars = False -# return self -# -# def parseWithTabs( self ): -# """Overrides default behavior to expand C{}s to spaces before parsing the input string. -# Must be called before C{parseString} when the input grammar contains elements that -# match C{} characters.""" -# self.keepTabs = True -# return self -# -# def ignore( self, other ): -# """Define expression to be ignored (e.g., comments) while doing pattern -# matching; may be called repeatedly, to define multiple comment or other -# ignorable patterns. -# """ -# if isinstance( other, Suppress ): -# if other not in self.ignoreExprs: -# self.ignoreExprs.append( other.copy() ) -# else: -# self.ignoreExprs.append( Suppress( other.copy() ) ) -# return self -# -# def setDebugActions( self, startAction, successAction, exceptionAction ): -# """Enable display of debugging messages while doing pattern matching.""" -# self.debugActions = (startAction or _defaultStartDebugAction, -# successAction or _defaultSuccessDebugAction, -# exceptionAction or _defaultExceptionDebugAction) -# self.debug = True -# return self -# -# def setDebug( self, flag=True ): -# """Enable display of debugging messages while doing pattern matching. -# Set C{flag} to True to enable, False to disable.""" -# 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=[] ): -# """Check defined expressions for valid structure, check for infinite recursive definitions.""" -# self.checkRecursion( [] ) -# -# def parseFile( self, file_or_filename, parseAll=False ): -# """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. -# """ -# try: -# file_contents = file_or_filename.read() -# except AttributeError: -# f = open(file_or_filename, "r") -# file_contents = f.read() -# f.close() -# try: -# return self.parseString(file_contents, parseAll) -# except ParseBaseException, exc: -# if ParserElement.verbose_stacktrace: -# raise -# else: -# # catch and re-raise exception from here, clears out pyparsing internal stack trace -# raise exc -# -# def getException(self): -# return ParseException("",0,self.errmsg,self) -# -# def __getattr__(self,aname): -# if aname == "myException": -# self.myException = ret = self.getException(); -# return ret; -# else: -# raise AttributeError("no such attribute " + aname) -# -# def __eq__(self,other): -# if isinstance(other, ParserElement): -# return self is other or self.__dict__ == other.__dict__ -# elif isinstance(other, basestring): -# try: -# self.parseString(_ustr(other), parseAll=True) -# return True -# except ParseBaseException: -# return False -# 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) -# -# -# class Token(ParserElement): -# """Abstract C{ParserElement} subclass, for defining atomic matching patterns.""" -# def __init__( self ): -# super(Token,self).__init__( savelist=False ) -# -# def setName(self, name): -# s = super(Token,self).setName(name) -# self.errmsg = "Expected " + self.name -# return s -# -# -# class Empty(Token): -# """An empty token, will always match.""" -# def __init__( self ): -# super(Empty,self).__init__() -# self.name = "Empty" -# self.mayReturnEmpty = True -# self.mayIndexError = False -# -# -# class NoMatch(Token): -# """A token that will never match.""" -# def __init__( self ): -# super(NoMatch,self).__init__() -# self.name = "NoMatch" -# self.mayReturnEmpty = True -# self.mayIndexError = False -# self.errmsg = "Unmatchable token" -# -# def parseImpl( self, instring, loc, doActions=True ): -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# -# class Literal(Token): -# """Token to exactly match a specified string.""" -# def __init__( self, matchString ): -# super(Literal,self).__init__() -# self.match = matchString -# self.matchLen = len(matchString) -# try: -# self.firstMatchChar = matchString[0] -# except IndexError: -# warnings.warn("null string passed to Literal; use Empty() instead", -# SyntaxWarning, stacklevel=2) -# self.__class__ = Empty -# self.name = '"%s"' % _ustr(self.match) -# self.errmsg = "Expected " + 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 ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# _L = Literal -# ParserElement.literalStringClass = Literal -# -# class Keyword(Token): -# """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}}:: -# Literal("if") will match the leading C{'if'} in C{'ifAndOnlyIf'}. -# Keyword("if") will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'} -# 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 + "_" and "$"; C{caseless} allows case-insensitive -# matching, default is C{False}. -# """ -# DEFAULT_KEYWORD_CHARS = alphanums+"_$" -# -# def __init__( self, matchString, identChars=DEFAULT_KEYWORD_CHARS, caseless=False ): -# super(Keyword,self).__init__() -# self.match = matchString -# self.matchLen = len(matchString) -# try: -# self.firstMatchChar = matchString[0] -# except IndexError: -# warnings.warn("null string passed to Keyword; use Empty() instead", -# SyntaxWarning, stacklevel=2) -# self.name = '"%s"' % self.match -# self.errmsg = "Expected " + 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 >= 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 >= 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 ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# def copy(self): -# c = super(Keyword,self).copy() -# c.identChars = Keyword.DEFAULT_KEYWORD_CHARS -# return c -# -# def setDefaultKeywordChars( chars ): -# """Overrides the default Keyword chars -# """ -# Keyword.DEFAULT_KEYWORD_CHARS = chars -# setDefaultKeywordChars = staticmethod(setDefaultKeywordChars) -# -# class CaselessLiteral(Literal): -# """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. -# """ -# def __init__( self, matchString ): -# super(CaselessLiteral,self).__init__( matchString.upper() ) -# # Preserve the defining literal. -# self.returnString = matchString -# self.name = "'%s'" % self.returnString -# self.errmsg = "Expected " + 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 ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# class CaselessKeyword(Keyword): -# def __init__( self, matchString, identChars=Keyword.DEFAULT_KEYWORD_CHARS ): -# 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 >= 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 ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# class Word(Token): -# """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 < 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{exclude} 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. -# """ -# def __init__( self, initChars, bodyChars=None, min=1, max=0, exact=0, asKeyword=False, excludeChars=None ): -# super(Word,self).__init__() -# if excludeChars: -# initChars = ''.join([c for c in initChars if c not in excludeChars]) -# if bodyChars: -# bodyChars = ''.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 > 0 -# -# if min < 1: -# raise ValueError("cannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permitted") -# -# self.minLen = min -# -# if max > 0: -# self.maxLen = max -# else: -# self.maxLen = _MAX_INT -# -# if exact > 0: -# self.maxLen = exact -# self.minLen = exact -# -# self.name = _ustr(self) -# self.errmsg = "Expected " + self.name -# self.mayIndexError = False -# self.asKeyword = asKeyword -# -# if ' ' not in self.initCharsOrig+self.bodyCharsOrig and (min==1 and max==0 and exact==0): -# if self.bodyCharsOrig == self.initCharsOrig: -# self.reString = "[%s]+" % _escapeRegexRangeChars(self.initCharsOrig) -# elif len(self.bodyCharsOrig) == 1: -# self.reString = "%s[%s]*" % \ -# (re.escape(self.initCharsOrig), -# _escapeRegexRangeChars(self.bodyCharsOrig),) -# else: -# self.reString = "[%s][%s]*" % \ -# (_escapeRegexRangeChars(self.initCharsOrig), -# _escapeRegexRangeChars(self.bodyCharsOrig),) -# if self.asKeyword: -# self.reString = r"\b"+self.reString+r"\b" -# try: -# self.re = re.compile( self.reString ) -# except: -# self.re = None -# -# def parseImpl( self, instring, loc, doActions=True ): -# if self.re: -# result = self.re.match(instring,loc) -# if not result: -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# loc = result.end() -# return loc, result.group() -# -# if not(instring[ loc ] in self.initChars): -# #~ raise ParseException( instring, loc, self.errmsg ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# start = loc -# loc += 1 -# instrlen = len(instring) -# bodychars = self.bodyChars -# maxloc = start + self.maxLen -# maxloc = min( maxloc, instrlen ) -# while loc < maxloc and instring[loc] in bodychars: -# loc += 1 -# -# throwException = False -# if loc - start < self.minLen: -# throwException = True -# if self.maxSpecified and loc < instrlen and instring[loc] in bodychars: -# throwException = True -# if self.asKeyword: -# if (start>0 and instring[start-1] in bodychars) or (loc4: -# return s[:4]+"..." -# else: -# return s -# -# if ( self.initCharsOrig != self.bodyCharsOrig ): -# self.strRepr = "W:(%s,%s)" % ( charsAsStr(self.initCharsOrig), charsAsStr(self.bodyCharsOrig) ) -# else: -# self.strRepr = "W:(%s)" % charsAsStr(self.initCharsOrig) -# -# return self.strRepr -# -# -# class Regex(Token): -# """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. -# """ -# compiledREtype = type(re.compile("[A-Z]")) -# def __init__( self, pattern, flags=0): -# """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.""" -# super(Regex,self).__init__() -# -# if isinstance(pattern, basestring): -# if len(pattern) == 0: -# warnings.warn("null string passed to Regex; use Empty() instead", -# 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("invalid pattern (%s) passed to Regex" % 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("Regex may only be constructed with a string or a compiled RE object") -# -# self.name = _ustr(self) -# self.errmsg = "Expected " + self.name -# self.mayIndexError = False -# self.mayReturnEmpty = True -# -# def parseImpl( self, instring, loc, doActions=True ): -# result = self.re.match(instring,loc) -# if not result: -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# 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: -# pass -# -# if self.strRepr is None: -# self.strRepr = "Re:(%s)" % repr(self.pattern) -# -# return self.strRepr -# -# -# class QuotedString(Token): -# """Token for matching strings that are delimited by quoting characters. -# """ -# def __init__( self, quoteChar, escChar=None, escQuote=None, multiline=False, unquoteResults=True, endQuoteChar=None): -# """ -# 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=None) -# - escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=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} => same as quoteChar) -# """ -# super(QuotedString,self).__init__() -# -# # remove white space from quote chars - wont work anyway -# quoteChar = quoteChar.strip() -# if len(quoteChar) == 0: -# warnings.warn("quoteChar cannot be the empty string",SyntaxWarning,stacklevel=2) -# raise SyntaxError() -# -# if endQuoteChar is None: -# endQuoteChar = quoteChar -# else: -# endQuoteChar = endQuoteChar.strip() -# if len(endQuoteChar) == 0: -# warnings.warn("endQuoteChar cannot be the empty string",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 -# -# if multiline: -# self.flags = re.MULTILINE | re.DOTALL -# self.pattern = r'%s(?:[^%s%s]' % \ -# ( re.escape(self.quoteChar), -# _escapeRegexRangeChars(self.endQuoteChar[0]), -# (escChar is not None and _escapeRegexRangeChars(escChar) or '') ) -# else: -# self.flags = 0 -# self.pattern = r'%s(?:[^%s\n\r%s]' % \ -# ( re.escape(self.quoteChar), -# _escapeRegexRangeChars(self.endQuoteChar[0]), -# (escChar is not None and _escapeRegexRangeChars(escChar) or '') ) -# if len(self.endQuoteChar) > 1: -# self.pattern += ( -# '|(?:' + ')|(?:'.join(["%s[^%s]" % (re.escape(self.endQuoteChar[:i]), -# _escapeRegexRangeChars(self.endQuoteChar[i])) -# for i in range(len(self.endQuoteChar)-1,0,-1)]) + ')' -# ) -# if escQuote: -# self.pattern += (r'|(?:%s)' % re.escape(escQuote)) -# if escChar: -# self.pattern += (r'|(?:%s.)' % re.escape(escChar)) -# charset = ''.join(set(self.quoteChar[0]+self.endQuoteChar[0])).replace('^',r'\^').replace('-',r'\-') -# self.escCharReplacePattern = re.escape(self.escChar)+("([%s])" % charset) -# self.pattern += (r')*%s' % re.escape(self.endQuoteChar)) -# -# try: -# self.re = re.compile(self.pattern, self.flags) -# self.reString = self.pattern -# except sre_constants.error: -# warnings.warn("invalid pattern (%s) passed to Regex" % self.pattern, -# SyntaxWarning, stacklevel=2) -# raise -# -# self.name = _ustr(self) -# self.errmsg = "Expected " + 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: -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# loc = result.end() -# ret = result.group() -# -# if self.unquoteResults: -# -# # strip off quotes -# ret = ret[self.quoteCharLen:-self.endQuoteCharLen] -# -# if isinstance(ret,basestring): -# # replace escaped characters -# if self.escChar: -# ret = re.sub(self.escCharReplacePattern,"\g<1>",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: -# pass -# -# if self.strRepr is None: -# self.strRepr = "quoted string, starting with %s ending with %s" % (self.quoteChar, self.endQuoteChar) -# -# return self.strRepr -# -# -# class CharsNotIn(Token): -# """Token for matching words composed of characters *not* in a given set. -# 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 < 1 is not valid); the default values for C{max} and C{exact} -# are 0, meaning no maximum or exact length restriction. -# """ -# def __init__( self, notChars, min=1, max=0, exact=0 ): -# super(CharsNotIn,self).__init__() -# self.skipWhitespace = False -# self.notChars = notChars -# -# if min < 1: -# raise ValueError("cannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permitted") -# -# self.minLen = min -# -# if max > 0: -# self.maxLen = max -# else: -# self.maxLen = _MAX_INT -# -# if exact > 0: -# self.maxLen = exact -# self.minLen = exact -# -# self.name = _ustr(self) -# self.errmsg = "Expected " + 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 ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# start = loc -# loc += 1 -# notchars = self.notChars -# maxlen = min( start+self.maxLen, len(instring) ) -# while loc < maxlen and \ -# (instring[loc] not in notchars): -# loc += 1 -# -# if loc - start < self.minLen: -# #~ raise ParseException( instring, loc, self.errmsg ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# return loc, instring[start:loc] -# -# def __str__( self ): -# try: -# return super(CharsNotIn, self).__str__() -# except: -# pass -# -# if self.strRepr is None: -# if len(self.notChars) > 4: -# self.strRepr = "!W:(%s...)" % self.notChars[:4] -# else: -# self.strRepr = "!W:(%s)" % self.notChars -# -# return self.strRepr -# -# class White(Token): -# """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{" \\t\\r\\n"}. Also takes optional C{min}, C{max}, and C{exact} arguments, -# as defined for the C{L{Word}} class.""" -# whiteStrs = { -# " " : "", -# "\t": "", -# "\n": "", -# "\r": "", -# "\f": "", -# } -# def __init__(self, ws=" \t\r\n", min=1, max=0, exact=0): -# super(White,self).__init__() -# self.matchWhite = ws -# self.setWhitespaceChars( "".join([c for c in self.whiteChars if c not in self.matchWhite]) ) -# #~ self.leaveWhitespace() -# self.name = ("".join([White.whiteStrs[c] for c in self.matchWhite])) -# self.mayReturnEmpty = True -# self.errmsg = "Expected " + self.name -# -# self.minLen = min -# -# if max > 0: -# self.maxLen = max -# else: -# self.maxLen = _MAX_INT -# -# if exact > 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 ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# start = loc -# loc += 1 -# maxloc = start + self.maxLen -# maxloc = min( maxloc, len(instring) ) -# while loc < maxloc and instring[loc] in self.matchWhite: -# loc += 1 -# -# if loc - start < self.minLen: -# #~ raise ParseException( instring, loc, self.errmsg ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# 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): -# """Token to advance to a specific column of input text; useful for tabular report scraping.""" -# 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 < 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 > self.col: -# raise ParseException( instring, loc, "Text not in expected column", self ) -# newloc = loc + self.col - thiscol -# ret = instring[ loc: newloc ] -# return newloc, ret -# -# class LineStart(_PositionToken): -# """Matches if current position is at the beginning of a line within the parse string""" -# def __init__( self ): -# super(LineStart,self).__init__() -# self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") ) -# self.errmsg = "Expected start of line" -# -# def preParse( self, instring, loc ): -# preloc = super(LineStart,self).preParse(instring,loc) -# if instring[preloc] == "\n": -# loc += 1 -# return loc -# -# def parseImpl( self, instring, loc, doActions=True ): -# if not( loc==0 or -# (loc == self.preParse( instring, 0 )) or -# (instring[loc-1] == "\n") ): #col(loc, instring) != 1: -# #~ raise ParseException( instring, loc, "Expected start of line" ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# return loc, [] -# -# class LineEnd(_PositionToken): -# """Matches if current position is at the end of a line within the parse string""" -# def __init__( self ): -# super(LineEnd,self).__init__() -# self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") ) -# self.errmsg = "Expected end of line" -# -# def parseImpl( self, instring, loc, doActions=True ): -# if loc len(instring): -# return loc, [] -# else: -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# class WordStart(_PositionToken): -# """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. -# """ -# def __init__(self, wordChars = printables): -# super(WordStart,self).__init__() -# self.wordChars = set(wordChars) -# self.errmsg = "Not at the start of a word" -# -# def parseImpl(self, instring, loc, doActions=True ): -# if loc != 0: -# if (instring[loc-1] in self.wordChars or -# instring[loc] not in self.wordChars): -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# return loc, [] -# -# class WordEnd(_PositionToken): -# """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. -# """ -# def __init__(self, wordChars = printables): -# super(WordEnd,self).__init__() -# self.wordChars = set(wordChars) -# self.skipWhitespace = False -# self.errmsg = "Not at the end of a word" -# -# def parseImpl(self, instring, loc, doActions=True ): -# instrlen = len(instring) -# if instrlen>0 and loc maxExcLoc: -# maxException = err -# maxExcLoc = err.loc -# except IndexError: -# if len(instring) > maxExcLoc: -# maxException = ParseException(instring,len(instring),e.errmsg,self) -# maxExcLoc = len(instring) -# else: -# if loc2 > maxMatchLoc: -# maxMatchLoc = loc2 -# maxMatchExp = e -# -# if maxMatchLoc < 0: -# if maxException is not None: -# raise maxException -# else: -# raise ParseException(instring, loc, "no defined alternatives to match", self) -# -# return maxMatchExp._parse( instring, loc, doActions ) -# -# 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,"name"): -# return self.name -# -# if self.strRepr is None: -# self.strRepr = "{" + " ^ ".join( [ _ustr(e) for e in self.exprs ] ) + "}" -# -# return self.strRepr -# -# def checkRecursion( self, parseElementList ): -# subRecCheckList = parseElementList[:] + [ self ] -# for e in self.exprs: -# e.checkRecursion( subRecCheckList ) -# -# -# class MatchFirst(ParseExpression): -# """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{'|'} operator. -# """ -# def __init__( self, exprs, savelist = False ): -# super(MatchFirst,self).__init__(exprs, savelist) -# if exprs: -# self.mayReturnEmpty = False -# for e in self.exprs: -# if e.mayReturnEmpty: -# self.mayReturnEmpty = True -# break -# 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, err: -# if err.loc > maxExcLoc: -# maxException = err -# maxExcLoc = err.loc -# except IndexError: -# if len(instring) > 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: -# raise maxException -# else: -# raise ParseException(instring, loc, "no defined alternatives to match", 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,"name"): -# return self.name -# -# if self.strRepr is None: -# self.strRepr = "{" + " | ".join( [ _ustr(e) for e in self.exprs ] ) + "}" -# -# return self.strRepr -# -# def checkRecursion( self, parseElementList ): -# subRecCheckList = parseElementList[:] + [ self ] -# for e in self.exprs: -# e.checkRecursion( subRecCheckList ) -# -# -# class Each(ParseExpression): -# """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{'&'} operator. -# """ -# def __init__( self, exprs, savelist = True ): -# super(Each,self).__init__(exprs, savelist) -# self.mayReturnEmpty = True -# for e in self.exprs: -# if not e.mayReturnEmpty: -# self.mayReturnEmpty = False -# break -# self.skipWhitespace = True -# self.initExprGroups = True -# -# def parseImpl( self, instring, loc, doActions=True ): -# if self.initExprGroups: -# opt1 = [ e.expr for e in self.exprs if isinstance(e,Optional) ] -# opt2 = [ e for e in self.exprs if e.mayReturnEmpty and e not in opt1 ] -# 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(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 = ", ".join( [ _ustr(e) for e in tmpReqd ] ) -# raise ParseException(instring,loc,"Missing one or more required elements (%s)" % 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 = ParseResults([]) -# for r in resultlist: -# dups = {} -# for k in r.keys(): -# if k in finalResults.keys(): -# tmp = ParseResults(finalResults[k]) -# tmp += ParseResults(r[k]) -# dups[k] = tmp -# finalResults += ParseResults(r) -# for k,v in dups.items(): -# finalResults[k] = v -# return loc, finalResults -# -# def __str__( self ): -# if hasattr(self,"name"): -# return self.name -# -# if self.strRepr is None: -# self.strRepr = "{" + " & ".join( [ _ustr(e) for e in self.exprs ] ) + "}" -# -# return self.strRepr -# -# def checkRecursion( self, parseElementList ): -# subRecCheckList = parseElementList[:] + [ self ] -# for e in self.exprs: -# e.checkRecursion( subRecCheckList ) -# -# -# class ParseElementEnhance(ParserElement): -# """Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.""" -# def __init__( self, expr, savelist=False ): -# super(ParseElementEnhance,self).__init__(savelist) -# if isinstance( expr, basestring ): -# expr = 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("",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: -# pass -# -# if self.strRepr is None and self.expr is not None: -# self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.expr) ) -# return self.strRepr -# -# -# class FollowedBy(ParseElementEnhance): -# """Lookahead matching of the given parse expression. C{FollowedBy} -# does *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.""" -# 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): -# """Lookahead to disallow matching with the given parse expression. C{NotAny} -# does *not* advance the parsing position within the input string, it only -# verifies that the specified parse expression does *not* match at the current -# position. Also, C{NotAny} does *not* skip over leading whitespace. C{NotAny} -# always returns a null token list. May be constructed using the '~' operator.""" -# def __init__( self, expr ): -# super(NotAny,self).__init__(expr) -# #~ self.leaveWhitespace() -# self.skipWhitespace = False # do NOT use self.leaveWhitespace(), don't want to propagate to exprs -# self.mayReturnEmpty = True -# self.errmsg = "Found unwanted token, "+_ustr(self.expr) -# -# def parseImpl( self, instring, loc, doActions=True ): -# try: -# self.expr.tryParse( instring, loc ) -# except (ParseException,IndexError): -# pass -# else: -# #~ raise ParseException(instring, loc, self.errmsg ) -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# return loc, [] -# -# def __str__( self ): -# if hasattr(self,"name"): -# return self.name -# -# if self.strRepr is None: -# self.strRepr = "~{" + _ustr(self.expr) + "}" -# -# return self.strRepr -# -# -# class ZeroOrMore(ParseElementEnhance): -# """Optional repetition of zero or more of the given expression.""" -# def __init__( self, expr ): -# super(ZeroOrMore,self).__init__(expr) -# self.mayReturnEmpty = True -# -# def parseImpl( self, instring, loc, doActions=True ): -# tokens = [] -# try: -# loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False ) -# hasIgnoreExprs = ( len(self.ignoreExprs) > 0 ) -# while 1: -# if hasIgnoreExprs: -# preloc = self._skipIgnorables( instring, loc ) -# else: -# preloc = loc -# loc, tmptokens = self.expr._parse( instring, preloc, doActions ) -# if tmptokens or tmptokens.keys(): -# tokens += tmptokens -# except (ParseException,IndexError): -# pass -# -# return loc, tokens -# -# def __str__( self ): -# if hasattr(self,"name"): -# return self.name -# -# if self.strRepr is None: -# self.strRepr = "[" + _ustr(self.expr) + "]..." -# -# return self.strRepr -# -# def setResultsName( self, name, listAllMatches=False ): -# ret = super(ZeroOrMore,self).setResultsName(name,listAllMatches) -# ret.saveAsList = True -# return ret -# -# -# class OneOrMore(ParseElementEnhance): -# """Repetition of one or more of the given expression.""" -# def parseImpl( self, instring, loc, doActions=True ): -# # must be at least one -# loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False ) -# try: -# hasIgnoreExprs = ( len(self.ignoreExprs) > 0 ) -# while 1: -# if hasIgnoreExprs: -# preloc = self._skipIgnorables( instring, loc ) -# else: -# preloc = loc -# loc, tmptokens = self.expr._parse( instring, preloc, doActions ) -# if tmptokens or tmptokens.keys(): -# tokens += tmptokens -# except (ParseException,IndexError): -# pass -# -# return loc, tokens -# -# def __str__( self ): -# if hasattr(self,"name"): -# return self.name -# -# if self.strRepr is None: -# self.strRepr = "{" + _ustr(self.expr) + "}..." -# -# return self.strRepr -# -# def setResultsName( self, name, listAllMatches=False ): -# ret = super(OneOrMore,self).setResultsName(name,listAllMatches) -# ret.saveAsList = True -# return ret -# -# class _NullToken(object): -# def __bool__(self): -# return False -# __nonzero__ = __bool__ -# def __str__(self): -# return "" -# -# _optionalNotMatched = _NullToken() -# class Optional(ParseElementEnhance): -# """Optional matching of the given expression. -# A default return string can also be specified, if the optional expression -# is not found. -# """ -# def __init__( self, exprs, default=_optionalNotMatched ): -# super(Optional,self).__init__( exprs, savelist=False ) -# 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,"name"): -# return self.name -# -# if self.strRepr is None: -# self.strRepr = "[" + _ustr(self.expr) + "]" -# -# return self.strRepr -# -# -# class SkipTo(ParseElementEnhance): -# """Token for skipping over all undefined text until the matched expression is found. -# If C{include} is set to true, the matched expression is also parsed (the skipped text -# and matched expression are returned as a 2-element list). The C{ignore} -# argument is used to define grammars (typically quoted strings and comments) that -# might contain false matches. -# """ -# 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 failOn is not None and isinstance(failOn, basestring): -# self.failOn = Literal(failOn) -# else: -# self.failOn = failOn -# self.errmsg = "No match found for "+_ustr(self.expr) -# -# def parseImpl( self, instring, loc, doActions=True ): -# startLoc = loc -# instrlen = len(instring) -# expr = self.expr -# failParse = False -# while loc <= instrlen: -# try: -# if self.failOn: -# try: -# self.failOn.tryParse(instring, loc) -# except ParseBaseException: -# pass -# else: -# failParse = True -# raise ParseException(instring, loc, "Found expression " + str(self.failOn)) -# failParse = False -# if self.ignoreExpr is not None: -# while 1: -# try: -# loc = self.ignoreExpr.tryParse(instring,loc) -# # print "found ignoreExpr, advance to", loc -# except ParseBaseException: -# break -# expr._parse( instring, loc, doActions=False, callPreParse=False ) -# skipText = instring[startLoc:loc] -# if self.includeMatch: -# loc,mat = expr._parse(instring,loc,doActions,callPreParse=False) -# if mat: -# skipRes = ParseResults( skipText ) -# skipRes += mat -# return loc, [ skipRes ] -# else: -# return loc, [ skipText ] -# else: -# return loc, [ skipText ] -# except (ParseException,IndexError): -# if failParse: -# raise -# else: -# loc += 1 -# exc = self.myException -# exc.loc = loc -# exc.pstr = instring -# raise exc -# -# class Forward(ParseElementEnhance): -# """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 '<<' operator. -# -# Note: take care when assigning to C{Forward} not to overlook precedence of operators. -# Specifically, '|' has a lower precedence than '<<', so that:: -# fwdExpr << a | b | c -# will actually be evaluated as:: -# (fwdExpr << 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 << (a | b | c) -# Converting to use the '<<=' operator instead will avoid this problem. -# """ -# 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.mayReturnEmpty = other.mayReturnEmpty -# 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 None -# __ilshift__ = __lshift__ -# -# 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,"name"): -# return self.name -# -# self._revertClass = self.__class__ -# self.__class__ = _ForwardNoRecurse -# try: -# if self.expr is not None: -# retString = _ustr(self.expr) -# else: -# retString = "None" -# finally: -# self.__class__ = self._revertClass -# return self.__class__.__name__ + ": " + retString -# -# def copy(self): -# if self.expr is not None: -# return super(Forward,self).copy() -# else: -# ret = Forward() -# ret << self -# return ret -# -# class _ForwardNoRecurse(Forward): -# def __str__( self ): -# return "..." -# -# class TokenConverter(ParseElementEnhance): -# """Abstract subclass of C{ParseExpression}, for converting parsed results.""" -# def __init__( self, expr, savelist=False ): -# super(TokenConverter,self).__init__( expr )#, savelist ) -# self.saveAsList = False -# -# class Upcase(TokenConverter): -# """Converter to upper case all matching tokens.""" -# def __init__(self, *args): -# super(Upcase,self).__init__(*args) -# warnings.warn("Upcase class is deprecated, use upcaseTokens parse action instead", -# DeprecationWarning,stacklevel=2) -# -# def postParse( self, instring, loc, tokenlist ): -# return list(map( str.upper, tokenlist )) -# -# -# class Combine(TokenConverter): -# """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{'adjacent=False'} in the constructor. -# """ -# def __init__( self, expr, joinString="", 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([ "".join(tokenlist._asStringList(self.joinString)) ], modal=self.modalResults) -# -# if self.resultsName and len(retToks.keys())>0: -# return [ retToks ] -# else: -# return retToks -# -# class Group(TokenConverter): -# """Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.""" -# def __init__( self, expr ): -# super(Group,self).__init__( expr ) -# self.saveAsList = True -# -# def postParse( self, instring, loc, tokenlist ): -# return [ tokenlist ] -# -# class Dict(TokenConverter): -# """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. -# """ -# def __init__( self, exprs ): -# super(Dict,self).__init__( exprs ) -# 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("",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.keys()): -# tokenlist[ikey] = _ParseResultsWithOffset(dictvalue,i) -# else: -# tokenlist[ikey] = _ParseResultsWithOffset(dictvalue[0],i) -# -# if self.resultsName: -# return [ tokenlist ] -# else: -# return tokenlist -# -# -# class Suppress(TokenConverter): -# """Converter for ignoring the results of a parsed expression.""" -# def postParse( self, instring, loc, tokenlist ): -# return [] -# -# def suppress( self ): -# return self -# -# -# class OnlyOnce(object): -# """Wrapper for parse actions, to ensure they are only called once.""" -# 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,"") -# def reset(self): -# self.called = False -# -# def traceParseAction(f): -# """Decorator for debugging parse actions.""" -# f = _trim_arity(f) -# def z(*paArgs): -# thisFunc = f.func_name -# s,l,t = paArgs[-3:] -# if len(paArgs)>3: -# thisFunc = paArgs[0].__class__.__name__ + '.' + thisFunc -# sys.stderr.write( ">>entering %s(line: '%s', %d, %s)\n" % (thisFunc,line(l,s),l,t) ) -# try: -# ret = f(*paArgs) -# except Exception, exc: -# sys.stderr.write( "<", "|".join( [ _escapeRegexChars(sym) for sym in symbols] )) -# try: -# if len(symbols)==len("".join(symbols)): -# return Regex( "[%s]" % "".join( [ _escapeRegexRangeChars(sym) for sym in symbols] ) ) -# else: -# return Regex( "|".join( [ re.escape(sym) for sym in symbols] ) ) -# except: -# warnings.warn("Exception creating Regex for oneOf, building MatchFirst", -# SyntaxWarning, stacklevel=2) -# -# -# # last resort, just use MatchFirst -# return MatchFirst( [ parseElementClass(sym) for sym in symbols ] ) -# -# def dictOf( key, value ): -# """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. -# """ -# return Dict( ZeroOrMore( Group ( key + value ) ) ) -# -# def originalTextFor(expr, asString=True): -# """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. Simpler to use than the parse action C{L{keepOriginalText}}, and does not -# require the inspect module to chase up the call stack. By default, returns a -# string 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.""" -# locMarker = Empty().setParseAction(lambda s,loc,t: loc) -# endlocMarker = locMarker.copy() -# endlocMarker.callPreparse = False -# matchExpr = locMarker("_original_start") + expr + endlocMarker("_original_end") -# if asString: -# extractText = lambda s,l,t: s[t._original_start:t._original_end] -# else: -# def extractText(s,l,t): -# del t[:] -# t.insert(0, s[t._original_start:t._original_end]) -# del t["_original_start"] -# del t["_original_end"] -# matchExpr.setParseAction(extractText) -# return matchExpr -# -# def ungroup(expr): -# """Helper to undo pyparsing's default grouping of And expressions, even -# if all but one are non-empty.""" -# return TokenConverter(expr).setParseAction(lambda t:t[0]) -# -# # convenience constants for positional expressions -# empty = Empty().setName("empty") -# lineStart = LineStart().setName("lineStart") -# lineEnd = LineEnd().setName("lineEnd") -# stringStart = StringStart().setName("stringStart") -# stringEnd = StringEnd().setName("stringEnd") -# -# _escapedPunc = Word( _bslash, r"\[]-*.$+^?()~ ", exact=2 ).setParseAction(lambda s,l,t:t[0][1]) -# _printables_less_backslash = "".join([ c for c in printables if c not in r"\]" ]) -# _escapedHexChar = Regex(r"\\0?[xX][0-9a-fA-F]+").setParseAction(lambda s,l,t:unichr(int(t[0].lstrip(r'\0x'),16))) -# _escapedOctChar = Regex(r"\\0[0-7]+").setParseAction(lambda s,l,t:unichr(int(t[0][1:],8))) -# _singleChar = _escapedPunc | _escapedHexChar | _escapedOctChar | Word(_printables_less_backslash,exact=1) -# _charRange = Group(_singleChar + Suppress("-") + _singleChar) -# _reBracketExpr = Literal("[") + Optional("^").setResultsName("negate") + Group( OneOrMore( _charRange | _singleChar ) ).setResultsName("body") + "]" -# -# _expanded = lambda p: (isinstance(p,ParseResults) and ''.join([ unichr(c) for c in range(ord(p[0]),ord(p[1])+1) ]) or p) -# -# def srange(s): -# r"""Helper to easily define string ranges for use in Word construction. Borrows -# syntax from regexp '[]' string range definitions:: -# srange("[0-9]") -> "0123456789" -# srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz" -# srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_" -# The input string must be enclosed in []'s, and the returned string is the expanded -# character set joined into a single string. -# The values enclosed in the []'s may be:: -# a single character -# an escaped character with a leading backslash (such as \- or \]) -# an escaped hex character with a leading '\x' (\x21, which is a '!' character) -# (\0x## is also supported for backwards compatibility) -# an escaped octal character with a leading '\0' (\041, which is a '!' character) -# a range of any of the above, separated by a dash ('a-z', etc.) -# any combination of the above ('aeiouy', 'a-zA-Z0-9_$', etc.) -# """ -# try: -# return "".join([_expanded(part) for part in _reBracketExpr.parseString(s).body]) -# except: -# return "" -# -# def matchOnlyAtCol(n): -# """Helper method for defining parse actions that require matching at a specific -# column in the input text. -# """ -# def verifyCol(strg,locn,toks): -# if col(locn,strg) != n: -# raise ParseException(strg,locn,"matched token not at column %d" % n) -# return verifyCol -# -# def replaceWith(replStr): -# """Helper method for common parse actions that simply return a literal value. Especially -# useful when used with C{L{transformString}()}. -# """ -# def _replFunc(*args): -# return [replStr] -# return _replFunc -# -# def removeQuotes(s,l,t): -# """Helper parse action for removing quotation marks from parsed quoted strings. -# To use, add this parse action to quoted string using:: -# quotedString.setParseAction( removeQuotes ) -# """ -# return t[0][1:-1] -# -# def upcaseTokens(s,l,t): -# """Helper parse action to convert tokens to upper case.""" -# return [ tt.upper() for tt in map(_ustr,t) ] -# -# def downcaseTokens(s,l,t): -# """Helper parse action to convert tokens to lower case.""" -# return [ tt.lower() for tt in map(_ustr,t) ] -# -# def keepOriginalText(s,startLoc,t): -# """DEPRECATED - use new helper method C{L{originalTextFor}}. -# Helper parse action to preserve original parsed text, -# overriding any nested parse actions.""" -# try: -# endloc = getTokensEndLoc() -# except ParseException: -# raise ParseFatalException("incorrect usage of keepOriginalText - may only be called as a parse action") -# del t[:] -# t += ParseResults(s[startLoc:endloc]) -# return t -# -# def getTokensEndLoc(): -# """Method to be called from within a parse action to determine the end -# location of the parsed tokens.""" -# import inspect -# fstack = inspect.stack() -# try: -# # search up the stack (through intervening argument normalizers) for correct calling routine -# for f in fstack[2:]: -# if f[3] == "_parseNoCache": -# endloc = f[0].f_locals["loc"] -# return endloc -# else: -# raise ParseFatalException("incorrect usage of getTokensEndLoc - may only be called from within a parse action") -# finally: -# del fstack -# -# def _makeTags(tagStr, xml): -# """Internal helper to construct opening and closing tag expressions, given a tag name""" -# if isinstance(tagStr,basestring): -# resname = tagStr -# tagStr = Keyword(tagStr, caseless=not xml) -# else: -# resname = tagStr.name -# -# tagAttrName = Word(alphas,alphanums+"_-:") -# if (xml): -# tagAttrValue = dblQuotedString.copy().setParseAction( removeQuotes ) -# openTag = Suppress("<") + tagStr("tag") + \ -# Dict(ZeroOrMore(Group( tagAttrName + Suppress("=") + tagAttrValue ))) + \ -# Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">") -# else: -# printablesLessRAbrack = "".join( [ c for c in printables if c not in ">" ] ) -# tagAttrValue = quotedString.copy().setParseAction( removeQuotes ) | Word(printablesLessRAbrack) -# openTag = Suppress("<") + tagStr("tag") + \ -# Dict(ZeroOrMore(Group( tagAttrName.setParseAction(downcaseTokens) + \ -# Optional( Suppress("=") + tagAttrValue ) ))) + \ -# Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">") -# closeTag = Combine(_L("") -# -# openTag = openTag.setResultsName("start"+"".join(resname.replace(":"," ").title().split())).setName("<%s>" % tagStr) -# closeTag = closeTag.setResultsName("end"+"".join(resname.replace(":"," ").title().split())).setName("" % tagStr) -# openTag.tag = resname -# closeTag.tag = resname -# return openTag, closeTag -# -# def makeHTMLTags(tagStr): -# """Helper to construct opening and closing tag expressions for HTML, given a tag name""" -# return _makeTags( tagStr, False ) -# -# def makeXMLTags(tagStr): -# """Helper to construct opening and closing tag expressions for XML, given a tag name""" -# return _makeTags( tagStr, True ) -# -# def withAttribute(*args,**attrDict): -# """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{} or C{
}. -# -# 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="right")}, or -# - as an explicit dict with C{**} operator, when an attribute name is also a Python -# reserved word, as in C{**{"class":"Customer", "align":"right"}} -# - a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") ) -# For attribute names with a namespace prefix, you must use the second form. Attribute -# names are matched insensitive to upper/lower case. -# -# To verify that the attribute exists, but without specifying a value, pass -# C{withAttribute.ANY_VALUE} as the value. -# """ -# 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,"no matching attribute " + attrName) -# if attrValue != withAttribute.ANY_VALUE and tokens[attrName] != attrValue: -# raise ParseException(s,l,"attribute '%s' has value '%s', must be '%s'" % -# (attrName, tokens[attrName], attrValue)) -# return pa -# withAttribute.ANY_VALUE = object() -# -# opAssoc = _Constants() -# opAssoc.LEFT = object() -# opAssoc.RIGHT = object() -# -# def infixNotation( baseExpr, opList, lpar=Suppress('('), rpar=Suppress(')') ): -# """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. -# -# 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=Suppress('(')) -# - rpar - expression for matching right-parentheses (default=Suppress(')')) -# """ -# ret = Forward() -# lastExpr = baseExpr | ( lpar + ret + rpar ) -# for i,operDef in enumerate(opList): -# opExpr,arity,rightLeftAssoc,pa = (operDef + (None,))[:4] -# if arity == 3: -# if opExpr is None or len(opExpr) != 2: -# raise ValueError("if numterms=3, opExpr must be a tuple or list of two expressions") -# opExpr1, opExpr2 = opExpr -# thisExpr = Forward()#.setName("expr%d" % i) -# 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("operator must be unary (1), binary (2), or ternary (3)") -# 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("operator must be unary (1), binary (2), or ternary (3)") -# else: -# raise ValueError("operator must indicate right or left associativity") -# if pa: -# matchExpr.setParseAction( pa ) -# thisExpr << ( matchExpr | lastExpr ) -# lastExpr = thisExpr -# ret << lastExpr -# return ret -# operatorPrecedence = infixNotation -# -# dblQuotedString = Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\x[0-9a-fA-F]+)|(?:\\.))*"').setName("string enclosed in double quotes") -# sglQuotedString = Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\x[0-9a-fA-F]+)|(?:\\.))*'").setName("string enclosed in single quotes") -# quotedString = Regex(r'''(?:"(?:[^"\n\r\\]|(?:"")|(?:\\x[0-9a-fA-F]+)|(?:\\.))*")|(?:'(?:[^'\n\r\\]|(?:'')|(?:\\x[0-9a-fA-F]+)|(?:\\.))*')''').setName("quotedString using single or double quotes") -# unicodeString = Combine(_L('u') + quotedString.copy()) -# -# def nestedExpr(opener="(", closer=")", content=None, ignoreExpr=quotedString.copy()): -# """Helper method for defining nested lists enclosed in opening and closing -# delimiters ("(" and ")" are the default). -# -# Parameters: -# - opener - opening character for a nested list (default="("); can also be a pyparsing expression -# - closer - closing character for a nested list (default=")"); can also be a pyparsing expression -# - content - expression for items within the nested lists (default=None) -# - ignoreExpr - expression for ignoring opening and closing delimiters (default=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. -# """ -# if opener == closer: -# raise ValueError("opening and closing strings cannot be the same") -# 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("opening and closing arguments must be strings if no content expression is given") -# ret = Forward() -# if ignoreExpr is not None: -# ret << Group( Suppress(opener) + ZeroOrMore( ignoreExpr | ret | content ) + Suppress(closer) ) -# else: -# ret << Group( Suppress(opener) + ZeroOrMore( ret | content ) + Suppress(closer) ) -# return ret -# -# def indentedBlock(blockStatementExpr, indentStack, indent=True): -# """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=True) -# -# A valid block must contain at least one C{blockStatement}. -# """ -# def checkPeerIndent(s,l,t): -# if l >= len(s): return -# curCol = col(l,s) -# if curCol != indentStack[-1]: -# if curCol > indentStack[-1]: -# raise ParseFatalException(s,l,"illegal nesting") -# raise ParseException(s,l,"not a peer entry") -# -# def checkSubIndent(s,l,t): -# curCol = col(l,s) -# if curCol > indentStack[-1]: -# indentStack.append( curCol ) -# else: -# raise ParseException(s,l,"not a subentry") -# -# def checkUnindent(s,l,t): -# if l >= len(s): return -# curCol = col(l,s) -# if not(indentStack and curCol < indentStack[-1] and curCol <= indentStack[-2]): -# raise ParseException(s,l,"not an unindent") -# indentStack.pop() -# -# NL = OneOrMore(LineEnd().setWhitespaceChars("\t ").suppress()) -# INDENT = Empty() + Empty().setParseAction(checkSubIndent) -# PEER = Empty().setParseAction(checkPeerIndent) -# UNDENT = Empty().setParseAction(checkUnindent) -# 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 -# -# alphas8bit = srange(r"[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]") -# punc8bit = srange(r"[\0xa1-\0xbf\0xd7\0xf7]") -# -# anyOpenTag,anyCloseTag = makeHTMLTags(Word(alphas,alphanums+"_:")) -# commonHTMLEntity = Combine(_L("&") + oneOf("gt lt amp nbsp quot").setResultsName("entity") +";").streamline() -# _htmlEntityMap = dict(zip("gt lt amp nbsp quot".split(),'><& "')) -# replaceHTMLEntity = lambda t : t.entity in _htmlEntityMap and _htmlEntityMap[t.entity] or None -# -# # it's easy to get these comment structures wrong - they're very common, so may as well make them available -# cStyleComment = Regex(r"/\*(?:[^*]*\*+)+?/").setName("C style comment") -# -# htmlComment = Regex(r"") -# restOfLine = Regex(r".*").leaveWhitespace() -# dblSlashComment = Regex(r"\/\/(\\\n|.)*").setName("// comment") -# cppStyleComment = Regex(r"/(?:\*(?:[^*]*\*+)+?/|/[^\n]*(?:\n[^\n]*)*?(?:(?" + str(tokenlist)) -# print ("tokens = " + str(tokens)) -# print ("tokens.columns = " + str(tokens.columns)) -# print ("tokens.tables = " + str(tokens.tables)) -# print (tokens.asXML("SQL",True)) -# except ParseBaseException, err: -# print (teststring + "->") -# print (err.line) -# print (" "*(err.column-1) + "^") -# print (err) -# print() -# -# selectToken = CaselessLiteral( "select" ) -# fromToken = CaselessLiteral( "from" ) -# -# ident = Word( alphas, alphanums + "_$" ) -# columnName = delimitedList( ident, ".", combine=True ).setParseAction( upcaseTokens ) -# columnNameList = Group( delimitedList( columnName ) )#.setName("columns") -# tableName = delimitedList( ident, ".", combine=True ).setParseAction( upcaseTokens ) -# tableNameList = Group( delimitedList( tableName ) )#.setName("tables") -# simpleSQL = ( selectToken + \ -# ( '*' | columnNameList ).setResultsName( "columns" ) + \ -# fromToken + \ -# tableNameList.setResultsName( "tables" ) ) -# -# test( "SELECT * from XYZZY, ABC" ) -# test( "select * from SYS.XYZZY" ) -# test( "Select A from Sys.dual" ) -# test( "Select AA,BB,CC from Sys.dual" ) -# test( "Select A, B, C from Sys.dual" ) -# test( "Select A, B, C from Sys.dual" ) -# test( "Xelect A, B, C from Sys.dual" ) -# test( "Select A, B, C frox Sys.dual" ) -# test( "Select" ) -# test( "Select ^^^ frox Sys.dual" ) -# test( "Select A, B, C from Sys.dual, Table2 " ) diff --git a/src/calibre/utils/search_query_parser.py b/src/calibre/utils/search_query_parser.py index 29573cb9c929..cc90e53bacc9 100644 --- a/src/calibre/utils/search_query_parser.py +++ b/src/calibre/utils/search_query_parser.py @@ -18,7 +18,6 @@ import sys, operator, weakref, re -from calibre.utils.pyparsing import ParseException from calibre.constants import preferred_encoding from calibre.utils.icu import sort_key from calibre import prints @@ -197,10 +196,10 @@ def location_expression(self): self.advance() res = self.or_expression() if self.token(advance=True) != ')': - raise ParseException('missing )') + raise ParseException(_('missing )')) return res if self.token_type() not in [ self.WORD, self.QUOTED_WORD ]: - raise ParseException('Invalid syntax. Expected a lookup name or a word') + raise ParseException(_('Invalid syntax. Expected a lookup name or a word')) return self.base_token() @@ -231,6 +230,14 @@ def base_token(self): return ['token', 'all', ':'.join(words)] +class ParseException(Exception): + + @property + def msg(self): + if len(self.args) > 0: + return self.args[0] + return "" + class SearchQueryParser(object): ''' Parses a search query. @@ -295,7 +302,7 @@ def _parse(self, query, candidates=None): try: res = self.parser.parse(query, self.locations) except RuntimeError: - raise ParseException('Failed to parse query, recursion limit reached: %s'%repr(query)) + raise ParseException(_('Failed to parse query, recursion limit reached: %s')%repr(query)) if candidates is None: candidates = self.universal_set() t = self.evaluate(res, candidates) @@ -339,12 +346,16 @@ def evaluate_token(self, argument, candidates): query = query[1:] try: if query in self.searches_seen: - raise ParseException(query, len(query), 'undefined saved search', self) + raise ParseException(_('Recursive saved search: {0}').format(query)) if self.recurse_level > 5: self.searches_seen.add(query) return self._parse(saved_searches().lookup(query), candidates) + except ParseException as e: + raise e except: # convert all exceptions (e.g., missing key) to a parse error - raise ParseException(query, len(query), 'undefined saved search', self) + import traceback + traceback.print_exc() + raise ParseException(_('Unknown error in saved search: {0}').format(query)) return self._get_matches(location, query, candidates) def _get_matches(self, location, query, candidates): diff --git a/src/calibre/web/feeds/recipes/model.py b/src/calibre/web/feeds/recipes/model.py index 60b74585afad..b5c123bd4f95 100644 --- a/src/calibre/web/feeds/recipes/model.py +++ b/src/calibre/web/feeds/recipes/model.py @@ -19,7 +19,7 @@ SchedulerConfig, download_builtin_recipe, update_custom_recipe, \ add_custom_recipe, remove_custom_recipe, get_custom_recipe, \ get_builtin_recipe -from calibre.utils.pyparsing import ParseException +from calibre.utils.search_query_parser import ParseException class NewsTreeItem(object):