Your IP : 216.73.216.196
��W� � @ s� d Z d Z d Z d Z d d l Z d d l m Z d d l Z d d l Z d d l
Z
d d l Z d d l Z d d l
Z
d d l Z d d l Z d d l Z d d l m Z y d d l m Z Wn" e k
r� d d l m Z Yn Xy d d l
m Z WnA e k
r@y d d l m Z Wn e k
r;d Z Yn XYn Xd
d d d
d d d d d d d d d d d d d d d d d d d d! d" d# d$ d% d& d' d( d) d* d+ d, d- d. d/ d0 d1 d2 d3 d4 d5 d6 d7 d8 d9 d: d; d< d= d> d? d@ dA dB dC dD dE dF dG dH dI dJ dK dL dM dN dO dP dQ dR dS dT dU dV dW dX dY dZ d[ d\ d] d^ d_ d` da db dc dd de df dg dh di dj dk dl dm dn do dp dq dr gi Z e e j � d ds � Z e d ds k Z e r�e j Z e Z! e" Z# e Z$ e% e& e' e( e) e e* e+ e, e- e. g Z/ nv e j0 Z e1 Z2 dt du � Z$ g Z/ d d l3 Z3 xF dv j4 � D]8 Z5 y e/ j6 e7 e3 e5 � � Wn e8 k
rgw0Yn Xq0We9 dw dx � e2 dy � D� � Z: dz d{ � Z; Gd| d} � d} e< � Z= e j> e j? Z@ d~ ZA eA d ZB e@ eA ZC e" d� � ZD d� jE d� dx � e jF D� � ZG Gd� d! � d! eH � ZI Gd� d# � d# eI � ZJ Gd� d% � d% eI � ZK Gd� d' � d' eK � ZL Gd� d* � d* eH � ZM Gd� d� � d� e< � ZN Gd� d& � d& e< � ZO e
jP jQ eO � d� d= � ZR d� dN � ZS d� dK � ZT d� d� � ZU d� d� � ZV d� d� � ZW d� dU � ZX d� d� d� � ZY Gd� d( � d( e< � ZZ Gd� d0 � d0 eZ � Z[ Gd� d � d e[ � Z\ Gd� d � d e[ � Z] Gd� d � d e[ � Z^ e^ Z_ e^ eZ _` Gd� d � d e[ � Za Gd� d � d e^ � Zb Gd� d � d ea � Zc Gd� dp � dp e[ � Zd Gd� d3 � d3 e[ � Ze Gd� d+ � d+ e[ � Zf Gd� d) � d) e[ � Zg Gd� d
� d
e[ � Zh Gd� d2 � d2 e[ � Zi Gd� d� � d� e[ � Zj Gd� d � d ej � Zk Gd� d � d ej � Zl Gd� d � d ej � Zm Gd� d. � d. ej � Zn Gd� d- � d- ej � Zo Gd� d5 � d5 ej � Zp Gd� d4 � d4 ej � Zq Gd� d$ � d$ eZ � Zr Gd� d
� d
er � Zs Gd� d � d er � Zt Gd� d � d er � Zu Gd� d � d er � Zv Gd� d" � d" eZ � Zw Gd� d � d ew � Zx Gd� d � d ew � Zy Gd� d� � d� ew � Zz Gd� d � d ez � Z{ Gd� d6 � d6 ez � Z| Gd� d� � d� e< � Z} e} � Z~ Gd� d � d ew � Z Gd� d, � d, ew � Z� Gd� d � d ew � Z� Gd� d� � d� e� � Z� Gd� d1 � d1 ew � Z� Gd� d � d e� � Z� Gd� d � d e� � Z� Gd� d � d e� � Z� Gd� d/ � d/ e� � Z� Gd� d � d e< � Z� d� df � Z� d� d� d� dD � Z� d d� d@ � Z� d� d� � Z� d� dS � Z� d� dR � Z� d� d� � Z� d� d� d� dW � Z� d� dE � Z� d� d� dk � Z� d� dl � Z� d� dn � Z� e\ � j� dG � Z� el � j� dM � Z� em � j� dL � Z� en � j� de � Z� eo � j� dd � Z� ee eD d� d� d� �j� d� d� � � Z� ef d� � j� d� d� � � Z� ef d� � j� d� d� � � Z� e� e� Be� Bee eG d� d� d� dy �Bef d� e j� � BZ� e� e� e� d� � e� � Z� e^ d� � e d� � j� d� � e� e{ e� e� B� � j� d� � d� Z� d� dc � Z� d� dQ � Z� d� d` � Z� d� d^ � Z� d� dq � Z� e� d� d� � � Z� e� d� d� � � Z� d� d� � Z� d� dO � Z� d� dP � Z� d� di � Z� e< � e� _� d� d� do � Z� e= � Z� e< � e� _� e< � e� _� e� d� � e� d� � d� dm � Z� e� Z� e� ef d� � d� � j� d� � Z� e� ef d� � d� � j� d� � Z� e� ef d� � d� ef d� � d� B� j� d � Z� e� e_ d� e� j � � j� d� Z� d� d� d e� j � ddT � Z� d� ddj � Z� e� d� Z� e� d� Z� e� ee e@ eC d� j� d� � \ Z� Z� e� e� d j4 � d
� � Z� ef d d jE e� j� � � d
� j� d� Z� dd_ � Z� e� ef d� d� j� d� Z� ef d� j� d� Z� ef d� j� � j� d� Z� ef d� j� d� Z� e� ef d� de� B� j� d� Z� e� Z� ef d� j� d� Z� e� e{ ee eG d� d� �e ee d � e^ d� � em � � � � j� � j� d � Z� e� e e� j � e� Bd d� �� j� d> � Z� Gd dr � dr � Z� e� d k r�eb d!� Z� eb d"� Z� ee e@ eC d#� Z� e� e� d$d%d� �j� e� � Z� e� e� e� � � j� d&� Z� d'e� BZ� e� e� d$d%d� �j� e� � Z� e� e� e� � � j� d(� Z� e� d)� e� d&� e� e� d(� Z� e� j� d*� e� j� j� d+� e� j� j� d+� e� j� j� d,� d d l� Z� e� j� j� e� e� j� � � e� j� j� d-� d S(. aS
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{"<salutation>, <addressee>!"}), built up using L{Word}, L{Literal}, and L{And} elements
(L{'+'<ParserElement.__add__>} operator gives L{And} expressions, strings are auto-converted to
L{Literal} expressions)::
from pyparsing import Word, alphas
# define grammar of a greeting
greet = Word(alphas) + "," + 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 L{ParseResults} object returned from L{ParserElement.parseString<ParserElement.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
z2.1.10z07 Oct 2016 01:31 UTCz*Paul McGuire <ptmcg@users.sourceforge.net>� N)�ref)�datetime)�RLock)� OrderedDict�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�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�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� locatedExpr� withClass�
CloseMatch�tokenMap�pyparsing_common� c C s� t | t � r | Sy t | � SWn\ t k
r t | � j t j � d � } t d � } | j d d � � | j | � SYn Xd S)a 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 | ... >.
�xmlcharrefreplacez&#\d+;c S s, d t t | d d d � � � d d � S)Nz\ur � � ���)�hex�int)�t� rw �:/opt/alt/python35/lib/python3.5/site-packages/pyparsing.py�<lambda>� s z_ustr.<locals>.<lambda>N)
�
isinstance�unicode�str�UnicodeEncodeError�encode�sys�getdefaultencodingr' �setParseAction�transformString)�obj�retZ
xmlcharrefrw rw rx �_ustr� s
r� z6sum len sorted reversed list tuple set any all min maxc c s | ] } | Vq d S)Nrw )�.0�yrw rw rx � <genexpr>� s r� rr c C sU d } d d � d j � D� } x/ t | | � D] \ } } | j | | � } q/ W| S)z/Escape &, <, >, ", ', etc. in a string of data.z&><"'c s s | ] } d | d Vq d S)�&�;Nrw )r� �srw rw rx r� � s z _xml_escape.<locals>.<genexpr>zamp gt lt quot apos)�split�zip�replace)�data� from_symbols�
to_symbols�from_�to_rw rw rx � _xml_escape� s
r� c @ s e Z d Z d S)�
_ConstantsN)�__name__�
__module__� __qualname__rw rw rw rx r� � s r� �
0123456789Z ABCDEFabcdef�\ � c c s$ | ] } | t j k r | Vq d S)N)�string�
whitespace)r� �crw rw rx r� � s c @ s| e Z d Z d Z d d d d d � Z e d d � � Z d d � Z d
d � Z d d
� Z d d d � Z
d d � Z d S)r z7base exception class for all parsing runtime exceptionsr Nc C s[ | | _ | d k r* | | _ d | _ n | | _ | | _ | | _ | | | f | _ d S)Nr� )�loc�msg�pstr�
parserElement�args)�selfr� r� r� �elemrw rw rx �__init__� s zParseBaseException.__init__c C s | | j | j | j | j � S)z�
internal factory method to simplify creating one type of ParseException
from another - avoids having __init__ signature conflicts among subclasses
)r� r� r� r� )�cls�perw rw rx �_from_exception� s z"ParseBaseException._from_exceptionc C sm | d k r t | j | j � S| d k r> t | j | j � S| d k r] t | j | j � St | � � d S)z�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
rJ r9 �columnrG N)r9 r� )rJ r� r� r9 rG �AttributeError)r� �anamerw rw rx � __getattr__� s z ParseBaseException.__getattr__c C s d | j | j | j | j f S)Nz"%s (at char %d), (line:%d, col:%d))r� r� rJ r� )r� rw rw rx �__str__� s zParseBaseException.__str__c C s
t | � S)N)r� )r� rw rw rx �__repr__� s zParseBaseException.__repr__z>!<c C sR | j } | j d } | rH d j | d | � | | | d � f � } | j � S)z�Extracts the exception line from the input string, and marks
the location of the exception with a special symbol.
rr r� N)rG r� �join�strip)r� � markerString�line_str� line_columnrw rw rx �
markInputline� s
z ParseBaseException.markInputlinec C s d j � t t | � � S)Nzlineno col line)r� �dir�type)r� rw rw rx �__dir__� s zParseBaseException.__dir__) r� r� r� �__doc__r� � classmethodr� r� r� r� r� r� rw rw rw rx r � s
c @ s e Z d Z d Z d S)r aN
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
Example::
try:
Word(nums).setName("integer").parseString("ABC")
except ParseException as pe:
print(pe)
print("column: {}".format(pe.col))
prints::
Expected integer (at char 0), (line:1, col:1)
column: 1
N)r� r� r� r� rw rw rw rx r � s c @ s e Z d Z d Z d S)r! znuser-throwable exception thrown when inconsistent parse content
is found; stops all parsing immediatelyN)r� r� r� r� rw rw rw rx r! s c @ s e Z d Z d Z d S)r# z�just like L{ParseFatalException}, but thrown internally when an
L{ErrorStop<And._ErrorStop>} ('-' operator) indicates that parsing is to stop
immediately because an unbacktrackable syntax error has been foundN)r� r� r� r� rw rw rw rx r# s c @ s. e Z d Z d Z d d � Z d d � Z d S)r& zZexception thrown by L{ParserElement.validate} if the grammar could be improperly recursivec C s
| | _ d S)N)�parseElementTrace)r� �parseElementListrw rw rx r� s z"RecursiveGrammarException.__init__c C s d | j S)Nz RecursiveGrammarException: %s)r� )r� rw rw rx r� s z!RecursiveGrammarException.__str__N)r� r� r� r� r� r� rw rw rw rx r& s c @ s@ e Z d Z d d � Z d d � Z d d � Z d d � Z d S)
�_ParseResultsWithOffsetc C s | | f | _ d S)N)�tup)r� �p1�p2rw rw rx r� $ s z _ParseResultsWithOffset.__init__c C s | j | S)N)r� )r� �irw rw rx � __getitem__& s z#_ParseResultsWithOffset.__getitem__c C s t | j d � S)Nr )�reprr� )r� rw rw rx r� ( s z _ParseResultsWithOffset.__repr__c C s | j d | f | _ d S)Nr )r� )r� r� rw rw rx � setOffset* s z!_ParseResultsWithOffset.setOffsetN)r� r� r� r� r� r� r� rw rw rw rx r� # s r� c @ sz e Z d Z d Z d d d d d d � Z d d d d e d d � Z d d � Z e d
d � Z d d
� Z d d � Z
d d � Z d d � Z e Z
d d � Z d d � Z d d � Z d d � Z d d � Z e r� e Z e Z e Z n6 e Z e Z e Z d d � Z d d! � Z d" d# � Z d$ d% � Z d& d' � Z d d( d) � Z d* d+ � Z d, d- � Z d. d/ � Z d0 d1 � Z d2 d3 � Z! d4 d5 � Z" d6 d7 � Z# d8 d9 � Z$ d: d; � Z% d< d= � Z& d> d? d@ � Z' dA dB � Z( dC dD � Z) dE dF � Z* d dG d> d dH dI � Z+ dJ dK � Z, dL dM � Z- d> dN d dO dP � Z. dQ dR � Z/ dS dT � Z0 dU dV � Z1 dW dX � Z2 dY dZ � Z3 d S)[r" aI
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.<resultsName>} - see L{ParserElement.setResultsName})
Example::
integer = Word(nums)
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
# date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
# parseString returns a ParseResults object
result = date_str.parseString("1999/12/31")
def test(s, fn=repr):
print("%s -> %s" % (s, fn(eval(s))))
test("list(result)")
test("result[0]")
test("result['month']")
test("result.day")
test("'month' in result")
test("'minutes' in result")
test("result.dump()", str)
prints::
list(result) -> ['1999', '/', '12', '/', '31']
result[0] -> '1999'
result['month'] -> '12'
result.day -> '31'
'month' in result -> True
'minutes' in result -> False
result.dump() -> ['1999', '/', '12', '/', '31']
- day: 31
- month: 12
- year: 1999
NTc C s/ t | | � r | St j | � } d | _ | S)NT)rz �object�__new__�_ParseResults__doinit)r� �toklist�name�asList�modal�retobjrw rw rx r� T s
zParseResults.__new__c
C s� | j r� d | _ d | _ d | _ i | _ | | _ | | _ | d k rQ g } | | t � rv | d d � | _ n- | | t � r� t | � | _ n | g | _ t � | _
| d k r�| r�| s� d | j | <| | t � r� t | � } | | _ | | t
d � t t f � o(| d d g f k s�| | t � rC| g } | r�| | t � rtt | j � d � | | <n t t | d � d � | | <| | | _ n: y | d | | <Wn% t t t f k
r�| | | <Yn Xd S)NFr r� )r� �_ParseResults__name�_ParseResults__parent�_ParseResults__accumNames�_ParseResults__asList�_ParseResults__modal�list�_ParseResults__toklist�_generatorType�dict�_ParseResults__tokdictru r� r� �
basestringr" r� �copy�KeyError� TypeError�
IndexError)r� r� r� r� r� rz rw rw rx r� ] sB
3 zParseResults.__init__c C sd t | t t f � r | j | S| | j k rB | j | d d St d d � | j | D� � Sd S)Nrr r c S s g | ] } | d � q S)r rw )r� �vrw rw rx �
<listcomp>� s z,ParseResults.__getitem__.<locals>.<listcomp>rs )rz ru �slicer� r� r� r" )r� r� rw rw rx r� � s
zParseResults.__getitem__c C s� | | t � rB | j j | t � � | g | j | <| d } n` | | t t f � rm | | j | <| } n5 | j j | t � � t | d � g | j | <| } | | t � r� t | � | _ d S)Nr )
r� r� �getr� ru r� r� r" �wkrefr� )r� �kr� rz �subrw rw rx � __setitem__� s &
/zParseResults.__setitem__c
C s
t | t t f � r� t | j � } | j | =t | t � rf | d k rS | | 7} t | | d � } t t | j | � � � } | j � x{ | j j
� D]] \ } } xN | D]F } x= t | � D]/ \ } \ } } t | | | | k � | | <q� Wq� Wq� Wn
| j | =d S)Nr rr )
rz ru r� �lenr� r� �range�indices�reverser� �items� enumerater� )
r� r� �mylen�removedr� � occurrences�jr� �value�positionrw rw rx � __delitem__� s
,zParseResults.__delitem__c C s
| | j k S)N)r� )r� r� rw rw rx � __contains__� s zParseResults.__contains__c C s
t | j � S)N)r� r� )r� rw rw rx �__len__� s zParseResults.__len__c C s | j S)N)r� )r� rw rw rx �__bool__� s zParseResults.__bool__c C s
t | j � S)N)�iterr� )r� rw rw rx �__iter__� s zParseResults.__iter__c C s t | j d d d � � S)Nrr rs )r� r� )r� rw rw rx � __reversed__� s zParseResults.__reversed__c C s0 t | j d � r | j j � St | j � Sd S)N�iterkeys)�hasattrr� r� r� )r� rw rw rx � _iterkeys� s
zParseResults._iterkeysc s � f d d � � j � D� S)Nc 3 s | ] } � | Vq d S)Nrw )r� r� )r� rw rx r� � s z+ParseResults._itervalues.<locals>.<genexpr>)r� )r� rw )r� rx � _itervalues� s zParseResults._itervaluesc s � f d d � � j � D� S)Nc 3 s | ] } | � | f Vq d S)Nrw )r� r� )r� rw rx r� � s z*ParseResults._iteritems.<locals>.<genexpr>)r� )r� rw )r� rx �
_iteritems� s zParseResults._iteritemsc C s t | j � � S)zVReturns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x).)r� r� )r� rw rw rx �keys� s zParseResults.keysc C s t | j � � S)zXReturns all named result values (as a list in Python 2.x, as an iterator in Python 3.x).)r� �
itervalues)r� rw rw rx �values� s zParseResults.valuesc C s t | j � � S)zfReturns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x).)r� � iteritems)r� rw rw rx r� � s zParseResults.itemsc C s
t | j � S)z�Since keys() returns an iterator, this method is helpful in bypassing
code that looks for the existence of any defined results names.)�boolr� )r� rw rw rx �haskeys� s zParseResults.haskeysc O s� | s d g } xI | j � D]; \ } } | d k rG | d | f } q t d | � � q Wt | d t � s� t | � d k s� | d | k r� | d } | | } | | =| S| d } | Sd S)a�
Removes and returns item at specified index (default=C{last}).
Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
argument or an integer argument, it will use C{list} semantics
and pop tokens from the list of parsed tokens. If passed a
non-integer argument (most likely a string), it will use C{dict}
semantics and pop the corresponding value from any defined
results names. A second default return value argument is
supported, just as in C{dict.pop()}.
Example::
def remove_first(tokens):
tokens.pop(0)
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
label = Word(alphas)
patt = label("LABEL") + OneOrMore(Word(nums))
print(patt.parseString("AAB 123 321").dump())
# Use pop() in a parse action to remove named result (note that corresponding value is not
# removed from list form of results)
def remove_LABEL(tokens):
tokens.pop("LABEL")
return tokens
patt.addParseAction(remove_LABEL)
print(patt.parseString("AAB 123 321").dump())
prints::
['AAB', '123', '321']
- LABEL: AAB
['AAB', '123', '321']
rr �defaultr z-pop() got an unexpected keyword argument '%s'Nrs )r� r� rz ru r� )r� r� �kwargsr� r� �indexr� � defaultvaluerw rw rx �pop� s "
zParseResults.popc C s | | k r | | S| Sd S)ai
Returns named result matching the given key, or if there is no
such name, then returns the given C{defaultValue} or C{None} if no
C{defaultValue} is specified.
Similar to C{dict.get()}.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString("1999/12/31")
print(result.get("year")) # -> '1999'
print(result.get("hour", "not specified")) # -> 'not specified'
print(result.get("hour")) # -> None
Nrw )r� �key� defaultValuerw rw rx r� s zParseResults.getc C sw | j j | | � x] | j j � D]L \ } } x= t | � D]/ \ } \ } } t | | | | k � | | <q< Wq# Wd S)a
Inserts new element at location index in the list of parsed tokens.
Similar to C{list.insert()}.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to insert the parse location in the front of the parsed results
def insert_locn(locn, tokens):
tokens.insert(0, locn)
print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
N)r� �insertr� r� r� r� )r� r �insStrr� r� r� r� r� rw rw rx r 2 s zParseResults.insertc C s | j j | � d S)a�
Add single element to end of ParseResults list of elements.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to compute the sum of the parsed integers, and add it to the end
def append_sum(tokens):
tokens.append(sum(map(int, tokens)))
print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
N)r� �append)r� �itemrw rw rx r F s zParseResults.appendc C s0 t | t � r | | 7} n | j j | � d S)a
Add sequence of elements to end of ParseResults list of elements.
Example::
patt = OneOrMore(Word(alphas))
# use a parse action to append the reverse of the matched strings, to make a palindrome
def make_palindrome(tokens):
tokens.extend(reversed([t[::-1] for t in tokens]))
return ''.join(tokens)
print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
N)rz r" r� �extend)r� �itemseqrw rw rx r
T s
zParseResults.extendc C s! | j d d � =| j j � d S)z7
Clear all elements and results names.
N)r� r� �clear)r� rw rw rx r f s zParseResults.clearc C s y | | SWn t k
r$ d SYn X| | j k rw | | j k rV | j | d d St d d � | j | D� � Sn d Sd S)Nr� rr r c S s g | ] } | d � q S)r rw )r� r� rw rw rx r� w s z,ParseResults.__getattr__.<locals>.<listcomp>rs )r� r� r� r" )r� r� rw rw rx r� m s
!zParseResults.__getattr__c C s | j � } | | 7} | S)N)r� )r� �otherr� rw rw rx �__add__{ s
zParseResults.__add__c s� | j r� t | j � � � f d d � � | j j � } � f d d � | D� } xD | D]< \ } } | | | <t | d t � rY t | � | d _ qY W| j | j 7_ | j j | j � | S)Nc s | d k r � S| � S)Nr rw )�a)�offsetrw rx ry � s z'ParseResults.__iadd__.<locals>.<lambda>c sF g | ]< \ } } | D]) } | t | d � | d � � f � q q S)r rr )r� )r� r� �vlistr� )� addoffsetrw rx r� � s z)ParseResults.__iadd__.<locals>.<listcomp>r )
r� r� r� r� rz r" r� r� r� �update)r� r �
otheritems�otherdictitemsr� r� rw )r r rx �__iadd__� s
zParseResults.__iadd__c C s1 t | t � r% | d k r% | j � S| | Sd S)Nr )rz ru r� )r� r rw rw rx �__radd__� s
zParseResults.__radd__c C s d t | j � t | j � f S)Nz(%s, %s))r� r� r� )r� rw rw rx r� � s zParseResults.__repr__c C s% d d j d d � | j D� � d S)N�[z, c s s6 | ], } t | t � r$ t | � n t | � Vq d S)N)rz r" r� r� )r� r� rw rw rx r� � s z'ParseResults.__str__.<locals>.<genexpr>�])r� r� )r� rw rw rx r� � s zParseResults.__str__r� c C sl g } x_ | j D]T } | r/ | r/ | j | � t | t � rQ | | j � 7} q | j t | � � q W| S)N)r� r rz r" �
_asStringListr� )r� �sep�outr rw rw rx r � s
zParseResults._asStringListc C s d d � | j D� S)a�
Returns the parse results as a nested list of matching tokens, all converted to strings.
Example::
patt = OneOrMore(Word(alphas))
result = patt.parseString("sldkj lsdkj sldkj")
# even though the result prints in string-like form, it is actually a pyparsing ParseResults
print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
# Use asList() to create an actual list
result_list = result.asList()
print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
c S s1 g | ]' } t | t � r' | j � n | � q Srw )rz r" r� )r� �resrw rw rx r� � s z'ParseResults.asList.<locals>.<listcomp>)r� )r� rw rw rx r� � s zParseResults.asListc sM t r | j } n | j } � f d d � � t � f d d � | � D� � S)a�
Returns the named parse results as a nested dictionary.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
result_dict = result.asDict()
print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
# even though a ParseResults supports dict-like access, sometime you just need to have a dict
import json
print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
c sG t | t � r? | j � r% | j � S� f d d � | D� Sn | Sd S)Nc s g | ] } � | � � q Srw rw )r� r� )�toItemrw rx r� � s z7ParseResults.asDict.<locals>.toItem.<locals>.<listcomp>)rz r" r �asDict)r� )r! rw rx r! � s
z#ParseResults.asDict.<locals>.toItemc 3 s' | ] \ } } | � | � f Vq d S)Nrw )r� r� r� )r! rw rx r� � s z&ParseResults.asDict.<locals>.<genexpr>)�PY_3r� r� r� )r� �item_fnrw )r! rx r" � s
zParseResults.asDictc C sP t | j � } | j j � | _ | j | _ | j j | j � | j | _ | S)zA
Returns a new copy of a C{ParseResults} object.
)r" r� r� r� r� r� r r� )r� r� rw rw rx r� � s zParseResults.copyFc C s� d } g } t d d � | j j � D� � } | d } | sP d } d } d } d } | d k rk | } n | j r} | j } | s� | r� d Sd } | | | d | d g 7} xt | j � D]� \ }
} t | t � rC|
| k r| | j | |
| o| d k | | � g 7} q�| | j d | o0| d k | | � g 7} q� d } |
| k r_| |
} | sw| rqq� n d } t t
| � � }
| | | d | d |
d
| d g 7} q� W| | | d
| d g 7} d j | � S) z�
(Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
�
c s s2 | ]( \ } } | D] } | d | f Vq q d S)rr Nrw )r� r� r r� rw rw rx r� � s z%ParseResults.asXML.<locals>.<genexpr>z r� N�ITEM�<�>z</) r� r� r� r� r� r� rz r" �asXMLr� r� r� )r� �doctag�namedItemsOnly�indent� formatted�nlr �
namedItems�nextLevelIndent�selfTagr� r �resTag� xmlBodyTextrw rw rx r) � sT "
zParseResults.asXMLc C sK xD | j j � D]3 \ } } x$ | D] \ } } | | k r# | Sq# Wq Wd S)N)r� r� )r� r� r� r r� r� rw rw rx �__lookup$ s
zParseResults.__lookupc C s� | j r | j S| j r? | j � } | r8 | j | � Sd Snm t | � d k r� t | j � d k r� t t | j j � � � d d d k r� t t | j j � � � Sd Sd S)a(
Returns the results name for this token expression. Useful when several
different expressions might match at a particular location.
Example::
integer = Word(nums)
ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
house_number_expr = Suppress('#') + Word(nums, alphanums)
user_data = (Group(house_number_expr)("house_number")
| Group(ssn_expr)("ssn")
| Group(integer)("age"))
user_info = OneOrMore(user_data)
result = user_info.parseString("22 111-22-3333 #221B")
for item in result:
print(item.getName(), ':', item[0])
prints::
age : 22
ssn : 111-22-3333
house_number : 221B
Nrr r rs )r rs ) r� r� �_ParseResults__lookupr� r� �nextr� r� r� )r� �parrw rw rx �getName+ s
)zParseResults.getNamer c C s� g } d } | j | t | j � � � | r�| j � rt d d � | j � D� � } xh| D]� \ } } | r� | j | � | j d | d | | f � t | t � r� | r� | j | j | | d � � q� | j t | � � qa | j t | � � qa Wn� t
d d � | D� � r�| } x� t | � D]� \ } }
t |
t � r�| j d | d | | | d | d |
j | | d � f � q/| j d | d | | | d | d t |
� f � q/Wd j | � S)
aH
Diagnostic method for listing out the contents of a C{ParseResults}.
Accepts an optional C{indent} argument so that this string can be embedded
in a nested display of other data.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(result.dump())
prints::
['12', '/', '31', '/', '1999']
- day: 1999
- month: 31
- year: 12
r% c s s' | ] \ } } t | � | f Vq d S)N)r| )r� r� r� rw rw rx r� g s z$ParseResults.dump.<locals>.<genexpr>z
%s%s- %s: z rr c s s | ] } t | t � Vq d S)N)rz r" )r� �vvrw rw rx r� s s z
%s%s[%d]:
%s%s%sr� )
r r� r� r �sortedr� rz r" �dumpr� �anyr� r� ) r� r, �depth�fullr �NLr� r� r� r� r9 rw rw rx r; P s,
B9zParseResults.dumpc O s t j | j � | | � d S)a�
Pretty-printer for parsed results as a list, using the C{pprint} module.
Accepts additional positional or keyword args as defined for the
C{pprint.pprint} method. (U{http://docs.python.org/3/library/pprint.html#pprint.pprint})
Example::
ident = Word(alphas, alphanums)
num = Word(nums)
func = Forward()
term = ident | num | Group('(' + func + ')')
func <<= ident + Group(Optional(delimitedList(term)))
result = func.parseString("fna a,b,(fnb c,d,200),100")
result.pprint(width=40)
prints::
['fna',
['a',
'b',
['(', 'fnb', ['c', 'd', '200'], ')'],
'100']]
N)�pprintr� )r� r� r rw rw rx r@ } s zParseResults.pprintc C sC | j | j j � | j d k r- | j � p0 d | j | j f f S)N)r� r� r� r� r� r� )r� rw rw rx � __getstate__� s
zParseResults.__getstate__c C sm | d | _ | d \ | _ } } | _ i | _ | j j | � | d k r` t | � | _ n d | _ d S)Nr rr )r� r� r� r� r r� r� )r� �stater7 � inAccumNamesrw rw rx � __setstate__� s
zParseResults.__setstate__c C s | j | j | j | j f S)N)r� r� r� r� )r� rw rw rx �__getnewargs__� s zParseResults.__getnewargs__c C s t t | � � t | j � � S)N)r� r� r� r� )r� rw rw rx r� � s zParseResults.__dir__)4r� r� r� r� r� rz r� r� r� r� r� r� r� � __nonzero__r� r� r� r� r� r# r� r� r� r� r� r� r r r� r r r
r r� r r r r� r� r r� r" r� r) r5 r8 r; r@ rA rD rE r� rw rw rw rx r" - sh & '
4 # = %-
c C sW | } d | k o# t | � k n r@ | | d d k r@ d S| | j d d | � S)a 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}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}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.
r rr r% )r� �rfind)r� �strgr� rw rw rx r9 � s
c C s | j d d | � d S)a Returns current line number within a string, counting newlines as line separators.
The first line is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}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.
r% r rr )�count)r� rH rw rw rx rJ � s
c C s[ | j d d | � } | j d | � } | d k rE | | d | � S| | d d � Sd S)zfReturns the line of text containing loc within a string, counting newlines as line separators.
r% r rr N)rG �find)r� rH �lastCR�nextCRrw rw rx rG � s
c C sF t d t | � d t | � d t | | � t | | � f � d S)NzMatch z at loc z(%d,%d))�printr� rJ r9 )�instringr� �exprrw rw rx �_defaultStartDebugAction� s rP c C s, t d t | � d t | j � � � d S)NzMatched z -> )rM r� r| r� )rN �startloc�endlocrO �toksrw rw rx �_defaultSuccessDebugAction� s rT c C s t d t | � � d S)NzException raised:)rM r� )rN r� rO �excrw rw rx � _defaultExceptionDebugAction� s rV c G s d S)zG'Do-nothing' debug action, to suppress debugging output during parsing.Nrw )r� rw rw rx rQ � s rq c s � t k r � f d d � Sd g � d g � t d d � d k re d d d � } d d
d � � n t j } t j � d } | d
d � d } | d | d | f � � � � � � � f d d � } d } y" t � d t � d � j � } Wn t k
rt � � } Yn X| | _ | S)Nc s
� | � S)Nrw )r� �lrv )�funcrw rx ry � s z _trim_arity.<locals>.<lambda>r Frq ro � c S sJ t d k r d n d } t j d | | d � | } | j | j f g S)
Nro rY r rq �limitrr )ro rY r ������)�system_version� traceback�
extract_stack�filenamerJ )rZ r �
frame_summaryrw rw rx r_ s z"_trim_arity.<locals>.extract_stackc S s2 t j | d | �} | d } | j | j f g S)NrZ rr rs )r^ �
extract_tbr` rJ )�tbrZ �framesra rw rw rx rb s
z _trim_arity.<locals>.extract_tb� rZ rr c s� x� y, � | � d d � � } d � d <| SWq t k
r� � d rO � nD z= t j � d } � | d d �d d d � � k s� � Wd ~ X� d � k r� � d d 7<w � Yq Xq Wd S)Nr Trr rZ rq rs rs )r� r �exc_info)r� r� rc )rb �
foundArityrX rZ �maxargs�pa_call_line_synthrw rx �wrapper s"
&z _trim_arity.<locals>.wrapperz<parse action>r� � __class__)ro rY rs ) �singleArgBuiltinsr] r^ r_ rb �getattrr� � Exceptionr| )rX rh r_ � LINE_DIFF� this_linerj � func_namerw )rb rg rX rZ rh ri rx � _trim_arity� s* !
rr c s� e Z d Z d Z d Z d Z e d d � � Z e d d � � Z d d d � Z d
d � Z
d d
� Z d d d � Z d d d � Z
d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d d � Z d! d" � Z d d d# d$ � Z d% d& � Z d' d( � Z Gd) d* � d* e � Z e d+ k rOGd, d- � d- e � Z n Gd. d- � d- e � Z i Z e � Z d/ d/ g Z d d d0 d1 � Z! e Z" e d2 d3 � � Z# d Z$ e d4 d5 d6 � � Z% d d7 d8 � Z& e' d d9 d: � Z( d; d< � Z) e' d= d> � Z* e' d d? d@ � Z+ dA dB � Z, dC dD � Z- dE dF � Z. dG dH � Z/ dI dJ � Z0 dK dL � Z1 dM dN � Z2 dO dP � Z3 dQ dR � Z4 dS dT � Z5 dU dV � Z6 dW dX � Z7 dY dZ � Z8 d+ d[ d\ � Z9 d] d^ � Z: d_ d` � Z; da db � Z< dc dd � Z= de df � Z> dg dh � Z? d di dj � Z@ dk dl � ZA dm dn � ZB do dp � ZC dq dr � ZD g ds dt � ZE d du dv � ZF � f dw dx � ZG dy dz � ZH d{ d| � ZI d} d~ � ZJ d d� � ZK d d� d� � ZL d d� d d d d� d� � ZM � S)�r$ z)Abstract base level parser element class.z
Fc C s
| t _ d S)a�
Overrides the default whitespace chars
Example::
# default whitespace chars are space, <TAB> and newline
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def', 'ghi', 'jkl']
# change to just treat newline as significant
ParserElement.setDefaultWhitespaceChars(" \t")
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def']
N)r$ �DEFAULT_WHITE_CHARS)�charsrw rw rx �setDefaultWhitespaceChars= s
z'ParserElement.setDefaultWhitespaceCharsc C s
| t _ d S)a�
Set class to be used for inclusion of string literals into a parser.
Example::
# default literal class used is Literal
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# change to Suppress
ParserElement.inlineLiteralsUsing(Suppress)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '12', '31']
N)r$ �_literalStringClass)r� rw rw rx �inlineLiteralsUsingL s z!ParserElement.inlineLiteralsUsingc C s� t � | _ d | _ d | _ d | _ | | _ d | _ t j | _ d | _
d | _ d | _ t � | _
d | _ d | _ d | _ d | _ d | _ d | _ d | _ d | _ d | _ d S)NTFr� )NNN)r� � parseAction�
failAction�strRepr� resultsName�
saveAsList�skipWhitespacer$ rs �
whiteChars�copyDefaultWhiteChars�mayReturnEmpty�keepTabs� ignoreExprs�debug� streamlined�
mayIndexError�errmsg� modalResults� debugActions�re� callPreparse�
callDuringTry)r� �savelistrw rw rx r� a s( zParserElement.__init__c C sT t j | � } | j d d � | _ | j d d � | _ | j rP t j | _ | S)a$
Make a copy of this C{ParserElement}. Useful for defining different parse actions
for the same parsing pattern, using copies of the original parse element.
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress("K")
integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
prints::
[5120, 100, 655360, 268435456]
Equivalent form of C{expr.copy()} is just C{expr()}::
integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
N)r� rx r� r r$ rs r~ )r� �cpyrw rw rx r� x s zParserElement.copyc C s; | | _ d | j | _ t | d � r7 | j | j _ | S)af
Define name for this expression, makes debugging and exception messages clearer.
Example::
Word(nums).parseString("ABC") # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
Word(nums).setName("integer").parseString("ABC") # -> Exception: Expected integer (at char 0), (line:1, col:1)
z Expected � exception)r� r� r� r� r� )r� r� rw rw rx �setName� s
zParserElement.setNamec C sH | j � } | j d � r1 | d d � } d } | | _ | | _ | S)aP
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__>}.
Example::
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
�*Nrr Trs )r� �endswithr{ r� )r� r� �listAllMatches�newselfrw rw rx �setResultsName� s
z ParserElement.setResultsNameTc sa | r< | j � d d � f d d � } � | _ | | _ n! t | j d � r] | j j | _ | S)z�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.
Tc s) d d l } | j � � | | | | � S)Nr )�pdb� set_trace)rN r� � doActions� callPreParser� )� _parseMethodrw rx �breaker� s
z'ParserElement.setBreak.<locals>.breaker�_originalParseMethod)�_parser� r� )r� � breakFlagr� rw )r� rx �setBreak� s zParserElement.setBreakc O s7 t t t t | � � � | _ | j d d � | _ | S)a
Define action to perform when successfully matching parse element definition.
Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
- s = the original string being parsed (see note below)
- loc = the location of the matching substring
- toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
If the functions in fns modify the tokens, they can return them as the return
value from fn, and the modified list of tokens will replace the original.
Otherwise, fn does not need to return any value.
Optional keyword arguments:
- callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{parseString}<parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
Example::
integer = Word(nums)
date_str = integer + '/' + integer + '/' + integer
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# use parse action to convert to ints at parse time
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
date_str = integer + '/' + integer + '/' + integer
# note that integer fields are now ints, not strings
date_str.parseString("1999/12/31") # -> [1999, '/', 12, '/', 31]
r� F)r� �maprr rx r� r� )r� �fnsr rw rw rx r� � s " z ParserElement.setParseActionc O sF | j t t t t | � � � 7_ | j p< | j d d � | _ | S)z�
Add parse action to expression's list of parse actions. See L{I{setParseAction}<setParseAction>}.
See examples in L{I{copy}<copy>}.
r� F)rx r� r� rr r� r� )r� r� r rw rw rx �addParseAction� s $ z ParserElement.addParseActionc s� | j d d � � | j d d � r* t n t � x6 | D]. � � � � f d d � } | j j | � q7 W| j p� | j d d � | _ | S)a� Add a boolean predicate function to expression's list of parse actions. See
L{I{setParseAction}<setParseAction>} for function call signatures. Unlike C{setParseAction},
functions passed to C{addCondition} need to return boolean success/fail of the condition.
Optional keyword arguments:
- message = define a custom message to be used in the raised exception
- fatal = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
year_int = integer.copy()
year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
date_str = year_int + '/' + integer + '/' + integer
result = date_str.parseString("1999/12/31") # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
�messagez failed user-defined condition�fatalFc s4 t t � � | | | � � s0 � | | � � � d S)N)r rr )r� rW rv )�exc_type�fnr� rw rx �pa s z&ParserElement.addCondition.<locals>.par� )r� r! r rx r r� )r� r� r r� rw )r� r� r� rx � addCondition� s
zParserElement.addConditionc C s
| | _ | S)a 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.)ry )r� r� rw rw rx �
setFailAction s
zParserElement.setFailActionc C so d } xb | rj d } xO | j D]D } y) x" | j | | � \ } } d } q+ WWq t k
rb Yq Xq Wq W| S)NTF)r� r� r )r� rN r� �
exprsFound�e�dummyrw rw rx �_skipIgnorables# s
z ParserElement._skipIgnorablesc C sj | j r | j | | � } | j rf | j } t | � } x* | | k re | | | k re | d 7} q< W| S)Nrr )r� r� r} r~ r� )r� rN r� �wt�instrlenrw rw rx �preParse0 s zParserElement.preParsec C s
| g f S)Nrw )r� rN r� r� rw rw rx � parseImpl< s zParserElement.parseImplc C s | S)Nrw )r� rN r� � tokenlistrw rw rx � postParse? s zParserElement.postParsec " C s� | j } | s | j r6| j d r< | j d | | | � | r` | j r` | j | | � } n | } | } yV y | j | | | � \ } } Wn0 t k
r� t | t | � | j | � � Yn XWq�t
k
r2} zN | j d r� | j d | | | | � | j r | j | | | | � � WYd d } ~ Xq�Xn� | rZ| j rZ| j | | � } n | } | } | j s�| t | � k r�y | j | | | � \ } } Wq�t k
r�t | t | � | j | � � Yq�Xn | j | | | � \ } } | j | | | � } t
| | j d | j d | j �}
| j rw| sB| j rw| r yo xh | j D]] } | | | |
� } | d k rUt
| | j d | j o�t | t
t f � d | j �}
qUWWqwt
k
r} z/ | j d r�| j d | | | | � � WYd d } ~ XqwXnk xh | j D]] } | | | |
� } | d k rt
| | j d | j odt | t
t f � d | j �}
qW| r�| j d r�| j d | | | | |
� | |
f S)Nr rq r� r� rr )r� ry r� r� r� r� r� r r� r� r r� r� r" r{ r| r� rx r� rz r� ) r� rN r� r� r� � debugging�preloc� tokensStart�tokens�err� retTokensr� rw rw rx �
_parseNoCacheC sp
'
&$
zParserElement._parseNoCachec C sO y | j | | d d �d SWn* t k
rJ t | | | j | � � Yn Xd S)Nr� Fr )r� r! r r� )r� rN r� rw rw rx �tryParse� s
zParserElement.tryParsec C s; y | j | | � Wn t t f k
r2 d SYn Xd Sd S)NFT)r� r r� )r� rN r� rw rw rx � canParseNext� s
zParserElement.canParseNextc @ s e Z d Z d d � Z d S)z ParserElement._UnboundedCachec s� i � t � | _ � � � f d d � } � f d d � } � f d d � } t j | | � | _ t j | | � | _ t j | | � | _ d S)Nc s � j | � � S)N)r� )r� r )�cache� not_in_cacherw rx r� � s z3ParserElement._UnboundedCache.__init__.<locals>.getc s | � | <d S)Nrw )r� r r� )r� rw rx �set� s z3ParserElement._UnboundedCache.__init__.<locals>.setc s � j � d S)N)r )r� )r� rw rx r � s z5ParserElement._UnboundedCache.__init__.<locals>.clear)r� r� �types�
MethodTyper� r� r )r� r� r� r rw )r� r� rx r� � s z&ParserElement._UnboundedCache.__init__N)r� r� r� r� rw rw rw rx �_UnboundedCache� s r� Nc @ s e Z d Z d d � Z d S)zParserElement._FifoCachec s� t � | _ � t � � � � f d d � } � � f d d � } � f d d � } t j | | � | _ t j | | � | _ t j | | � | _ d S)Nc s � j | � � S)N)r� )r� r )r� r� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.getc s- | � | <t � � � k r) � j d � d S)NF)r� �popitem)r� r r� )r� �sizerw rx r� � s
z.ParserElement._FifoCache.__init__.<locals>.setc s � j � d S)N)r )r� )r� rw rx r � s z0ParserElement._FifoCache.__init__.<locals>.clear)r� r� � _OrderedDictr� r� r� r� r )r� r� r� r� r rw )r� r� r� rx r� � s z!ParserElement._FifoCache.__init__N)r� r� r� r� rw rw rw rx �
_FifoCache� s r� c @ s e Z d Z d d � Z d S)zParserElement._FifoCachec s� t � | _ � i � t j g � � � � � f d d � } � � � f d d � } � � f d d � } t j | | � | _ t j | | � | _ t j | | � | _ d S)Nc s � j | � � S)N)r� )r� r )r� r� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.getc sC | � | <t � � � k r2 � j � j � d � � j | � d S)N)r� r �popleftr )r� r r� )r� �key_fifor� rw rx r� � s
z.ParserElement._FifoCache.__init__.<locals>.setc s � j � � j � d S)N)r )r� )r� r� rw rx r � s
z0ParserElement._FifoCache.__init__.<locals>.clear) r� r� � collections�dequer� r� r� r� r )r� r� r� r� r rw )r� r� r� r� rx r� � s z!ParserElement._FifoCache.__init__N)r� r� r� r� rw rw rw rx r� � s r c C s: d \ } } | | | | | f } t j � t j } | j | � } | | j k r� t j | d 7<y | j | | | | � } WnD t k
r� }
z$ | j | |
j |
j
� � � WYd d }
~
Xq/X| j | | d | d j � f � | Sn> t j | d 7<t | t
� r| � | d | d j � f SWd QRXd S)Nr rr )r rr )r$ �packrat_cache_lock�
packrat_cacher� r� �packrat_cache_statsr� r r� rk r� r� rz rn ) r� rN r� r� r� �HIT�MISS�lookupr� r� r� rw rw rx � _parseCache� s$
$zParserElement._parseCachec C s4 t j j � d g t t j � t j d d � <d S)Nr )r$ r� r r� r� rw rw rw rx �
resetCache� s
zParserElement.resetCache� c C sR t j sN d t _ | d k r0 t j � t _ n t j | � t _ t j t _ d S)a� 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.
Parameters:
- cache_size_limit - (default=C{128}) - if an integer value is provided
will limit the size of the packrat cache; if None is passed, then
the cache size will be unbounded; if 0 is passed, the cache will
be effectively disabled.
This speedup may break existing programs that use parse actions that
have side-effects. For this reason, packrat parsing is disabled when
you first import pyparsing. To activate the packrat feature, your
program must call the class method C{ParserElement.enablePackrat()}. If
your program uses C{psyco} to "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.
Example::
import pyparsing
pyparsing.ParserElement.enablePackrat()
TN)r$ �_packratEnabledr� r� r� r� r� )�cache_size_limitrw rw rx �
enablePackrat s zParserElement.enablePackratc C s� t j � | j s | j � x | j D] } | j � q' W| j sP | j � } yT | j | d � \ } } | r� | j | | � } t � t
� } | j | | � Wn: t k
r� } z t j r� � n | � WYd d } ~ Xn X| Sd S)aB
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}<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}
Example::
Word('a').parseString('aaaaabaaa') # -> ['aaaaa']
Word('a').parseString('aaaaabaaa', parseAll=True) # -> Exception: Expected end of text
r N)
r$ r� r� �
streamliner� r� �
expandtabsr� r� r
r) r �verbose_stacktrace)r� rN �parseAllr� r� r� �serU rw rw rx � parseString# s$
zParserElement.parseStringc c s� | j s | j � x | j D] } | j � q W| j sL t | � j � } t | � } d } | j } | j } t j
� d } y� x� | | k r\| | k r\y. | | | � }
| | |
d d �\ } } Wn t k
r� |
d } Yq� X| | k rO| d 7} | |
| f V| rF| | | � }
|
| k r9| } qL| d 7} qY| } q� |
d } q� WWn: t k
r�} z t j
r�� n | � WYd d } ~ Xn Xd S)a�
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}<parseString>} for more information on parsing
strings with embedded tabs.
Example::
source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
print(source)
for tokens,start,end in Word(alphas).scanString(source):
print(' '*start + '^'*(end-start))
print(' '*start + tokens[0])
prints::
sldjf123lsdjjkf345sldkjf879lkjsfd987
^^^^^
sldjf
^^^^^^^
lsdjjkf
^^^^^^
sldkjf
^^^^^^
lkjsfd
r r� Frr N)r� r� r� r� r� r� r� r� r� r$ r� r r r� )r� rN �
maxMatches�overlapr� r� r� �
preparseFn�parseFn�matchesr� �nextLocr� �nextlocrU rw rw rx �
scanStringU sB
zParserElement.scanStringc C s1 g } d } d | _ y� x� | j | � D]} \ } } } | j | | | � � | r� t | t � rv | | j � 7} n) t | t � r� | | 7} n
| j | � | } q( W| j | | d � � d d � | D� } d j t t t
| � � � SWn: t k
r,} z t j
r� n | � WYd d } ~ Xn Xd S)af
Extension to C{L{scanString}}, to modify matching text with modified tokens that may
be returned from a parse action. To use C{transformString}, define a grammar and
attach a parse action to it that modifies the returned token list.
Invoking C{transformString()} on a target string will then scan for matches,
and replace the matched text patterns according to the logic in the parse
action. C{transformString()} returns the resulting transformed string.
Example::
wd = Word(alphas)
wd.setParseAction(lambda toks: toks[0].title())
print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
Prints::
Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
r TNc S s g | ] } | r | � q Srw rw )r� �orw rw rx r� � s z1ParserElement.transformString.<locals>.<listcomp>r� )r� r� r rz r" r� r� r� r� r� �_flattenr r$ r� )r� rN r �lastErv r� r� rU rw rw rx r� � s(
z ParserElement.transformStringc C sh y' t d d � | j | | � D� � SWn: t k
rc } z t j rK � n | � WYd d } ~ Xn Xd S)a~
Another extension to C{L{scanString}}, simplifying the access to the tokens found
to match the given parse expression. May be called with optional
C{maxMatches} argument, to clip searching after 'n' matches are found.
Example::
# a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
cap_word = Word(alphas.upper(), alphas.lower())
print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
prints::
['More', 'Iron', 'Lead', 'Gold', 'I']
c S s g | ] \ } } } | � q Srw rw )r� rv r� r� rw rw rx r� � s z.ParserElement.searchString.<locals>.<listcomp>N)r" r� r r$ r� )r� rN r� rU rw rw rx � searchString� s ' zParserElement.searchStringc c sl d } d } xJ | j | d | �D]3 \ } } } | | | � V| rO | d V| } q" W| | d � Vd S)a[
Generator method to split a string using the given expression as a separator.
May be called with optional C{maxsplit} argument, to limit the number of splits;
and the optional C{includeSeparators} argument (default=C{False}), if the separating
matching text should be included in the split results.
Example::
punc = oneOf(list(".,;:/-!?"))
print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
prints::
['This', ' this', '', ' this sentence', ' is badly punctuated', '']
r r� N)r� ) r� rN �maxsplit�includeSeparators�splits�lastrv r� r� rw rw rx r� � s
%
zParserElement.splitc C sa t | t � r t j | � } t | t � sQ t j d t | � t d d �d St | | g � S)a�
Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
converts them to L{Literal}s by default.
Example::
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
Prints::
Hello, World! -> ['Hello', ',', 'World', '!']
z4Cannot combine element of type %s with ParserElement�
stacklevelrq N) rz r� r$ rv �warnings�warnr� �
SyntaxWarningr )r� r rw rw rx r � s
zParserElement.__add__c C sY t | t � r t j | � } t | t � sQ t j d t | � t d d �d S| | S)z]
Implementation of + operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementr� rq N)rz r� r$ rv r� r� r� r� )r� r rw rw rx r s
zParserElement.__radd__c C sj t | t � r t j | � } t | t � sQ t j d t | � t d d �d St | t j � | g � S)zQ
Implementation of - operator, returns C{L{And}} with error stop
z4Cannot combine element of type %s with ParserElementr� rq N)
rz r� r$ rv r� r� r� r� r �
_ErrorStop)r� r rw rw rx �__sub__ s
zParserElement.__sub__c C sY t | t � r t j | � } t | t � sQ t j d t | � t d d �d S| | S)z]
Implementation of - operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementr� rq N)rz r� r$ rv r� r� r� r� )r� r rw rw rx �__rsub__ s
zParserElement.__rsub__c sB t | t � r | d } } n0t | t � r:| d d d � } | d d k rb d | d f } t | d t � r� | d d k r� | d d k r� t � � S| d d k r� t � � S� | d t � � SqOt | d t � rt | d t � r| \ } } | | 8} qOt d t | d � t | d � � � n t d t | � � � | d k rgt d � � | d k rt d � � | | k o�d k n r�t d � � | r� � f d
d � � | r| d k r�� � | � } qt � g | � � | � } q>� | � } n( | d k r+� } n t � g | � } | S)
a�
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}
r Nrq rr z7cannot multiply 'ParserElement' and ('%s','%s') objectsz0cannot multiply 'ParserElement' and '%s' objectsz/cannot multiply ParserElement by negative valuez@second tuple value must be greater or equal to first tuple valuez+cannot multiply ParserElement by 0 or (0,0)c s2 | d k r$ t � � | d � � St � � Sd S)Nrr )r )�n)�makeOptionalListr� rw rx r� ] s z/ParserElement.__mul__.<locals>.makeOptionalList)NN) rz ru �tupler2 r r� r� �
ValueErrorr )r� r � minElements� optElementsr� rw )r� r� rx �__mul__, sD #
&
) zParserElement.__mul__c C s
| j | � S)N)r� )r� r rw rw rx �__rmul__p s zParserElement.__rmul__c C sa t | t � r t j | � } t | t � sQ t j d t | � t d d �d St | | g � S)zI
Implementation of | operator - returns C{L{MatchFirst}}
z4Cannot combine element of type %s with ParserElementr� rq N) rz r� r$ rv r� r� r� r� r )r� r rw rw rx �__or__s s
zParserElement.__or__c C sY t | t � r t j | � } t | t � sQ t j d t | � t d d �d S| | BS)z]
Implementation of | operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementr� rq N)rz r� r$ rv r� r� r� r� )r� r rw rw rx �__ror__ s
zParserElement.__ror__c C sa t | t � r t j | � } t | t � sQ t j d t | � t d d �d St | | g � S)zA
Implementation of ^ operator - returns C{L{Or}}
z4Cannot combine element of type %s with ParserElementr� rq N) rz r� r$ rv r� r� r� r� r )r� r rw rw rx �__xor__� s
zParserElement.__xor__c C sY t | t � r t j | � } t | t � sQ t j d t | � t d d �d S| | AS)z]
Implementation of ^ operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementr� rq N)rz r� r$ rv r� r� r� r� )r� r rw rw rx �__rxor__� s
zParserElement.__rxor__c C sa t | t � r t j | � } t | t � sQ t j d t | � t d d �d St | | g � S)zC
Implementation of & operator - returns C{L{Each}}
z4Cannot combine element of type %s with ParserElementr� rq N) rz r� r$ rv r� r� r� r� r )r� r rw rw rx �__and__� s
zParserElement.__and__c C sY t | t � r t j | � } t | t � sQ t j d t | � t d d �d S| | @S)z]
Implementation of & operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementr� rq N)rz r� r$ rv r� r� r� r� )r� r rw rw rx �__rand__� s
zParserElement.__rand__c C s
t | � S)zE
Implementation of ~ operator - returns C{L{NotAny}}
)r )r� rw rw rx �
__invert__� s zParserElement.__invert__c C s' | d k r | j | � S| j � Sd S)a
Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be
passed as C{True}.
If C{name} is omitted, same as calling C{L{copy}}.
Example::
# these are equivalent
userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno")
userdata = Word(alphas)("name") + Word(nums+"-")("socsecno")
N)r� r� )r� r� rw rw rx �__call__� s
zParserElement.__call__c C s
t | � S)z�
Suppresses the output of this C{ParserElement}; useful to keep punctuation from
cluttering up returned output.
)r+ )r� rw rw rx �suppress� s zParserElement.suppressc C s
d | _ | S)a
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.
F)r} )r� rw rw rx �leaveWhitespace� s z ParserElement.leaveWhitespacec C s d | _ | | _ d | _ | S)z8
Overrides the default whitespace chars
TF)r} r~ r )r� rt rw rw rx �setWhitespaceChars� s z ParserElement.setWhitespaceCharsc C s
d | _ | S)z�
Overrides default behavior to expand C{<TAB>}s to spaces before parsing the input string.
Must be called before C{parseString} when the input grammar contains elements that
match C{<TAB>} characters.
T)r� )r� rw rw rx �
parseWithTabs� s zParserElement.parseWithTabsc C sl t | t � r t | � } t | t � rL | | j k rh | j j | � n | j j t | j � � � | S)a�
Define expression to be ignored (e.g., comments) while doing pattern
matching; may be called repeatedly, to define multiple comment or other
ignorable patterns.
Example::
patt = OneOrMore(Word(alphas))
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
patt.ignore(cStyleComment)
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
)rz r� r+ r� r r� )r� r rw rw rx �ignore� s
zParserElement.ignorec C s1 | p t | p t | p t f | _ d | _ | S)zT
Enable display of debugging messages while doing pattern matching.
T)rP rT rV r� r� )r� � startAction�
successAction�exceptionActionrw rw rx �setDebugActions
s
z ParserElement.setDebugActionsc C s) | r | j t t t � n d | _ | S)a�
Enable display of debugging messages while doing pattern matching.
Set C{flag} to True to enable, False to disable.
Example::
wd = Word(alphas).setName("alphaword")
integer = Word(nums).setName("numword")
term = wd | integer
# turn on debugging for wd
wd.setDebug()
OneOrMore(term).parseString("abc 123 xyz 890")
prints::
Match alphaword at loc 0(1,1)
Matched alphaword -> ['abc']
Match alphaword at loc 3(1,4)
Exception raised:Expected alphaword (at char 4), (line:1, col:5)
Match alphaword at loc 7(1,8)
Matched alphaword -> ['xyz']
Match alphaword at loc 11(1,12)
Exception raised:Expected alphaword (at char 12), (line:1, col:13)
Match alphaword at loc 15(1,16)
Exception raised:Expected alphaword (at char 15), (line:1, col:16)
The output shown is that produced by the default debug actions - custom debug actions can be
specified using L{setDebugActions}. Prior to attempting
to match the C{wd} expression, the debugging message C{"Match <exprname> at loc <n>(<line>,<col>)"}
is shown. Then if the parse succeeds, a C{"Matched"} message is shown, or an C{"Exception raised"}
message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
which makes debugging and exception messages easier to understand - for instance, the default
name created for the C{Word} expression without calling C{setName} is C{"W:(ABCD...)"}.
F)r rP rT rV r� )r� �flagrw rw rx �setDebug s # zParserElement.setDebugc C s | j S)N)r� )r� rw rw rx r� @ s zParserElement.__str__c C s
t | � S)N)r� )r� rw rw rx r� C s zParserElement.__repr__c C s d | _ d | _ | S)NT)r� rz )r� rw rw rx r� F s zParserElement.streamlinec C s d S)Nrw )r� r� rw rw rx �checkRecursionK s z ParserElement.checkRecursionc C s | j g � d S)zj
Check defined expressions for valid structure, check for infinite recursive definitions.
N)r )r� �
validateTracerw rw rx �validateN s zParserElement.validatec C s� y | j � } Wn7 t k
rI t | d � � } | j � } Wd QRXYn Xy | j | | � SWn: t k
r� } z t j r� � n | � WYd d } ~ Xn Xd S)z�
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.
�rN)�readr� �openr� r r$ r� )r� �file_or_filenamer� �
file_contents�frU rw rw rx � parseFileT s
zParserElement.parseFilec sd t | t � r1 | | k p0 t | � t | � k St | t � rM | j | � St t | � | k Sd S)N)rz r$ �varsr� r� �super)r� r )rk rw rx �__eq__h s
"
zParserElement.__eq__c C s | | k S)Nrw )r� r rw rw rx �__ne__p s zParserElement.__ne__c C s t t | � � S)N)�hash�id)r� rw rw rx �__hash__s s zParserElement.__hash__c C s
| | k S)Nrw )r� r rw rw rx �__req__v s zParserElement.__req__c C s | | k S)Nrw )r� r rw rw rx �__rne__y s zParserElement.__rne__c C s> y! | j t | � d | �d SWn t k
r9 d SYn Xd S)a�
Method for quick testing of a parser against a test string. Good for simple
inline microtests of sub expressions while building up larger parser.
Parameters:
- testString - to test against this expression for a match
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
Example::
expr = Word(nums)
assert expr.matches("100")
r� TFN)r� r� r )r� �
testStringr� rw rw rx r� | s
zParserElement.matches�#c C s� t | t � r3 t t t j | j � j � � � } t | t � rN t | � } g } g } d } x#| D]}
| d k r� | j |
d � s� | r� |
r� | j
|
� qg |
s� qg d j | � |
g } g } yQ |
j d d � }
| j
|
d | �} | j
| j d | � � | o| } Wn#t k
r�}
z� t |
t � rGd n d } d |
k r�| j
t |
j |
� � | j
d
t |
j |
� d d | � n | j
d
|
j d | � | j
d
t |
� � | o�| } |
} WYd d }
~
XnN t k
rB} z. | j
d t | � � | o'| } | } WYd d } ~ Xn X| ro| r\| j
d � t d j | � � | j
|
| f � qg W| | f S)a3
Execute the parse expression on a series of test strings, showing each
test, the parsed results or where the parse failed. Quick and easy way to
run a parse expression against a list of sample strings.
Parameters:
- tests - a list of separate test strings, or a multiline string of test strings
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
- comment - (default=C{'#'}) - expression for indicating embedded comments in the test
string; pass None to disable comment filtering
- fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
if False, only dump nested list
- printResults - (default=C{True}) prints test output to stdout
- failureTests - (default=C{False}) indicates if these tests are expected to fail parsing
Returns: a (success, results) tuple, where success indicates that all tests succeeded
(or failed if C{failureTests} is True), and the results contain a list of lines of each
test's output
Example::
number_expr = pyparsing_common.number.copy()
result = number_expr.runTests('''
# unsigned integer
100
# negative integer
-100
# float with scientific notation
6.02e23
# integer with scientific notation
1e-12
''')
print("Success" if result[0] else "Failed!")
result = number_expr.runTests('''
# stray character
100Z
# missing leading digit before '.'
-.100
# too many '.'
3.14.159
''', failureTests=True)
print("Success" if result[0] else "Failed!")
prints::
# unsigned integer
100
[100]
# negative integer
-100
[-100]
# float with scientific notation
6.02e23
[6.02e+23]
# integer with scientific notation
1e-12
[1e-12]
Success
# stray character
100Z
^
FAIL: Expected end of text (at char 3), (line:1, col:4)
# missing leading digit before '.'
-.100
^
FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
# too many '.'
3.14.159
^
FAIL: Expected end of text (at char 4), (line:1, col:5)
Success
Each test string must be on a single line. If you want to test a string that spans multiple
lines, create a test like this::
expr.runTest(r"this is a test\n of strings that spans \n 3 lines")
(Note that this is a raw string literal, you must include the leading 'r'.)
TNFr% z\nr� r> z(FATAL)r� � rr �^zFAIL: zFAIL-EXCEPTION: )rz r� r� r� r| r� �rstrip�
splitlinesr r� r r� r� r� r; r r! rG r� r9 rn rM )r� �testsr� �comment�fullDump� printResults� failureTests�
allResults�comments�successrv r �resultr� r� rU rw rw rx �runTests� sN W$
+
,
zParserElement.runTests)Nr� r� r� r� rs r� � staticmethodru rw r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� �_MAX_INTr� r� r� r� r r r� r� r� r� r� r� r� r� r� r r r r r r r r r r
r� r� r� r r r r r r r r r� r0 rw rw )rk rx r$ 8 s� &
H "2G + D
) c s( e Z d Z d Z � f d d � Z � S)r, zT
Abstract C{ParserElement} subclass, for defining atomic matching patterns.
c s t t | � j d d � d S)Nr� F)r r, r� )r� )rk rw rx r� s zToken.__init__)r� r� r� r� r� rw rw )rk rx r, s c s( e Z d Z d Z � f d d � Z � S)r
z,
An empty token, will always match.
c s2 t t | � j � d | _ d | _ d | _ d S)Nr
TF)r r
r� r� r� r� )r� )rk rw rx r� s zEmpty.__init__)r� r� r� r� r� rw rw )rk rx r
s c s7 e Z d Z d Z � f d d � Z d d d � Z � S)r z(
A token that will never match.
c s; t t | � j � d | _ d | _ d | _ d | _ d S)Nr TFzUnmatchable token)r r r� r� r� r� r� )r� )rk rw rx r� * s
zNoMatch.__init__Tc C s t | | | j | � � d S)N)r r� )r� rN r� r� rw rw rx r� 1 s zNoMatch.parseImpl)r� r� r� r� r� r� rw rw )rk rx r & s c s7 e Z d Z d Z � f d d � Z d d d � Z � S)r a�
Token to exactly match a specified string.
Example::
Literal('blah').parseString('blah') # -> ['blah']
Literal('blah').parseString('blahfooblah') # -> ['blah']
Literal('blah').parseString('bla') # -> Exception: Expected "blah"
For case-insensitive matching, use L{CaselessLiteral}.
For keyword matching (force word break before and after the matched string),
use L{Keyword} or L{CaselessKeyword}.
c s� t t | � j � | | _ t | � | _ y | d | _ Wn1 t k
ro t j d t
d d �t | _ Yn Xd t
| j � | _ d | j | _ d | _ d | _ d S)Nr z2null string passed to Literal; use Empty() insteadr� rq z"%s"z Expected F)r r r� �matchr� �matchLen�firstMatchCharr� r� r� r� r
rk r� r� r� r� r� )r� � matchString)rk rw rx r� C s
zLiteral.__init__Tc C sg | | | j k rK | j d k s7 | j | j | � rK | | j | j f St | | | j | � � d S)Nrr )r5 r4 �
startswithr3 r r� )r� rN r� r� rw rw rx r� V s $zLiteral.parseImpl)r� r� r� r� r� r� rw rw )rk rx r 5 s
c sk e Z d Z d Z e d Z d d � f d d � Z d d d � Z � f d
d � Z e d d
� � Z
� S)r a\
Token to exactly match a specified string as a keyword, that is, it must be
immediately followed by a non-keyword character. Compare with C{L{Literal}}:
- C{Literal("if")} will match the leading C{'if'} in C{'ifAndOnlyIf'}.
- C{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}.
Example::
Keyword("start").parseString("start") # -> ['start']
Keyword("start").parseString("starting") # -> Exception
For case-insensitive matching, use L{CaselessKeyword}.
z_$NFc s� t t | � j � | d k r( t j } | | _ t | � | _ y | d | _ Wn( t k
r{ t j
d t d d �Yn Xd | j | _ d | j | _
d | _ d | _ | | _ | r� | j � | _ | j � } t | � | _ d S)Nr z2null string passed to Keyword; use Empty() insteadr� rq z"%s"z Expected F)r r r� �DEFAULT_KEYWORD_CHARSr3 r� r4 r5 r� r� r� r� r� r� r� r� �caseless�upper�
caselessmatchr� �
identChars)r� r6 r< r9 )rk rw rx r� q s&
zKeyword.__init__Tc C se | j r� | | | | j � j � | j k rI| t | � | j k sh | | | j j � | j k rI| d k s� | | d j � | j k rI| | j | j f Sn� | | | j k rI| j d k s� | j | j | � rI| t | � | j k s| | | j | j k rI| d k s5| | d | j k rI| | j | j f St | | | j
| � � d S)Nr rr ) r9 r4 r: r; r� r< r3 r5 r7 r r� )r� rN r� r� rw rw rx r� � s &9)$3#zKeyword.parseImplc s% t t | � j � } t j | _ | S)N)r r r� r8 r< )r� r� )rk rw rx r� � s z Keyword.copyc C s
| t _ d S)z,Overrides the default Keyword chars
N)r r8 )rt rw rw rx �setDefaultKeywordChars� s z Keyword.setDefaultKeywordChars) r� r� r� r� r3 r8 r� r� r� r1 r= rw rw )rk rx r ^ s
c s7 e Z d Z d Z � f d d � Z d d d � Z � S)r al
Token to match a specified string, ignoring case of letters.
Note: the matched results will always be in the case of the given
match string, NOT the case of the input text.
Example::
OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
(Contrast with example for L{CaselessKeyword}.)
c sI t t | � j | j � � | | _ d | j | _ d | j | _ d S)Nz'%s'z Expected )r r r� r: � returnStringr� r� )r� r6 )rk rw rx r� � s zCaselessLiteral.__init__Tc C sV | | | | j � j � | j k r: | | j | j f St | | | j | � � d S)N)r4 r: r3 r> r r� )r� rN r� r� rw rw rx r� � s &zCaselessLiteral.parseImpl)r� r� r� r� r� r� rw rw )rk rx r � s
c s: e Z d Z d Z d � f d d � Z d d d � Z � S)r z�
Caseless version of L{Keyword}.
Example::
OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
(Contrast with example for L{CaselessLiteral}.)
Nc s# t t | � j | | d d �d S)Nr9 T)r r r� )r� r6 r< )rk rw rx r� � s zCaselessKeyword.__init__Tc C s� | | | | j � j � | j k rs | t | � | j k s_ | | | j j � | j k rs | | j | j f St | | | j | � � d S)N)r4 r: r; r� r< r3 r r� )r� rN r� r� rw rw rx r� � s &9zCaselessKeyword.parseImpl)r� r� r� r� r� r� rw rw )rk rx r � s c s: e Z d Z d Z d � f d d � Z d d d � Z � S)rl ax
A variation on L{Literal} which matches "close" matches, that is,
strings with at most 'n' mismatching characters. C{CloseMatch} takes parameters:
- C{match_string} - string to be matched
- C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
The results from a successful parse will contain the matched text from the input string and the following named results:
- C{mismatches} - a list of the positions within the match_string where mismatches were found
- C{original} - the original match_string used to compare against the input string
If C{mismatches} is an empty list, then the match was an exact match.
Example::
patt = CloseMatch("ATCATCGAATGGA")
patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
# exact match
patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
# close match allowing up to 2 mismatches
patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
rr c s] t t | � j � | | _ | | _ | | _ d | j | j f | _ d | _ d | _ d S)Nz&Expected %r (with up to %d mismatches)F) r rl r� r� � match_string�
maxMismatchesr� r� r� )r� r? r@ )rk rw rx r� � s zCloseMatch.__init__Tc C s | } t | � } | t | j � } | | k r� | j } d } g } | j }
x� t t | | | � | j � � D]D \ } } | \ } }
| |
k rr | j | � t | � |
k rr Pqr W| d } t | | | � g � } | j | d <| | d <| | f St | | | j | � � d S)Nr rr �original�
mismatches) r� r? r@ r� r� r r" r r� )r� rN r� r� �startr� �maxlocr? �match_stringlocrB r@ �s_m�src�mat�resultsrw rw rx r� � s( /
zCloseMatch.parseImpl)r� r� r� r� r� r� rw rw )rk rx rl � s c s[ e Z d Z d Z d d d d d d � f d d � Z d d d
� Z � f d d � Z � S)
r/ a
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{excludeChars} parameter can list characters that might be found in
the input C{bodyChars} string; useful to define a word of all printables
except for one or two characters, for instance.
L{srange} is useful for defining custom character set strings for defining
C{Word} expressions, using range notation from regular expression character sets.
A common mistake is to use C{Word} to match a specific literal string, as in
C{Word("Address")}. Remember that C{Word} uses the string argument to define
I{sets} of matchable characters. This expression would match "Add", "AAA",
"dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'.
To match an exact literal string, use L{Literal} or L{Keyword}.
pyparsing includes helper strings for building Words:
- L{alphas}
- L{nums}
- L{alphanums}
- L{hexnums}
- L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
- L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
- L{printables} (any non-whitespace character)
Example::
# a word composed of digits
integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
# a word with a leading capital, and zero or more lowercase
capital_word = Word(alphas.upper(), alphas.lower())
# hostnames are alphanumeric, with leading alpha, and '-'
hostname = Word(alphas, alphanums+'-')
# roman numeral (not a strict parser, accepts invalid mix of characters)
roman = Word("IVXLCDM")
# any string of non-whitespace characters, except for ','
csv_value = Word(printables, excludeChars=",")
Nrr r Fc sv t t | � j � � rc d j � f d d � | D� � } | rc d j � f d d � | D� � } | | _ t | � | _ | r� | | _ t | � | _ n | | _ t | � | _ | d k | _ | d k r� t
d � � | | _ | d k r� | | _ n t
| _ | d k r#| | _ | | _ t | � | _ d | j | _ d | _ | | _ d
| j | j k rr| d k rr| d k rr| d k rr| j | j k r�d t | j � | _ ne t | j � d k r�d t j | j � t | j � f | _ n% d
t | j � t | j � f | _ | j r;d | j d | _ y t j | j � | _ Wn t k
rqd | _ Yn Xd S)Nr� c 3 s! | ] } | � k r | Vq d S)Nrw )r� r� )� excludeCharsrw rx r� 7
s z Word.__init__.<locals>.<genexpr>c 3 s! | ] } | � k r | Vq d S)Nrw )r� r� )rJ rw rx r� 9
s r rr zZcannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permittedz Expected Fr# z[%s]+z%s[%s]*z [%s][%s]*z\b)r r/ r� r� �
initCharsOrigr� � initChars�
bodyCharsOrig� bodyChars� maxSpecifiedr� �minLen�maxLenr2 r� r� r� r� � asKeyword�_escapeRegexRangeChars�reStringr� r� �escape�compilern )r� rL rN �min�max�exactrR rJ )rk )rJ rx r� 4
sT "" :
z
Word.__init__Tc
C s� | j rX | j j | | � } | s< t | | | j | � � | j � } | | j � f S| | | j k r� t | | | j | � � | } | d 7} t | � } | j } | | j } t
| | � } x* | | k r� | | | k r� | d 7} q� Wd } | | | j k rd } | j r;| | k r;| | | k r;d } | j
r�| d k rd| | d | k s�| | k r�| | | k r�d } | r�t | | | j | � � | | | | � f S)Nrr FTr )r� r3 r r� �end�grouprL r� rN rQ rW rP rO rR )
r� rN r� r� r/ rC r� � bodycharsrD �throwExceptionrw rw rx r� j
s6
% <zWord.parseImplc s� y t t | � j � SWn t k
r+ Yn X| j d k r� d d � } | j | j k r� d | | j � | | j � f | _ n d | | j � | _ | j S)Nc S s, t | � d k r$ | d d � d S| Sd S)N� z...)r� )r� rw rw rx �
charsAsStr�
s z Word.__str__.<locals>.charsAsStrz W:(%s,%s)zW:(%s))r r/ r� rn rz rK rM )r� r_ )rk rw rx r� �
s
(z Word.__str__)r� r� r� r� r� r� r� rw rw )rk rx r/
s .$6#c sa e Z d Z d Z e e j d � � Z d � f d d � Z d d d � Z � f d d
� Z
� S) r' a�
Token for matching strings that match a given regular expression.
Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
If the given regex contains named groups (defined using C{(?P<name>...)}), these will be preserved as
named parse results.
Example::
realnum = Regex(r"[+-]?\d+\.\d*")
date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
# ref: http://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
roman = Regex(r"M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
z[A-Z]r c s1 t t | � j � t | t � r� | s> t j d t d d �| | _ | | _ y+ t
j | j | j � | _
| j | _ Wq� t
j k
r� t j d | t d d �� Yq� XnI t | t j � r� | | _
t | � | _ | _ | | _ n t d � � t | � | _ d | j | _ d | _ d | _ d S)
z�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.z0null string passed to Regex; use Empty() insteadr� rq z$invalid pattern (%s) passed to RegexzCRegex may only be constructed with a string or a compiled RE objectz Expected FTN)r r' r� rz r� r� r� r� �pattern�flagsr� rV rT �
sre_constants�error�compiledREtyper| r� r� r� r� r� r� )r� r` ra )rk rw rx r� �
s.
zRegex.__init__Tc C s� | j j | | � } | s3 t | | | j | � � | j � } | j � } t | j � � } | r� x | D] } | | | | <qj W| | f S)N)r� r3 r r� rZ � groupdictr" r[ )r� rN r� r� r/ �dr� r� rw rw rx r� �
s
zRegex.parseImplc sX y t t | � j � SWn t k
r+ Yn X| j d k rQ d t | j � | _ | j S)NzRe:(%s))r r' r� rn rz r� r` )r� )rk rw rx r� �
s
z
Regex.__str__) r� r� r� r� r� r� rV rd r� r� r� rw rw )rk rx r' �
s
"
c s[ e Z d Z d Z d d d d d d � f d d � Z d d d � Z � f d d
� Z � S) r% a�
Token for matching strings that are delimited by quoting characters.
Defined with the following parameters:
- quoteChar - string of one or more characters defining the quote delimiting string
- escChar - character to escape quotes, typically backslash (default=C{None})
- escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=C{None})
- multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
- unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
- endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} => same as quoteChar)
- convertWhitespaceEscapes - convert escaped whitespace (C{'\t'}, C{'\n'}, etc.) to actual whitespace (default=C{True})
Example::
qs = QuotedString('"')
print(qs.searchString('lsjdf "This is the quote" sldjf'))
complex_qs = QuotedString('{{', endQuoteChar='}}')
print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
sql_qs = QuotedString('"', escQuote='""')
print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
prints::
[['This is the quote']]
[['This is the "quote"']]
[['This is the quote with "embedded" quotes']]
NFTc s t t � � j � | j � } | sD t j d t d d �t � � | d k rY | } n1 | j � } | s� t j d t d d �t � � | � _ t | � � _
| d � _ | � _ t | � � _
| � _ | � _ | � _ | � _ | rNt j t j B� _ d t j � j � t � j d � | d k r>t | � pAd f � _ nP d � _ d t j � j � t � j d � | d k r�t | � p�d f � _ t � j � d k r�� j d
d j � f d d
� t t � j � d d d � D� � d 7_ | r!� j d t j | � 7_ | r\� j d t j | � 7_ t j � j � d � _ � j d t j � j � 7_ y+ t j � j � j � � _ � j � _ Wn5 t j k
r�t j d � j t d d �� Yn Xt � � � _! d � j! � _" d � _# d � _$ d S)Nz$quoteChar cannot be the empty stringr� rq z'endQuoteChar cannot be the empty stringr z %s(?:[^%s%s]r� z%s(?:[^%s\n\r%s]rr z|(?:z)|(?:c 3 sB | ]8 } d t j � j d | � � t � j | � f Vq d S)z%s[^%s]N)r� rU � endQuoteCharrS )r� r� )r� rw rx r� / s z(QuotedString.__init__.<locals>.<genexpr>�)z|(?:%s)z|(?:%s.)z(.)z)*%sz$invalid pattern (%s) passed to Regexz Expected FTrs )%r r% r� r� r� r� r� � SyntaxError� quoteCharr� � quoteCharLen�firstQuoteCharrg �endQuoteCharLen�escChar�escQuote�unquoteResults�convertWhitespaceEscapesr� � MULTILINE�DOTALLra rU rS r` r� r� �escCharReplacePatternrV rT rb rc r� r� r� r� r� )r� rj rn ro � multilinerp rg rq )rk )r� rx r� sf
( %E
zQuotedString.__init__c C sA | | | j k r( | j j | | � p+ d } | sL t | | | j | � � | j � } | j � } | j r7| | j | j � } t
| t � r7d | k r� | j r� d d d d d d d d i } x, | j
� D] \ } } | j | | � } q� W| j rt j | j d
| � } | j r7| j | j | j � } | | f S) N�\z\t� z\nr% z\f� z\r�
z\g<1>)rl r� r3 r r� rZ r[ rp rk rm rz r� rq r� r� rn r� rt ro rg ) r� rN r� r� r/ r� �ws_map�wslit�wscharrw rw rx r� G s( . zQuotedString.parseImplc s[ y t t | � j � SWn t k
r+ Yn X| j d k rT d | j | j f | _ | j S)Nz.quoted string, starting with %s ending with %s)r r% r� rn rz rj rg )r� )rk rw rx r� j s
zQuotedString.__str__)r� r� r� r� r� r� r� rw rw )rk rx r% �
s $A#c sR e Z d Z d Z d d d � f d d � Z d d d � Z � f d d
� Z � S) r a�
Token for matching words composed of characters I{not} in a given set (will
include whitespace in matched characters if not listed in the provided exclusion set - see example).
Defined with string containing all disallowed characters, and an optional
minimum, maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction.
Example::
# define a comma-separated-value as anything that is not a ','
csv_value = CharsNotIn(',')
print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
prints::
['dkls', 'lsdkjf', 's12 34', '@!#', '213']
rr r c s� t t | � j � d | _ | | _ | d k r= t d � � | | _ | d k r^ | | _ n t | _ | d k r� | | _ | | _ t | � | _
d | j
| _ | j d k | _ d | _
d S)NFrr zfcannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permittedr z Expected )r r r� r} �notCharsr� rP rQ r2 r� r� r� r� r� )r� r} rW rX rY )rk rw rx r� � s zCharsNotIn.__init__Tc C s� | | | j k r+ t | | | j | � � | } | d 7} | j } t | | j t | � � } x* | | k r� | | | k r� | d 7} qc W| | | j k r� t | | | j | � � | | | | � f S)Nrr )r} r r� rW rQ r� rP )r� rN r� r� rC �notchars�maxlenrw rw rx r� � s
zCharsNotIn.parseImplc s� y t t | � j � SWn t k
r+ Yn X| j d k r} t | j � d k rm d | j d d � | _ n d | j | _ | j S)Nr^ z
!W:(%s...)z!W:(%s))r r r� rn rz r� r} )r� )rk rw rx r� � s
zCharsNotIn.__str__)r� r� r� r� r� r� r� rw rw )rk rx r v s c
sg e Z d Z d Z d d d d d d d d d
d i Z d d
d d � f d d � Z d d d � Z � S)r. a�
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.
r# z<SPC>rw z<TAB>r% z<LF>ry z<CR>rx z<FF>z
rr r c s� t t � � j � | � _ � j d j � f d d � � j D� � � d j d d � � j D� � � _ d � _ d � j � _ | � _
| d k r� | � _ n t � _ | d k r� | � _ | � _
d S)Nr� c 3 s$ | ] } | � j k r | Vq d S)N)�
matchWhite)r� r� )r� rw rx r� � s z!White.__init__.<locals>.<genexpr>c s s | ] } t j | Vq d S)N)r. � whiteStrs)r� r� rw rw rx r� � s Tz Expected r )
r r. r� r� r r� r~ r� r� r� rP rQ r2 )r� �wsrW rX rY )rk )r� rx r� � s ," zWhite.__init__Tc C s� | | | j k r+ t | | | j | � � | } | d 7} | | j } t | t | � � } x- | | k r� | | | j k r� | d 7} q` W| | | j k r� t | | | j | � � | | | | � f S)Nrr )r� r r� rQ rW r� rP )r� rN r� r� rC rD rw rw rx r� � s
"zWhite.parseImpl)r� r� r� r� r� r� r� rw rw )rk rx r. � s c s" e Z d Z � f d d � Z � S)�_PositionTokenc s8 t t | � j � | j j | _ d | _ d | _ d S)NTF)r r� r� rk r� r� r� r� )r� )rk rw rx r� � s z_PositionToken.__init__)r� r� r� r� rw rw )rk rx r� � s r� c sC e Z d Z d Z � f d d � Z d d � Z d d d � Z � S) r zb
Token to advance to a specific column of input text; useful for tabular report scraping.
c s t t | � j � | | _ d S)N)r r r� r9 )r� �colno)rk rw rx r� � s zGoToColumn.__init__c C s� t | | � | j k r� t | � } | j r? | j | | � } xB | | k r� | | j � r� t | | � | j k r� | d 7} qB W| S)Nrr )r9 r� r� r� �isspace)r� rN r� r� rw rw rx r� � s 7zGoToColumn.preParseTc C s^ t | | � } | | j k r3 t | | d | � � | | j | } | | | � } | | f S)NzText not in expected column)r9 r )r� rN r� r� �thiscol�newlocr� rw rw rx r� s zGoToColumn.parseImpl)r� r� r� r� r� r� r� rw rw )rk rx r � s c s7 e Z d Z d Z � f d d � Z d d d � Z � S)r a�
Matches if current position is at the beginning of a line within the parse string
Example::
test = ''' AAA this line
AAA and this line
AAA but not this one
B AAA and definitely not this one
'''
for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
print(t)
Prints::
['AAA', ' this line']
['AAA', ' and this line']
c s t t | � j � d | _ d S)NzExpected start of line)r r r� r� )r� )rk rw rx r� & s zLineStart.__init__Tc C s; t | | � d k r | g f St | | | j | � � d S)Nrr )r9 r r� )r� rN r� r� rw rw rx r� * s
zLineStart.parseImpl)r� r� r� r� r� r� rw rw )rk rx r s c s7 e Z d Z d Z � f d d � Z d d d � Z � S)r zU
Matches if current position is at the end of a line within the parse string
c s< t t | � j � | j t j j d d � � d | _ d S)Nr% r� zExpected end of line)r r r� r r$ rs r� r� )r� )rk rw rx r� 3 s zLineEnd.__init__Tc C s� | t | � k rK | | d k r0 | d d f St | | | j | � � n8 | t | � k rk | d g f St | | | j | � � d S)Nr% rr )r� r r� )r� rN r� r� rw rw rx r� 8 s zLineEnd.parseImpl)r� r� r� r� r� r� rw rw )rk rx r / s c s7 e Z d Z d Z � f d d � Z d d d � Z � S)r* zM
Matches if current position is at the beginning of the parse string
c s t t | � j � d | _ d S)NzExpected start of text)r r* r� r� )r� )rk rw rx r� G s zStringStart.__init__Tc C sF | d k r< | | j | d � k r< t | | | j | � � | g f S)Nr )r� r r� )r� rN r� r� rw rw rx r� K s zStringStart.parseImpl)r� r� r� r� r� r� rw rw )rk rx r* C s c s7 e Z d Z d Z � f d d � Z d d d � Z � S)r) zG
Matches if current position is at the end of the parse string
c s t t | � j � d | _ d S)NzExpected end of text)r r) r� r� )r� )rk rw rx r� V s zStringEnd.__init__Tc C s� | t | � k r- t | | | j | � � nT | t | � k rM | d g f S| t | � k ri | g f St | | | j | � � d S)Nrr )r� r r� )r� rN r� r� rw rw rx r� Z s
zStringEnd.parseImpl)r� r� r� r� r� r� rw rw )rk rx r) R s c s: e Z d Z d Z e � f d d � Z d d d � Z � S)r1 ap
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{} 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.
c s/ t t | � j � t | � | _ d | _ d S)NzNot at the start of a word)r r1 r� r� � wordCharsr� )r� r� )rk rw rx r� l s zWordStart.__init__Tc C sX | d k rN | | d | j k s6 | | | j k rN t | | | j | � � | g f S)Nr rr )r� r r� )r� rN r� r� rw rw rx r� q s
zWordStart.parseImpl)r� r� r� r� rV r� r� rw rw )rk rx r1 d s c s: e Z d Z d Z e � f d d � Z d d d � Z � S)r0 aZ
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{} 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.
c s8 t t | � j � t | � | _ d | _ d | _ d S)NFzNot at the end of a word)r r0 r� r� r� r} r� )r� r� )rk rw rx r� � s zWordEnd.__init__Tc C sp t | � } | d k rf | | k rf | | | j k sN | | d | j k rf t | | | j | � � | g f S)Nr rr )r� r� r r� )r� rN r� r� r� rw rw rx r� � s zWordEnd.parseImpl)r� r� r� r� rV r� r� rw rw )rk rx r0 x s c s� e Z d Z d Z d � f d d � Z d d � Z d d � Z d d
� Z � f d d � Z � f d
d � Z � f d d � Z
d � f d d � Z g d d � Z � f d d � Z
� S)r z^
Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
Fc s� t t | � j | � t | t � r1 t | � } t | t � rX t j | � g | _ n� t | t
j � r� t | � } t d d � | D� � r� t
t j | � } t | � | _ n4 y t | � | _ Wn t k
r� | g | _ Yn Xd | _ d S)Nc s s | ] } t | t � Vq d S)N)rz r� )r� rO rw rw rx r� � s z+ParseExpression.__init__.<locals>.<genexpr>F)r r r� rz r� r� r� r$ rv �exprsr� �Iterable�allr� r� r� )r� r� r� )rk rw rx r� � s
zParseExpression.__init__c C s | j | S)N)r� )r� r� rw rw rx r� � s zParseExpression.__getitem__c C s | j j | � d | _ | S)N)r� r rz )r� r rw rw rx r � s zParseExpression.appendc C sD d | _ d d � | j D� | _ x | j D] } | j � q, W| S)z~Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
all contained expressions.Fc S s g | ] } | j � � q Srw )r� )r� r� rw rw rx r� � s z3ParseExpression.leaveWhitespace.<locals>.<listcomp>)r} r� r )r� r� rw rw rx r � s
z ParseExpression.leaveWhitespacec s� t | t � r_ | | j k r� t t | � j | � xf | j D] } | j | j d � q> Wn> t t | � j | � x% | j D] } | j | j d � q W| S)Nrr rs rs )rz r+ r� r r r r� )r� r r� )rk rw rx r � s zParseExpression.ignorec sd y t t | � j � SWn t k
r+ Yn X| j d k r] d | j j t | j � f | _ | j S)Nz%s:(%s)) r r r� rn rz rk r� r� r� )r� )rk rw rx r� � s
"zParseExpression.__str__c s� t t | � j � x | j D] } | j � q Wt | j � d k ro| j d } t | | j � r� | j r� | j d k r� | j r� | j d d � | j d g | _ d | _
| j | j O_ | j | j O_ | j d } t | | j � ro| j ro| j d k ro| j ro| j d d � | j d d � | _ d | _
| j | j O_ | j | j O_ d t
| � | _ | S)Nrq r rr z Expected rs rs )r r r� r� r� rz rk rx r{ r� rz r� r� r� r� )r� r� r )rk rw rx r� � s0
$
' zParseExpression.streamlinec s t t | � j | | � } | S)N)r r r� )r� r� r� r� )rk rw rx r� � s z ParseExpression.setResultsNamec C sI | d d � | g } x | j D] } | j | � q! W| j g � d S)N)r� r r )r� r �tmpr� rw rw rx r � s zParseExpression.validatec s2 t t | � j � } d d � | j D� | _ | S)Nc S s g | ] } | j � � q Srw )r� )r� r� rw rw rx r� � s z(ParseExpression.copy.<locals>.<listcomp>)r r r� r� )r� r� )rk rw rx r� � s zParseExpression.copy)r� r� r� r� r� r� r r r r� r� r� r r� rw rw )rk rx r � s
"c st e Z d Z d Z Gd d � d e � Z d � f d d � Z d d d � Z d d
� Z d d � Z d
d � Z
� S)r a
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.
May also be constructed using the C{'-'} operator, which will suppress backtracking.
Example::
integer = Word(nums)
name_expr = OneOrMore(Word(alphas))
expr = And([integer("id"),name_expr("name"),integer("age")])
# more easily written as:
expr = integer("id") + name_expr("name") + integer("age")
c s" e Z d Z � f d d � Z � S)zAnd._ErrorStopc s3 t t j | � j | | � d | _ | j � d S)N�-)r r r� r� r� r )r� r� r )rk rw rx r�
s zAnd._ErrorStop.__init__)r� r� r� r� rw rw )rk rx r�
s r� Tc so t t | � j | | � t d d � | j D� � | _ | j | j d j � | j d j | _ d | _ d S)Nc s s | ] } | j Vq d S)N)r� )r� r� rw rw rx r�
s z And.__init__.<locals>.<genexpr>r T)
r r r� r� r� r� r r~ r} r� )r� r� r� )rk rw rx r�
s
z And.__init__c C sS | j d j | | | d d �\ } } d } x| j d d � D]} t | t j � rc d } qB | ry | j | | | � \ } } Wq)t k
r� � Yq)t k
r� } z d | _ t j | � � WYd d } ~ Xq)t k
r
t | t
| � | j | � � Yq)Xn | j | | | � \ } } | s;| j � rB | | 7} qB W| | f S)Nr r� Frr T)
r� r� rz r r� r# r �
__traceback__r� r� r� r� r ) r� rN r� r� �
resultlist� errorStopr� �
exprtokensr� rw rw rx r�
s( (
!
&z
And.parseImplc C s+ t | t � r t j | � } | j | � S)N)rz r� r$ rv r )r� r rw rw rx r 5
s z And.__iadd__c C sF | d d � | g } x( | j D] } | j | � | j s! Pq! Wd S)N)r� r r� )r� r� �subRecCheckListr� rw rw rx r :
s
zAnd.checkRecursionc C sV t | d � r | j S| j d k rO d d j d d � | j D� � d | _ | j S)Nr� �{r# c s s | ] } t | � Vq d S)N)r� )r� r� rw rw rx r� F
s z And.__str__.<locals>.<genexpr>�})r� r� rz r� r� )r� rw rw rx r� A
s
*z And.__str__) r� r� r� r� r
r� r� r� r r r� rw rw )rk rx r � s c s^ e Z d Z d Z d � f d d � Z d d d � Z d d � Z d
d � Z d d
� Z � S)r a�
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.
Example::
# construct Or using '^' operator
number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789"))
prints::
[['123'], ['3.1416'], ['789']]
Fc sQ t t | � j | | � | j rD t d d � | j D� � | _ n d | _ d S)Nc s s | ] } | j Vq d S)N)r� )r� r� rw rw rx r� \
s z Or.__init__.<locals>.<genexpr>T)r r r� r� r< r� )r� r� r� )rk rw rx r� Y
s "z Or.__init__Tc C s� d } d } g } x� | j D]� } y | j | | � } Wn� t k
r� } z, d | _ | j | k rt | } | j } WYd d } ~ Xq t k
r� t | � | k r� t | t | � | j | � } t | � } Yq X| j | | f � q W| r�| j d d d � � xz | D]r \ }
} y | j
| | | � SWqt k
r} z, d | _ | j | k rm| } | j } WYd d } ~ XqXqW| d k r�| j | _ | � n t | | d | � � d S)Nrr r c S s | d S)Nr rw )�xrw rw rx ry u
s z Or.parseImpl.<locals>.<lambda>z no defined alternatives to matchrs ) r� r� r r� r� r� r� r� r �sortr� r� ) r� rN r� r� � maxExcLoc� maxExceptionr� r� �loc2r� �_rw rw rx r� `
s<
z Or.parseImplc C s+ t | t � r t j | � } | j | � S)N)rz r� r$ rv r )r� r rw rw rx �__ixor__�
s z Or.__ixor__c C sV t | d � r | j S| j d k rO d d j d d � | j D� � d | _ | j S)Nr� r� z ^ c s s | ] } t | � Vq d S)N)r� )r� r� rw rw rx r� �
s z Or.__str__.<locals>.<genexpr>r� )r� r� rz r� r� )r� rw rw rx r� �
s
*z
Or.__str__c C s< | d d � | g } x | j D] } | j | � q! Wd S)N)r� r )r� r� r� r� rw rw rx r �
s zOr.checkRecursion) r� r� r� r� r� r� r� r� r rw rw )rk rx r K
s
& c s^ e Z d Z d Z d � f d d � Z d d d � Z d d � Z d
d � Z d d
� Z � S)r a�
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.
Example::
# construct MatchFirst using '|' operator
# watch the order of expressions to match
number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789")) # Fail! -> [['123'], ['3'], ['1416'], ['789']]
# put more selective expression first
number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
print(number.searchString("123 3.1416 789")) # Better -> [['123'], ['3.1416'], ['789']]
Fc sQ t t | � j | | � | j rD t d d � | j D� � | _ n d | _ d S)Nc s s | ] } | j Vq d S)N)r� )r� r� rw rw rx r� �
s z&MatchFirst.__init__.<locals>.<genexpr>T)r r r� r� r< r� )r� r� r� )rk rw rx r� �
s "zMatchFirst.__init__Tc C s
d } d } x� | j D]� } y | j | | | � } | SWq t k
r~ } z# | j | k rl | } | j } WYd d } ~ Xq t k
r� t | � | k r� t | t | � | j | � } t | � } Yq Xq W| d k r� | j | _ | � n t | | d | � � d S)Nrr z no defined alternatives to matchrs )r� r� r r� r� r� r� r� ) r� rN r� r� r� r� r� r� r� rw rw rx r� �
s$
zMatchFirst.parseImplc C s+ t | t � r t j | � } | j | � S)N)rz r� r$ rv r )r� r rw rw rx �__ior__�
s zMatchFirst.__ior__c C sV t | d � r | j S| j d k rO d d j d d � | j D� � d | _ | j S)Nr� r� z | c s s | ] } t | � Vq d S)N)r� )r� r� rw rw rx r� �
s z%MatchFirst.__str__.<locals>.<genexpr>r� )r� r� rz r� r� )r� rw rw rx r� �
s
*zMatchFirst.__str__c C s< | d d � | g } x | j D] } | j | � q! Wd S)N)r� r )r� r� r� r� rw rw rx r �
s zMatchFirst.checkRecursion) r� r� r� r� r� r� r� r� r rw rw )rk rx r �
s c sR e Z d Z d Z d � f d d � Z d d d � Z d d � Z d d
� Z � S) r am
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.
Example::
color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
integer = Word(nums)
shape_attr = "shape:" + shape_type("shape")
posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
color_attr = "color:" + color("color")
size_attr = "size:" + integer("size")
# use Each (using operator '&') to accept attributes in any order
# (shape and posn are required, color and size are optional)
shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
shape_spec.runTests('''
shape: SQUARE color: BLACK posn: 100, 120
shape: CIRCLE size: 50 color: BLUE posn: 50,80
color:GREEN size:20 shape:TRIANGLE posn:20,40
'''
)
prints::
shape: SQUARE color: BLACK posn: 100, 120
['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
- color: BLACK
- posn: ['100', ',', '120']
- x: 100
- y: 120
- shape: SQUARE
shape: CIRCLE size: 50 color: BLUE posn: 50,80
['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
- color: BLUE
- posn: ['50', ',', '80']
- x: 50
- y: 80
- shape: CIRCLE
- size: 50
color: GREEN size: 20 shape: TRIANGLE posn: 20,40
['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
- color: GREEN
- posn: ['20', ',', '40']
- x: 20
- y: 40
- shape: TRIANGLE
- size: 20
Tc sN t t | � j | | � t d d � | j D� � | _ d | _ d | _ d S)Nc s s | ] } | j Vq d S)N)r� )r� r� rw rw rx r� s z Each.__init__.<locals>.<genexpr>T)r r r� r� r� r� r} �initExprGroups)r� r� r� )rk rw rx r� s z
Each.__init__c
s� | j r� t d d � | j D� � | _ d d � | j D� } d d � | j D� } | | | _ d d � | j D� | _ d d � | j D� | _ d d � | j D� | _ | j | j 7_ d | _ | } | j d d � } | j d d � � g } d
} x� | r�| � | j | j }
g } x� |
D]� } y | j | | � } Wn t k
rj| j
| � Yq-X| j
| j j t | � | � � | | k r�| j
| � q-| � k r-� j
| � q-Wt | � t |
� k rd } qW| r d j d d � | D� � }
t | | d
|
� � | � f d d � | j D� 7} g } x6 | D]. } | j | | | � \ } } | j
| � qMWt | t g � � } | | f S)Nc s s3 | ]) } t | t � r t | j � | f Vq d S)N)rz r r rO )r� r� rw rw rx r� s z!Each.parseImpl.<locals>.<genexpr>c S s( g | ] } t | t � r | j � q Srw )rz r rO )r� r� rw rw rx r� s z"Each.parseImpl.<locals>.<listcomp>c S s/ g | ]% } | j r t | t � r | � q Srw )r� rz r )r� r� rw rw rx r� s c S s( g | ] } t | t � r | j � q Srw )rz r2 rO )r� r� rw rw rx r� s c S s( g | ] } t | t � r | j � q Srw )rz r rO )r� r� rw rw rx r� ! s c S s. g | ]$ } t | t t t f � s | � q Srw )rz r r2 r )r� r� rw rw rx r� " s FTz, c s s | ] } t | � Vq d S)N)r� )r� r� rw rw rx r� = s z*Missing one or more required elements (%s)c s4 g | ]* } t | t � r | j � k r | � q Srw )rz r rO )r� r� )�tmpOptrw rx r� A s )r� r� r� �opt1map� optionals�multioptionals�
multirequired�requiredr� r r r� r �remover� r� r� �sumr" )r� rN r� r� �opt1�opt2�tmpLoc�tmpReqd�
matchOrder� keepMatching�tmpExprs�failedr� �missingr� rI � finalResultsrw )r� rx r� sP
"
zEach.parseImplc C sV t | d � r | j S| j d k rO d d j d d � | j D� � d | _ | j S)Nr� r� z & c s s | ] } t | � Vq d S)N)r� )r� r� rw rw rx r� P s z Each.__str__.<locals>.<genexpr>r� )r� r� rz r� r� )r� rw rw rx r� K s
*z Each.__str__c C s< | d d � | g } x | j D] } | j | � q! Wd S)N)r� r )r� r� r� r� rw rw rx r T s zEach.checkRecursion)r� r� r� r� r� r� r� r rw rw )rk rx r �
s
51 c s� e Z d Z d Z d � f d d � Z d d d � Z d d � Z � f d
d � Z � f d d
� Z d d � Z g d d � Z
� f d d � Z � S)r za
Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
Fc s� t t | � j | � t | t � r^ t t j t � rI t j | � } n t j t | � � } | | _
d | _ | d k r� | j | _ | j
| _
| j | j � | j | _ | j | _ | j | _ | j j | j � d S)N)r r r� rz r� �
issubclassr$ rv r, r rO rz r� r� r r~ r} r| r� r� r
)r� rO r� )rk rw rx r� ^ s z ParseElementEnhance.__init__Tc C sG | j d k r+ | j j | | | d d �St d | | j | � � d S)Nr� Fr� )rO r� r r� )r� rN r� r� rw rw rx r� p s z ParseElementEnhance.parseImplc C s; d | _ | j j � | _ | j d k r7 | j j � | S)NF)r} rO r� r )r� rw rw rx r v s
z#ParseElementEnhance.leaveWhitespacec s� t | t � r] | | j k r� t t | � j | � | j d k r� | j j | j d � n< t t | � j | � | j d k r� | j j | j d � | S)Nrr rs rs )rz r+ r� r r r rO )r� r )rk rw rx r } s zParseElementEnhance.ignorec s3 t t | � j � | j d k r/ | j j � | S)N)r r r� rO )r� )rk rw rx r� � s
z ParseElementEnhance.streamlinec C sY | | k r t | | g � � | d d � | g } | j d k rU | j j | � d S)N)r& rO r )r� r� r� rw rw rx r � s
z"ParseElementEnhance.checkRecursionc C sG | d d � | g } | j d k r6 | j j | � | j g � d S)N)rO r r )r� r r� rw rw rx r � s z ParseElementEnhance.validatec ss y t t | � j � SWn t k
r+ Yn X| j d k rl | j d k rl d | j j t | j � f | _ | j S)Nz%s:(%s)) r r r� rn rz rO rk r� r� )r� )rk rw rx r� � s
"zParseElementEnhance.__str__) r� r� r� r� r� r� r r r� r r r� rw rw )rk rx r Z s c s7 e Z d Z d Z � f d d � Z d d d � Z � S)r a�
Lookahead matching of the given parse expression. C{FollowedBy}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression matches at the current
position. C{FollowedBy} always returns a null token list.
Example::
# use FollowedBy to match a label only if it is followed by a ':'
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
prints::
[['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
c s# t t | � j | � d | _ d S)NT)r r r� r� )r� rO )rk rw rx r� � s zFollowedBy.__init__Tc C s | j j | | � | g f S)N)rO r� )r� rN r� r� rw rw rx r� � s zFollowedBy.parseImpl)r� r� r� r� r� r� rw rw )rk rx r � s c sC e Z d Z d Z � f d d � Z d d d � Z d d � Z � S) r a�
Lookahead to disallow matching with the given parse expression. C{NotAny}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression does I{not} match at the current
position. Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
always returns a null token list. May be constructed using the '~' operator.
Example::
c sB t t | � j | � d | _ d | _ d t | j � | _ d S)NFTzFound unwanted token, )r r r� r} r� r� rO r� )r� rO )rk rw rx r� � s zNotAny.__init__Tc C s7 | j j | | � r- t | | | j | � � | g f S)N)rO r� r r� )r� rN r� r� rw rw rx r� � s zNotAny.parseImplc C sF t | d � r | j S| j d k r? d t | j � d | _ | j S)Nr� z~{r� )r� r� rz r� rO )r� rw rw rx r� � s
zNotAny.__str__)r� r� r� r� r� r� r� rw rw )rk rx r � s
c s4 e Z d Z d � f d d � Z d d d � Z � S)�_MultipleMatchNc sc t t | � j | � d | _ | } t | t � rC t j | � } | d k rV | n d | _ d S)NT) r r� r� r| rz r� r$ rv � not_ender)r� rO �stopOn�ender)rk rw rx r� � s z_MultipleMatch.__init__Tc C s | j j } | j } | j d k } | r6 | j j } | rI | | | � | | | | d d �\ } } y{ | j } xi | r� | | | � | r� | | | � }
n | }
| | |
| � \ } } | s� | j � rx | | 7} qx WWn t t f k
r� Yn X| | f S)Nr� F) rO r� r� r� r� r� r r r� ) r� rN r� r� �self_expr_parse�self_skip_ignorables� check_ender�
try_not_enderr� �hasIgnoreExprsr� � tmptokensrw rw rx r� � s,
z_MultipleMatch.parseImpl)r� r� r� r� r� rw rw )rk rx r� � s r� c @ s" e Z d Z d Z d d � Z d S)r a�
Repetition of one or more of the given expression.
Parameters:
- expr - expression that must match one or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: BLACK"
OneOrMore(attr_expr).parseString(text).pprint() # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
# use stopOn attribute for OneOrMore to avoid reading label string as part of the data
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
# could also be written as
(attr_expr * (1,)).parseString(text).pprint()
c C sF t | d � r | j S| j d k r? d t | j � d | _ | j S)Nr� r� z}...)r� r� rz r� rO )r� rw rw rx r� ! s
zOneOrMore.__str__N)r� r� r� r� r� rw rw rw rx r s c sL e Z d Z d Z d � f d d � Z d � f d d � Z d d � Z � S)
r2 aw
Optional repetition of zero or more of the given expression.
Parameters:
- expr - expression that must match zero or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example: similar to L{OneOrMore}
Nc s) t t | � j | d | �d | _ d S)Nr� T)r r2 r� r� )r� rO r� )rk rw rx r� 6 s zZeroOrMore.__init__Tc sI y t t | � j | | | � SWn" t t f k
rD | g f SYn Xd S)N)r r2 r� r r� )r� rN r� r� )rk rw rx r� : s zZeroOrMore.parseImplc C sF t | d � r | j S| j d k r? d t | j � d | _ | j S)Nr� r z]...)r� r� rz r� rO )r� rw rw rx r� @ s
zZeroOrMore.__str__)r� r� r� r� r� r� r� rw rw )rk rx r2 * s c @ s. e Z d Z d d � Z e Z d d � Z d S)�
_NullTokenc C s d S)NFrw )r� rw rw rx r� J s z_NullToken.__bool__c C s d S)Nr� rw )r� rw rw rx r� M s z_NullToken.__str__N)r� r� r� r� rF r� rw rw rw rx r� I s r� c sF e Z d Z d Z e � f d d � Z d d d � Z d d � Z � S) r aa
Optional matching of the given expression.
Parameters:
- expr - expression that must match zero or more times
- default (optional) - value to be returned if the optional expression is not found.
Example::
# US postal code can be a 5-digit zip, plus optional 4-digit qualifier
zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
zip.runTests('''
# traditional ZIP code
12345
# ZIP+4 form
12101-0001
# invalid ZIP
98765-
''')
prints::
# traditional ZIP code
12345
['12345']
# ZIP+4 form
12101-0001
['12101-0001']
# invalid ZIP
98765-
^
FAIL: Expected end of text (at char 5), (line:1, col:6)
c sA t t | � j | d d �| j j | _ | | _ d | _ d S)Nr� FT)r r r� rO r| r r� )r� rO r )rk rw rx r� t s zOptional.__init__Tc C s� y( | j j | | | d d �\ } } Wnp t t f k
r� | j t k r� | j j r� t | j g � } | j | | j j <q� | j g } n g } Yn X| | f S)Nr� F)rO r� r r� r �_optionalNotMatchedr{ r" )r� rN r� r� r� rw rw rx r� z s ( zOptional.parseImplc C sF t | d � r | j S| j d k r? d t | j � d | _ | j S)Nr� r r )r� r� rz r� rO )r� rw rw rx r� � s
zOptional.__str__)r� r� r� r� r� r� r� r� rw rw )rk rx r Q s "c s@ e Z d Z d Z d d d � f d d � Z d d d � Z � S) r( a�
Token for skipping over all undefined text until the matched expression is found.
Parameters:
- expr - target expression marking the end of the data to be skipped
- include - (default=C{False}) if True, the target expression is also parsed
(the skipped text and target expression are returned as a 2-element list).
- ignore - (default=C{None}) used to define grammars (typically quoted strings and
comments) that might contain false matches to the target expression
- failOn - (default=C{None}) define expressions that are not allowed to be
included in the skipped test; if found before the target expression is found,
the SkipTo is not a match
Example::
report = '''
Outstanding Issues Report - 1 Jan 2000
# | Severity | Description | Days Open
-----+----------+-------------------------------------------+-----------
101 | Critical | Intermittent system crash | 6
94 | Cosmetic | Spelling error on Login ('log|n') | 14
79 | Minor | System slow when running too many reports | 47
'''
integer = Word(nums)
SEP = Suppress('|')
# use SkipTo to simply match everything up until the next SEP
# - ignore quoted strings, so that a '|' character inside a quoted string does not match
# - parse action will call token.strip() for each matched token, i.e., the description body
string_data = SkipTo(SEP, ignore=quotedString)
string_data.setParseAction(tokenMap(str.strip))
ticket_expr = (integer("issue_num") + SEP
+ string_data("sev") + SEP
+ string_data("desc") + SEP
+ integer("days_open"))
for tkt in ticket_expr.searchString(report):
print tkt.dump()
prints::
['101', 'Critical', 'Intermittent system crash', '6']
- days_open: 6
- desc: Intermittent system crash
- issue_num: 101
- sev: Critical
['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
- days_open: 14
- desc: Spelling error on Login ('log|n')
- issue_num: 94
- sev: Cosmetic
['79', 'Minor', 'System slow when running too many reports', '47']
- days_open: 47
- desc: System slow when running too many reports
- issue_num: 79
- sev: Minor
FNc s� t t | � j | � | | _ d | _ d | _ | | _ d | _ t | t � rg t
j | � | _ n | | _ d t
| j � | _ d S)NTFzNo match found for )r r( r� �
ignoreExprr� r� � includeMatchr� rz r� r$ rv �failOnr� rO r� )r� r �includer r� )rk rw rx r� � s zSkipTo.__init__Tc
C s� | } t | � } | j } | j j } | j d k rB | j j n d } | j d k rc | j j n d } | }
x� |
| k r | d k r� | | |
� r� P| d k r� x- y | | |
� }
Wq� t k
r� PYq� Xq� Wy | | |
d d d d �Wn" t t f k
r|
d 7}
Yqr XPqr Wt | | | j
| � � |
} | | | � } t | � } | j r�| | | | d d �\ } }
| |
7} | | f S)Nr� Fr� rr )
r� rO r� r� r� r� r� r r r� r� r" r� )r� rN r� r� rQ r� rO �
expr_parse�self_failOn_canParseNext�self_ignoreExpr_tryParse�tmploc�skiptext�
skipresultrH rw rw rx r� � s< !!
zSkipTo.parseImpl)r� r� r� r� r� r� rw rw )rk rx r( � s 6
c s� e Z d Z d Z d � f d d � Z d d � Z d d � Z d d
� Z d d � Z g d
d � Z d d � Z
� f d d � Z � S)r aK
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.
See L{ParseResults.pprint} for an example of a recursive parser created using
C{Forward}.
Nc s t t | � j | d d �d S)Nr� F)r r r� )r� r )rk rw rx r� s zForward.__init__c C s� t | t � r t j | � } | | _ d | _ | j j | _ | j j | _ | j | j j � | j j
| _
| j j | _ | j j
| j j � | S)N)rz r� r$ rv rO rz r� r� r r~ r} r| r� r
)r� r rw rw rx �
__lshift__ s zForward.__lshift__c C s | | >S)Nrw )r� r rw rw rx � __ilshift__' s zForward.__ilshift__c C s
d | _ | S)NF)r} )r� rw rw rx r * s zForward.leaveWhitespacec C s2 | j s. d | _ | j d k r. | j j � | S)NT)r� rO r� )r� rw rw rx r� . s
zForward.streamlinec C sS | | k rB | d d � | g } | j d k rB | j j | � | j g � d S)N)rO r r )r� r r� rw rw rx r 5 s
zForward.validatec C s� t | d � r | j S| j j d S| j | _ t | _ z+ | j d k r] t | j � } n d } Wd | j | _ X| j j d | S)Nr� z: ...�Nonez: )r� r� rk r� � _revertClass�_ForwardNoRecurserO r� )r� � retStringrw rw rx r� < s
zForward.__str__c s= | j d k r" t t | � j � St � } | | K} | Sd S)N)rO r r r� )r� r� )rk rw rx r� M s
z Forward.copy) r� r� r� r� r� r� r� r r� r r� r� rw rw )rk rx r s
c @ s e Z d Z d d � Z d S)r� c C s d S)Nz...rw )r� rw rw rx r� V s z_ForwardNoRecurse.__str__N)r� r� r� r� rw rw rw rx r� U s r� c s+ e Z d Z d Z d � f d d � Z � S)r- zQ
Abstract subclass of C{ParseExpression}, for converting parsed results.
Fc s# t t | � j | � d | _ d S)NF)r r- r� r| )r� rO r� )rk rw rx r� ] s zTokenConverter.__init__)r� r� r� r� r� rw rw )rk rx r- Y s c sL e Z d Z d Z d d � f d d � Z � f d d � Z d d � Z � S)
r
a�
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.
Example::
real = Word(nums) + '.' + Word(nums)
print(real.parseString('3.1416')) # -> ['3', '.', '1416']
# will also erroneously match the following
print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
real = Combine(Word(nums) + '.' + Word(nums))
print(real.parseString('3.1416')) # -> ['3.1416']
# no match when there are internal spaces
print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
r� Tc sN t t | � j | � | r& | j � | | _ d | _ | | _ d | _ d S)NT)r r
r� r �adjacentr} �
joinStringr� )r� rO r� r� )rk rw rx r� r s
zCombine.__init__c s6 | j r t j | | � n t t | � j | � | S)N)r� r$ r r r
)r� r )rk rw rx r | s zCombine.ignorec C sn | j � } | d d � =| t d j | j | j � � g d | j �7} | j rf | j � rf | g S| Sd S)Nr� r� )r� r" r� r r� r� r{ r )r� rN r� r� �retToksrw rw rx r� � s
1zCombine.postParse)r� r� r� r� r� r r� rw rw )rk rx r
a s
c s4 e Z d Z d Z � f d d � Z d d � Z � S)r a�
Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.
Example::
ident = Word(alphas)
num = Word(nums)
term = ident | num
func = ident + Optional(delimitedList(term))
print(func.parseString("fn a,b,100")) # -> ['fn', 'a', 'b', '100']
func = ident + Group(Optional(delimitedList(term)))
print(func.parseString("fn a,b,100")) # -> ['fn', ['a', 'b', '100']]
c s# t t | � j | � d | _ d S)NT)r r r� r| )r� rO )rk rw rx r� � s zGroup.__init__c C s | g S)Nrw )r� rN r� r� rw rw rx r� � s zGroup.postParse)r� r� r� r� r� r� rw rw )rk rx r � s
c s4 e Z d Z d Z � f d d � Z d d � Z � S)r aW
Converter to return a repetitive expression as a list, but also as a dictionary.
Each element can also be referenced using the first token in the expression as its key.
Useful for tabular report scraping when the first column can be used as a item key.
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
# print attributes as plain groups
print(OneOrMore(attr_expr).parseString(text).dump())
# instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
print(result.dump())
# access named fields as dict entries, or output as dict
print(result['shape'])
print(result.asDict())
prints::
['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
{'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
See more examples at L{ParseResults} of accessing fields by results name.
c s# t t | � j | � d | _ d S)NT)r r r� r| )r� rO )rk rw rx r� � s z
Dict.__init__c C sN x3t | � D]%\ } } t | � d k r. q
| d } t | t � r] t | d � j � } t | � d k r� t d | � | | <q
t | � d k r� t | d t � r� t | d | � | | <q
| j � } | d =t | � d k st | t � r| j � rt | | � | | <q
t | d | � | | <q
W| j
rF| g S| Sd S)Nr rr r� rq ) r� r� rz ru r� r� r� r" r� r r{ )r� rN r� r� r� �tok�ikey� dictvaluerw rw rx r� � s$
& - zDict.postParse)r� r� r� r� r� r� rw rw )rk rx r � s #c @ s. e Z d Z d Z d d � Z d d � Z d S)r+ aV
Converter for ignoring the results of a parsed expression.
Example::
source = "a, b, c,d"
wd = Word(alphas)
wd_list1 = wd + ZeroOrMore(',' + wd)
print(wd_list1.parseString(source))
# often, delimiters that are useful during parsing are just in the
# way afterward - use Suppress to keep them out of the parsed output
wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
print(wd_list2.parseString(source))
prints::
['a', ',', 'b', ',', 'c', ',', 'd']
['a', 'b', 'c', 'd']
(See also L{delimitedList}.)
c C s g S)Nrw )r� rN r� r� rw rw rx r� � s zSuppress.postParsec C s | S)Nrw )r� rw rw rx r � s zSuppress.suppressN)r� r� r� r� r� r rw rw rw rx r+ � s c @ s: e Z d Z d Z d d � Z d d � Z d d � Z d S) r zI
Wrapper for parse actions, to ensure they are only called once.
c C s t | � | _ d | _ d S)NF)rr �callable�called)r� �
methodCallrw rw rx r� s zOnlyOnce.__init__c C sA | j s+ | j | | | � } d | _ | St | | d � � d S)NTr� )r� r� r )r� r� rW rv rI rw rw rx r s
zOnlyOnce.__call__c C s
d | _ d S)NF)r� )r� rw rw rx �reset
s zOnlyOnce.resetN)r� r� r� r� r� r r� rw rw rw rx r � s c sG t � � � � f d d � } y � j | _ Wn t k
rB Yn X| S)as
Decorator for debugging parse actions.
When the parse action is called, this decorator will print C{">> entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})".}
When the parse action completes, the decorator will print C{"<<"} followed by the returned value, or any exception that the parse action raised.
Example::
wd = Word(alphas)
@traceParseAction
def remove_duplicate_chars(tokens):
return ''.join(sorted(set(''.join(tokens)))
wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
prints::
>>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
<<leaving remove_duplicate_chars (ret: 'dfjkls')
['dfjkls']
c s� � j } | d d � \ } } } t | � d k rL | d j j d | } t j j d | t | | � | | f � y � | � } WnB t k
r� } z" t j j d | | f � � WYd d } ~ Xn Xt j j d | | f � | S)Nro r �.z">>entering %s(line: '%s', %d, %r)
z <<leaving %s (exception: %s)
z<<leaving %s (ret: %r)
r[ )r� r� rk r �stderr�writerG rn )�paArgs�thisFuncr� rW rv r� rU )r rw rx �z# s )ztraceParseAction.<locals>.z)rr r� r� )r r� rw )r rx rb
s
�,Fc C sx t | � d t | � d t | � d } | rS t | t | | � � j | � S| t t | � | � j | � Sd S)a�
Helper to define a delimited list of expressions - the delimiter defaults to ','.
By default, the list elements and delimiters can have intervening whitespace, and
comments, but this can be overridden by passing C{combine=True} in the constructor.
If C{combine} is set to C{True}, the matching tokens are returned as a single token
string, with the delimiters included; otherwise, the matching tokens are returned
as a list of tokens, with the delimiters suppressed.
Example::
delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
z [r# z]...N)r� r
r2 r� r+ )rO �delim�combine�dlNamerw rw rx r@ 9 s
,!c s� t � � � � f d d � } | d k rH t t � j d d � � } n | j � } | j d � | j | d d �| � j d t � � d
� S) a:
Helper to define a counted list of expressions.
This helper defines a pattern of the form::
integer expr expr expr...
where the leading integer tells how many expr expressions follow.
The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.
Example::
countedArray(Word(alphas)).parseString('2 ab cd ef') # -> ['ab', 'cd']
# in this parser, the leading integer value is given in binary,
# '10' indicating that 2 values are in the array
binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef') # -> ['ab', 'cd']
c s; | d } � | r, t t � g | � � p5 t t � >g S)Nr )r r rC )r� rW rv r� )� arrayExprrO rw rx �countFieldParseAction_ s
-z+countedArray.<locals>.countFieldParseActionNc S s t | d � S)Nr )ru )rv rw rw rx ry d s z countedArray.<locals>.<lambda>�arrayLenr� Tz(len) z...)r r/ rR r� r� r� r� r� )rO �intExprr� rw )r� rO rx r< L s
c C sM g } x@ | D]8 } t | t � r8 | j t | � � q
| j | � q
W| S)N)rz r� r
r� r )�Lr� r� rw rw rx r� k s
r� c sI t � � � f d d � } | j | d d �� j d t | � � � S)a*
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousLiteral(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches a
previous literal, will also match the leading C{"1:1"} in C{"1:10"}.
If this is not desired, use C{matchPreviousExpr}.
Do I{not} use with packrat parsing enabled.
c sf | rW t | � d k r' � | d >qb t | j � � } � t d d � | D� � >n � t � >d S)Nrr r c s s | ] } t | � Vq d S)N)r )r� �ttrw rw rx r� � s zDmatchPreviousLiteral.<locals>.copyTokenToRepeater.<locals>.<genexpr>)r� r� r� r r
)r� rW rv �tflat)�reprw rx �copyTokenToRepeater� s z1matchPreviousLiteral.<locals>.copyTokenToRepeaterr� Tz(prev) )r r� r� r� )rO r� rw )r� rx rO t s
c s_ t � � | j � } � | K� � f d d � } | j | d d �� j d t | � � � S)aS
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousExpr(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches by
expressions, will I{not} match the leading C{"1:1"} in C{"1:10"};
the expressions are evaluated first, and then compared, so
C{"1"} is compared with C{"10"}.
Do I{not} use with packrat parsing enabled.
c s; t | j � � � � f d d � } � j | d d �d S)Nc s4 t | j � � } | � k r0 t d d d � � d S)Nr� r )r� r� r )r� rW rv � theseTokens)� matchTokensrw rx �mustMatchTheseTokens� s zLmatchPreviousExpr.<locals>.copyTokenToRepeater.<locals>.mustMatchTheseTokensr� T)r� r� r� )r� rW rv r� )r� )r� rx r� � s z.matchPreviousExpr.<locals>.copyTokenToRepeaterr� Tz(prev) )r r� r� r� r� )rO �e2r� rw )r� rx rN � s
c C sU x$ d D] } | j | t | � } q W| j d d � } | j d d � } t | � S)Nz\^-]r% z\nrw z\t)r� �_bslashr� )r� r� rw rw rx rS � s
rS Tc
sZ | r' d d � } d d � } t � n d d � } d d � } t � g } t | t � ri | j � } n7 t | t j � r� t | � } n t j d t
d d �| s� t � Sd } x� | t | � d
k re| | } x� t
| | d
d � � D]c \ } } | | | � r | | | d
=Pq� | | | � r� | | | d
=| j | | � | } Pq� W| d
7} q� W| r+| r+y� t | � t d j | � � k r�t d
d j d d � | D� � � j d j | � � St d j d d � | D� � � j d j | � � SWn( t k
r*t j d t
d d �Yn Xt � f d d � | D� � j d j | � � S)a�
Helper to quickly define a set of alternative Literals, and makes sure to do
longest-first testing when there is a conflict, regardless of the input order,
but returns a C{L{MatchFirst}} for best performance.
Parameters:
- strs - a string of space-delimited literals, or a collection of string literals
- caseless - (default=C{False}) - treat all literals as caseless
- useRegex - (default=C{True}) - as an optimization, will generate a Regex
object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
if creating a C{Regex} raises an exception)
Example::
comp_oper = oneOf("< = > <= >= !=")
var = Word(alphas)
number = Word(nums)
term = var | number
comparison_expr = term + comp_oper + term
print(comparison_expr.searchString("B = 12 AA=23 B<=AA AA>12"))
prints::
[['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
c S s | j � | j � k S)N)r: )r �brw rw rx ry � s zoneOf.<locals>.<lambda>c S s | j � j | j � � S)N)r: r7 )r r� rw rw rx ry � s c S s
| | k S)Nrw )r r� rw rw rx ry � s c S s
| j | � S)N)r7 )r r� rw rw rx ry � s z6Invalid argument to oneOf, expected string or iterabler� rq r rr Nr� z[%s]c s s | ] } t | � Vq d S)N)rS )r� �symrw rw rx r� � s zoneOf.<locals>.<genexpr>z | �|c s s | ] } t j | � Vq d S)N)r� rU )r� r� rw rw rx r� � s z7Exception creating Regex for oneOf, building MatchFirstc 3 s | ] } � | � Vq d S)Nrw )r� r� )�parseElementClassrw rx r� � s )r r rz r� r� r� r� r� r� r� r� r r� r� r r� r' r� rn r )
�strsr9 �useRegex�isequal�masks�symbolsr� �curr� r rw )r� rx rS � sL
'
!66
c C s t t t | | � � � S)a�
Helper to easily and clearly define a dictionary by specifying the respective patterns
for the key and value. Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
in the proper order. The key pattern can include delimiting markers or punctuation,
as long as they are suppressed, thereby leaving the significant key text. The value
pattern can include named results, so that the C{Dict} results can include named token
fields.
Example::
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
print(OneOrMore(attr_expr).parseString(text).dump())
attr_label = label
attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
# similar to Dict, but simpler call format
result = dictOf(attr_label, attr_value).parseString(text)
print(result.dump())
print(result['shape'])
print(result.shape) # object attribute access works too
print(result.asDict())
prints::
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
SQUARE
{'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
)r r2 r )r r� rw rw rx rA � s !c C s� t � j d d � � } | j � } d | _ | d � | | d � } | r\ d d � } n d d � } | j | � | j | _ | S) a�
Helper to return the original, untokenized text for a given expression. Useful to
restore the parsed fields of an HTML start tag into the raw tag text itself, or to
revert separate tokens with intervening whitespace back to the original matching
input text. By default, returns astring containing the original parsed text.
If the optional C{asString} argument is passed as C{False}, then the return value is a
C{L{ParseResults}} containing any results names that were originally matched, and a
single token containing the original matched text from the input string. So if
the expression passed to C{L{originalTextFor}} contains expressions with defined
results names, you must set C{asString} to C{False} if you want to preserve those
results name values.
Example::
src = "this is test <b> bold <i>text</i> </b> normal text "
for tag in ("b","i"):
opener,closer = makeHTMLTags(tag)
patt = originalTextFor(opener + SkipTo(closer) + closer)
print(patt.searchString(src)[0])
prints::
['<b> bold <i>text</i> </b>']
['<i>text</i>']
c S s | S)Nrw )r� r� rv rw rw rx ry 8 s z!originalTextFor.<locals>.<lambda>F�_original_start�
_original_endc S s | | j | j � S)N)r� r� )r� rW rv rw rw rx ry = s c S s3 | | j d � | j d � � g | d d � <d S)Nr� r� )r )r� rW rv rw rw rx � extractText? s z$originalTextFor.<locals>.extractText)r
r� r� r� r� )rO �asString� locMarker� endlocMarker� matchExprr� rw rw rx rg s
c C s t | � j d d � � S)zp
Helper to undo pyparsing's default grouping of And expressions, even
if all but one are non-empty.
c S s | d S)Nr rw )rv rw rw rx ry J s zungroup.<locals>.<lambda>)r- r� )rO rw rw rx rh E s c C sH t � j d d � � } t | d � | d � | j � j � d � � S)a�
Helper to decorate a returned token with its starting and ending locations in the input string.
This helper adds the following results names:
- locn_start = location where matched expression begins
- locn_end = location where matched expression ends
- value = the actual parsed results
Be careful if the input text contains C{<TAB>} characters, you may want to call
C{L{ParserElement.parseWithTabs}}
Example::
wd = Word(alphas)
for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
print(match)
prints::
[[0, 'ljsdf', 5]]
[[8, 'lksdjjf', 15]]
[[18, 'lkkjj', 23]]
c S s | S)Nrw )r� rW rv rw rw rx ry ` s z locatedExpr.<locals>.<lambda>�
locn_startr� �locn_end)r
r� r r� r )rO �locatorrw rw rx rj L s z\[]-*.$+^?()~ rY c C s | d d S)Nr rr rw )r� rW rv rw rw rx ry k s ry z\\0?[xX][0-9a-fA-F]+c C s t t | d j d � d � � S)Nr z\0x� )�unichrru �lstrip)r� rW rv rw rw rx ry l s z \\0[0-7]+c C s! t t | d d d � d � � S)Nr rr � )r ru )r� rW rv rw rw rx ry m s rJ z\]z\wr� r r$ �negate�bodyr c sY d d � � y0 d j � f d d � t j | � j D� � SWn t k
rT d SYn Xd S)a�
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 C{\-} or C{\]})
- an escaped hex character with a leading C{'\x'} (C{\x21}, which is a C{'!'} character)
(C{\0x##} is also supported for backwards compatibility)
- an escaped octal character with a leading C{'\0'} (C{\041}, which is a C{'!'} character)
- a range of any of the above, separated by a dash (C{'a-z'}, etc.)
- any combination of the above (C{'aeiouy'}, C{'a-zA-Z0-9_$'}, etc.)
c S sN t | t � s | Sd j d d � t t | d � t | d � d � D� � S)Nr� c s s | ] } t | � Vq d S)N)r )r� r� rw rw rx r� � s z+srange.<locals>.<lambda>.<locals>.<genexpr>r rr )rz r" r� r� �ord)�prw rw rx ry � s zsrange.<locals>.<lambda>r� c 3 s | ] } � | � Vq d S)Nrw )r� �part)� _expandedrw rx r� � s zsrange.<locals>.<genexpr>N)r� �_reBracketExprr� r rn )r� rw )r rx r_ r s
0
c s � f d d � } | S)zt
Helper method for defining parse actions that require matching at a specific
column in the input text.
c s/ t | | � � k r+ t | | d � � � d S)Nz matched token not at column %d)r9 r )rH �locnrS )r� rw rx � verifyCol� s z!matchOnlyAtCol.<locals>.verifyColrw )r� r rw )r� rx rM � s c s � f d d � S)a�
Helper method for common parse actions that simply return a literal value. Especially
useful when used with C{L{transformString<ParserElement.transformString>}()}.
Example::
num = Word(nums).setParseAction(lambda toks: int(toks[0]))
na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
term = na | num
OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
c s � g S)Nrw )r� rW rv )�replStrrw rx ry � s z replaceWith.<locals>.<lambda>rw )r rw )r rx r\ � s c C s | d d d � S)a
Helper parse action for removing quotation marks from parsed quoted strings.
Example::
# by default, quotation marks are included in parsed results
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
# use removeQuotes to strip quotation marks from parsed results
quotedString.setParseAction(removeQuotes)
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
r rr rs rw )r� rW rv rw rw rx rZ � s c se � � f d d � } y" t � d t � d � j � } Wn t k
rW t � � } Yn X| | _ | S)aG
Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional
args are passed, they are forwarded to the given function as additional arguments after
the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
parsed data to an integer using base 16.
Example (compare the last to example in L{ParserElement.transformString}::
hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
hex_ints.runTests('''
00 11 22 aa FF 0a 0d 1a
''')
upperword = Word(alphas).setParseAction(tokenMap(str.upper))
OneOrMore(upperword).runTests('''
my kingdom for a horse
''')
wd = Word(alphas).setParseAction(tokenMap(str.title))
OneOrMore(wd).setParseAction(' '.join).runTests('''
now is the winter of our discontent made glorious summer by this sun of york
''')
prints::
00 11 22 aa FF 0a 0d 1a
[0, 17, 34, 170, 255, 10, 13, 26]
my kingdom for a horse
['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
now is the winter of our discontent made glorious summer by this sun of york
['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
c s � � f d d � | D� S)Nc s g | ] } � | � � � q Srw rw )r� �tokn)r� rX rw rx r� � s z(tokenMap.<locals>.pa.<locals>.<listcomp>rw )r� rW rv )r� rX rw rx r� � s ztokenMap.<locals>.par� rk )rm r� rn r| )rX r� r� rq rw )r� rX rx rm � s
c C s t | � j � S)N)r� r: )rv rw rw rx ry � s c C s t | � j � S)N)r� �lower)rv rw rw rx ry � s c C sE t | t � r+ | } t | d | �} n | j } t t t d � } | r� t j � j t
� } t d � | d � t t
t | t d � | � � � t d d d g �j d � j d
d � � t d � } n� d
j d d � t D� � } t j � j t
� t | � B} t d � | d � t t
t | j t � t t d � | � � � � t d d d g �j d � j d d � � t d � } t t d � | d � } | j d d
j | j d d � j � j � � � j d | � } | j d d
j | j d d � j � j � � � j d | � } | | _ | | _ | | f S)zRInternal helper to construct opening and closing tag expressions, given a tag namer9 z_-:r' �tag�=�/r FrC c S s | d d k S)Nr r rw )r� rW rv rw rw rx ry � s z_makeTags.<locals>.<lambda>r( r� c s s! | ] } | d k r | Vq d S)r( Nrw )r� r� rw rw rx r� � s z _makeTags.<locals>.<genexpr>c S s | d d k S)Nr r rw )r� rW rv rw rw rx ry � s z</rC �:r# z<%s>rZ z</%s>) rz r� r r� r/ r4 r3 r> r� r� rZ r+ r r2 r r r� r� rV rY rB r
�_Lr� �titler� r� r )�tagStr�xml�resname� tagAttrName� tagAttrValue�openTag�printablesLessRAbrack�closeTagrw rw rx � _makeTags� s" r ~AA r! c C s
t | d � S)a
Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.
Example::
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
# makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
a,a_end = makeHTMLTags("A")
link_expr = a + SkipTo(a_end)("link_text") + a_end
for link in link_expr.searchString(text):
# attributes in the <A> tag (like "href" shown here) are also accessible as named results
print(link.link_text, '->', link.href)
prints::
pyparsing -> http://pyparsing.wikispaces.com
F)r! )r rw rw rx rK � s c C s
t | d � S)z�
Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
tags only in the given upper/lower case.
Example: similar to L{makeHTMLTags}
T)r! )r rw rw rx rL s c sN | r | d d � � n | j � � d d � � D� � � f d d � } | S)a<
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{<TD>} or C{<DIV>}.
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.
If just testing for C{class} (with or without a namespace), use C{L{withClass}}.
To verify that the attribute exists, but without specifying a value, pass
C{withAttribute.ANY_VALUE} as the value.
Example::
html = '''
<div>
Some text
<div type="grid">1 4 0 1 0</div>
<div type="graph">1,3 2,3 1,1</div>
<div>this has no type</div>
</div>
'''
div,div_end = makeHTMLTags("div")
# only match div tag having a type attribute with value "grid"
div_grid = div().setParseAction(withAttribute(type="grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
# construct a match with any div tag having a type attribute, regardless of the value
div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
Nc S s" g | ] \ } } | | f � q Srw rw )r� r� r� rw rw rx r� Q s z!withAttribute.<locals>.<listcomp>c s xx � D]p \ } } | | k r5 t | | d | � � | t j k r | | | k r t | | d | | | | f � � q Wd S)Nzno matching attribute z+attribute '%s' has value '%s', must be '%s')r re � ANY_VALUE)r� rW r� �attrName� attrValue)�attrsrw rx r� R s zwithAttribute.<locals>.pa)r� )r� �attrDictr� rw )r% rx re s 2 c C s& | r d | n d } t | | i � S)a�
Simplified version of C{L{withAttribute}} when matching on a div class - made
difficult because C{class} is a reserved word in Python.
Example::
html = '''
<div>
Some text
<div class="grid">1 4 0 1 0</div>
<div class="graph">1,3 2,3 1,1</div>
<div>this <div> has no class</div>
</div>
'''
div,div_end = makeHTMLTags("div")
div_grid = div().setParseAction(withClass("grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
z%s:class�class)re )� classname� namespace� classattrrw rw rx rk \ s �(rh c C s6 t � } | | | | B} x
t | � D]�\ } } | d d d � \ } } }
} | d k rj d | n d | } | d k r� | d k s� t | � d k r� t d � � | \ }
} t � j | � } |
t j k r�| d k r
t | | � t | t | � � } q�| d k rx| d k rQt | | | � t | t | | � � } q�t | | � t | t | � � } q�| d k r�t | |
| | | � t | |
| | | � } q�t d � � n(|
t j
k r�| d k r&t | t � st | � } t | j
| � t | | � } q�| d k r�| d k rmt | | | � t | t | | � � } q�t | | � t | t | � � } q�| d k r�t | |
| | | � t | |
| | | � } q�t d � � n t d
� � | r| j | � | | j | � | BK} | } q( W| | K} | S) a�
Helper method for constructing grammars of expressions made up of
operators working in a precedence hierarchy. Operators may be unary or
binary, left- or right-associative. Parse actions can also be attached
to operator expressions. The generated parser will also recognize the use
of parentheses to override operator precedences (see example below).
Note: if you define a deep operator list, you may see performance issues
when using infixNotation. See L{ParserElement.enablePackrat} for a
mechanism to potentially improve your parser performance.
Parameters:
- baseExpr - expression representing the most basic element for the nested
- opList - list of tuples, one for each operator precedence level in the
expression grammar; each tuple is of the form
(opExpr, numTerms, rightLeftAssoc, parseAction), where:
- opExpr is the pyparsing expression for the operator;
may also be a string, which will be converted to a Literal;
if numTerms is 3, opExpr is a tuple of two expressions, for the
two operators separating the 3 terms
- numTerms is the number of terms for this operator (must
be 1, 2, or 3)
- rightLeftAssoc is the indicator whether the operator is
right or left associative, using the pyparsing-defined
constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
- parseAction is the parse action to be associated with
expressions matching this operator expression (the
parse action tuple member may be omitted)
- lpar - expression for matching left-parentheses (default=C{Suppress('(')})
- rpar - expression for matching right-parentheses (default=C{Suppress(')')})
Example::
# simple example of four-function arithmetic with ints and variable names
integer = pyparsing_common.signed_integer
varname = pyparsing_common.identifier
arith_expr = infixNotation(integer | varname,
[
('-', 1, opAssoc.RIGHT),
(oneOf('* /'), 2, opAssoc.LEFT),
(oneOf('+ -'), 2, opAssoc.LEFT),
])
arith_expr.runTests('''
5+3*6
(5+3)*6
-2--11
''', fullDump=False)
prints::
5+3*6
[[5, '+', [3, '*', 6]]]
(5+3)*6
[[[5, '+', 3], '*', 6]]
-2--11
[[['-', 2], '-', ['-', 11]]]
Nr^ ro z%s termz %s%s termrq z@if numterms=3, opExpr must be a tuple or list of two expressionsrr z6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity)N)r r� r� r� r� rT �LEFTr r r �RIGHTrz r rO r� )�baseExpr�opList�lpar�rparr� �lastExprr� �operDef�opExpr�arity�rightLeftAssocr� �termName�opExpr1�opExpr2�thisExprr� rw rw rx ri � sR ; ' /' $ /'
z4"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*�"z string enclosed in double quotesz4'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*�'z string enclosed in single quotesz*quotedString using single or double quotes�uzunicode string literalc C s' | | k r t d � � | d k r�t | t � r�t | t � r�t | � d k r� t | � d k r� | d k r� t t | t | | t j d d �� � j d d � � } q�t
j � t | | t j � j d d � � } q�| d k r?t t | t | � t | � t t j d d �� � j d d � � } q�t t t | � t | � t t j d d �� � j d d � � } n t d
� � t
� } | d k r�| t t | � t | | B| B� t | � � K} n. | t t | � t | | B� t | � � K} | j d | | f � | S) a~
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=C{"("}); can also be a pyparsing expression
- closer - closing character for a nested list (default=C{")"}); can also be a pyparsing expression
- content - expression for items within the nested lists (default=C{None})
- ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})
If an expression is not provided for the content argument, the nested
expression will capture all whitespace-delimited content between delimiters
as a list of separate values.
Use the C{ignoreExpr} argument to define expressions that may contain
opening or closing characters that should not be treated as opening
or closing characters for nesting, such as quotedString or a comment
expression. Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
The default is L{quotedString}, but if no expressions are to be ignored,
then pass C{None} for this argument.
Example::
data_type = oneOf("void int short long char float double")
decl_data_type = Combine(data_type + Optional(Word('*')))
ident = Word(alphas+'_', alphanums+'_')
number = pyparsing_common.number
arg = Group(decl_data_type + ident)
LPAR,RPAR = map(Suppress, "()")
code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
c_function = (decl_data_type("type")
+ ident("name")
+ LPAR + Optional(delimitedList(arg), [])("args") + RPAR
+ code_body("body"))
c_function.ignore(cStyleComment)
source_code = '''
int is_odd(int x) {
return (x%2);
}
int dec_to_hex(char hchar) {
if (hchar >= '0' && hchar <= '9') {
return (ord(hchar)-ord('0'));
} else {
return (10+ord(hchar)-ord('A'));
}
}
'''
for func in c_function.searchString(source_code):
print("%(name)s (%(type)s) args: %(args)s" % func)
prints::
is_odd (int) args: [['int', 'x']]
dec_to_hex (int) args: [['char', 'hchar']]
z.opening and closing strings cannot be the sameNrr rY c S s | d j � S)Nr )r� )rv rw rw rx ry 9 s z nestedExpr.<locals>.<lambda>c S s | d j � S)Nr )r� )rv rw rw rx ry < s c S s | d j � S)Nr )r� )rv rw rw rx ry B s c S s | d j � S)Nr )r� )rv rw rw rx ry F s zOopening and closing arguments must be strings if no content expression is givenznested %s%s expression)r� rz r� r� r
r r r$ rs r� rC r� r r r r+ r2 r� )�opener�closer�contentr� r� rw rw rx rP � s4 : $
$ 5.c s> � f d d � } � f d d � } � f d d � } t t � j d � j � � } t � t � j | � j d � } t � j | � j d � } t � j | � j d
� } | r� t t | � | t | t | � t | � � | � }
n0 t t | � t | t | � t | � � � }
| j t
t � � |
j d � S) a
Helper method for defining space-delimited indentation blocks, such as
those used to define block statements in Python source code.
Parameters:
- blockStatementExpr - expression defining syntax of statement that
is repeated within the indented block
- indentStack - list created by caller to manage indentation stack
(multiple statementWithIndentedBlock expressions within a single grammar
should share a common indentStack)
- indent - boolean indicating whether block must be indented beyond the
the current level; set to False for block of left-most statements
(default=C{True})
A valid block must contain at least one C{blockStatement}.
Example::
data = '''
def A(z):
A1
B = 100
G = A2
A2
A3
B
def BB(a,b,c):
BB1
def BBA():
bba1
bba2
bba3
C
D
def spam(x,y):
def eggs(z):
pass
'''
indentStack = [1]
stmt = Forward()
identifier = Word(alphas, alphanums)
funcDecl = ("def" + identifier + Group( "(" + Optional( delimitedList(identifier) ) + ")" ) + ":")
func_body = indentedBlock(stmt, indentStack)
funcDef = Group( funcDecl + func_body )
rvalue = Forward()
funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
rvalue << (funcCall | identifier | Word(nums))
assignment = Group(identifier + "=" + rvalue)
stmt << ( funcDef | assignment | identifier )
module_body = OneOrMore(stmt)
parseTree = module_body.parseString(data)
parseTree.pprint()
prints::
[['def',
'A',
['(', 'z', ')'],
':',
[['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
'B',
['def',
'BB',
['(', 'a', 'b', 'c', ')'],
':',
[['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
'C',
'D',
['def',
'spam',
['(', 'x', 'y', ')'],
':',
[[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]]
c sm | t | � k r d St | | � } | � d k ri | � d k rW t | | d � � t | | d � � d S)Nrr zillegal nestingznot a peer entryrs rs )r� r9 r! r )r� rW rv �curCol)� indentStackrw rx �checkPeerIndent� s z&indentedBlock.<locals>.checkPeerIndentc sE t | | � } | � d k r/ � j | � n t | | d � � d S)Nrr znot a subentryrs )r9 r r )r� rW rv rA )rB rw rx �checkSubIndent� s z%indentedBlock.<locals>.checkSubIndentc sk | t | � k r d St | | � } � oH | � d k oH | � d k s] t | | d � � � j � d S)Nrr rq znot an unindentrs r\ )r� r9 r r )r� rW rv rA )rB rw rx �
checkUnindent� s &z$indentedBlock.<locals>.checkUnindentz �INDENTr� �UNINDENTzindented block) r r r r r
r� r� r r r r� ) �blockStatementExprrB r, rC rD rE r? rF �PEER�UNDENT�smExprrw )rB rx rf Q s N "8 $z#[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]z[\0xa1-\0xbf\0xd7\0xf7]z_:zany tagzgt lt amp nbsp quot aposz><& "'z &(?P<entity>r� z);zcommon HTML entityc C s t j | j � S)zRHelper parser action to replace common HTML entities with their special characters)�_htmlEntityMapr� �entity)rv rw rw rx r[ � s z/\*(?:[^*]|\*(?!/))*z*/zC style commentz<!--[\s\S]*?-->z HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z
// commentzC++ style commentz#.*zPython style commentz � commaItemr c @ s� e Z d Z d Z e e � Z e e � Z e e
� j d � j e � Z
e e � j d � j e e d � � Z e d � j d � j e � Z e � j e � d e � j e � j d � Z e j d d
� � e e e e d � j � e � Bj d � Z e j e � e d
� j d � j e � Z e d � j d � j e � Z e e Be Bj � Z e d � j d � j e � Z e e d e d � j d � Z e d � j d � Z e d � j d � Z! e! d e! d j d � Z" e e! d e! d> � d e e! d e! d? � j d � Z# e# j$ d d
� � d! e j d" � Z% e& e" e% Be# Bj d# � � j d# � Z' e d$ � j d% � Z( e) d& d' d( � � Z* e) d) d* d+ � � Z+ e d, � j d- � Z, e d. � j d/ � Z- e d0 � j d1 � Z. e/ j � e0 j � BZ1 e) d2 d3 � � Z2 e& e3 e4 d4 � e5 � e e6 d5 d4 �e e7 d6 � � � � j � j d7 � Z8 e9 e e: j; � e8 Bd8 d9 �� j d: � Z< e) e d; d
� � � Z= e) e d< d
� � � Z> d= S)@rn a�
Here are some common low-level expressions that may be useful in jump-starting parser development:
- numeric forms (L{integers<integer>}, L{reals<real>}, L{scientific notation<sci_real>})
- common L{programming identifiers<identifier>}
- network addresses (L{MAC<mac_address>}, L{IPv4<ipv4_address>}, L{IPv6<ipv6_address>})
- ISO8601 L{dates<iso8601_date>} and L{datetime<iso8601_datetime>}
- L{UUID<uuid>}
- L{comma-separated list<comma_separated_list>}
Parse actions:
- C{L{convertToInteger}}
- C{L{convertToFloat}}
- C{L{convertToDate}}
- C{L{convertToDatetime}}
- C{L{stripHTMLTags}}
- C{L{upcaseTokens}}
- C{L{downcaseTokens}}
Example::
pyparsing_common.number.runTests('''
# any int or real number, returned as the appropriate type
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.fnumber.runTests('''
# any int or real number, returned as float
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.hex_integer.runTests('''
# hex numbers
100
FF
''')
pyparsing_common.fraction.runTests('''
# fractions
1/2
-3/4
''')
pyparsing_common.mixed_integer.runTests('''
# mixed fractions
1
1/2
-3/4
1-3/4
''')
import uuid
pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
pyparsing_common.uuid.runTests('''
# uuid
12345678-1234-5678-1234-567812345678
''')
prints::
# any int or real number, returned as the appropriate type
100
[100]
-100
[-100]
+100
[100]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# any int or real number, returned as float
100
[100.0]
-100
[-100.0]
+100
[100.0]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# hex numbers
100
[256]
FF
[255]
# fractions
1/2
[0.5]
-3/4
[-0.75]
# mixed fractions
1
[1]
1/2
[0.5]
-3/4
[-0.75]
1-3/4
[1.75]
# uuid
12345678-1234-5678-1234-567812345678
[UUID('12345678-1234-5678-1234-567812345678')]
�integerz hex integerr z[+-]?\d+zsigned integerr �fractionc C s | d | d S)Nr rr rs rw )rv rw rw rx ry � s zpyparsing_common.<lambda>r� z"fraction or mixed integer-fractionz
[+-]?\d+\.\d*z real numberz+[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)z$real number with scientific notationz [+-]?\d+\.?\d*([eE][+-]?\d+)?�fnumberr� �
identifierzK(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}z IPv4 addressz[0-9a-fA-F]{1,4}� hex_integerr � zfull IPv6 addressr re z::zshort IPv6 addressc C s t d d � | D� � d k S)Nc s s' | ] } t j j | � r d Vq d S)rr N)rn �
_ipv6_partr� )r� r� rw rw rx r� � s z,pyparsing_common.<lambda>.<locals>.<genexpr>r )r� )rv rw rw rx ry � s z::ffff:zmixed IPv6 addressz IPv6 addressz:[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}z MAC addressz%Y-%m-%dc s � f d d � } | S)a�
Helper to create a parse action for converting parsed date string to Python datetime.date
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%d"})
Example::
date_expr = pyparsing_common.iso8601_date.copy()
date_expr.setParseAction(pyparsing_common.convertToDate())
print(date_expr.parseString("1999-12-31"))
prints::
[datetime.date(1999, 12, 31)]
c sb y t j | d � � j � SWn= t k
r] } z t | | t | � � � WYd d } ~ Xn Xd S)Nr )r �strptime�dater� r r| )r� rW rv �ve)�fmtrw rx �cvt_fn� s z.pyparsing_common.convertToDate.<locals>.cvt_fnrw )rY rZ rw )rY rx �
convertToDate� s z pyparsing_common.convertToDatez%Y-%m-%dT%H:%M:%S.%fc s � f d d � } | S)a
Helper to create a parse action for converting parsed datetime string to Python datetime.datetime
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%dT%H:%M:%S.%f"})
Example::
dt_expr = pyparsing_common.iso8601_datetime.copy()
dt_expr.setParseAction(pyparsing_common.convertToDatetime())
print(dt_expr.parseString("1999-12-31T23:59:59.999"))
prints::
[datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
c s\ y t j | d � � SWn= t k
rW } z t | | t | � � � WYd d } ~ Xn Xd S)Nr )r rV r� r r| )r� rW rv rX )rY rw rx rZ � s z2pyparsing_common.convertToDatetime.<locals>.cvt_fnrw )rY rZ rw )rY rx �convertToDatetime� s z"pyparsing_common.convertToDatetimez7(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?z ISO8601 datez�(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?zISO8601 datetimez2[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}�UUIDc C s t j j | d � S)a
Parse action to remove HTML tags from web page HTML source
Example::
# strip HTML links from normal text
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
td,td_end = makeHTMLTags("TD")
table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
print(table_text.parseString(text).body) # -> 'More info at the pyparsing wiki page'
r )rn �_html_stripperr� )r� rW r� rw rw rx �
stripHTMLTags� s
z pyparsing_common.stripHTMLTagsr� rJ z rN r r� zcomma separated listc C s t | � j � S)N)r� r: )rv rw rw rx ry � s c C s t | � j � S)N)r� r )rv rw rw rx ry � s N)r re )r re )?r� r� r� r� rm ru �convertToInteger�float�convertToFloatr/ rR r� r� rO rD rS r' �signed_integerrP r� r r �
mixed_integerr� �real�sci_realr� �numberrQ r4 r3 rR � ipv4_addressrU �_full_ipv6_address�_short_ipv6_addressr� �_mixed_ipv6_addressr
� ipv6_address� mac_addressr1 r[ r\ � iso8601_date�iso8601_datetime�uuidr7 r6 r^ r_ r r r rV r. �
_commasepitemr@ rY r� �comma_separated_listrd rB rw rw rw rx rn � sL � ' /-
;&J+�__main__�select�fromz_$r� r� �columnsr� Ztables�commandaK
# '*' as column list and dotted table name
select * from SYS.XYZZY
# caseless match on "SELECT", and casts back to "select"
SELECT * from XYZZY, ABC
# list of column names, and mixed case SELECT keyword
Select AA,BB,CC from Sys.dual
# multiple tables
Select A, B, C from Sys.dual, Table2
# invalid SELECT keyword - should fail
Xelect A, B, C from Sys.dual
# incomplete command - should fail
Select
# invalid column name - should fail
Select ^^^ frox Sys.dual
z]
100
-100
+100
3.14159
6.02e23
1e-12
z
100
FF
z6
12345678-1234-5678-1234-567812345678
)�r� � __version__�__versionTime__�
__author__r� �weakrefr r� r� r r� r� rb r� r@ r^ r� r �_threadr � ImportError� threadingr r� Z ordereddict�__all__r� � version_infor] r# �maxsizer2 r| r� �chrr r� r� r� r: �reversedr� r� r< r� rW rX rl Zmaxint�xranger� Z __builtin__r� �fnamer rm r� r� r� r� r� r� �ascii_uppercase�ascii_lowercaser4 rR rD r3 r� r� � printablerV rn r r r! r# r& r� r" �MutableMapping�registerr9 rJ rG rP rT rV rQ rr r$ r, r
r r r rv r r r rl r/ r' r% r r. r� r r r r* r) r1 r0 r r r r r r r r r� r r2 r� r� r r( r r� r- r
r r r+ r rb r@ r< r� rO rN rS rS rA rg rh rj r� rC rI rH ra r` r� � _escapedPunc�_escapedHexChar�_escapedOctChar�UNICODE� _singleChar�
_charRanger� r
r_ rM r\ rZ rm rd rB r! rK rL re r" rk rT r, r- ri rU r> r^ rY rc rP rf r5 rW r7 r6 r� r� rL r� r; r[ r8 rE r r] r? r= rF rX r� rq r: rn r� Z selectTokenZ fromToken�identZ
columnNameZcolumnNameListZ
columnSpecZ tableNameZ
tableNameListZ simpleSQLr0 rg rQ rS rp r] rw rw rw rx �<module>= s�
*
8
� � �
@� � � � � & A=�I�G3 pLOD|M &# @sQ,A , I #% $4@
, ? # k % Zr (, #8+�
$