| Server IP : 127.0.0.1 / Your IP : 216.73.216.109 Web Server : Apache/2.4.54 (Win64) OpenSSL/1.1.1q PHP/8.1.10 System : Windows NT DESKTOP-E5T4RUN 10.0 build 19045 (Windows 10) AMD64 User : SERVERWEB ( 0) PHP Version : 8.1.10 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : OFF | Perl : OFF | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : C:/cygwin64/lib/python3.9/site-packages/pyparsing/__pycache__/ |
Upload File : |
a
�l�a'7 � @ s` U d dl Z d dlmZmZmZmZmZm Z m
Z
m Z m Z m
Z
mZ d dlmZmZ d dlmZ d dlZd dlZd dlZd dlZd dlZd dlZd dlmZ d dl Z d dl Z d dl m Z d dl m!Z! d dl"m#Z# d d l$m%Z% d
d l&m'Z'm(Z(m)Z)m*Z*m+Z+m,Z,m-Z-m.Z/m0Z1 d
d l2T d
d l3T d
d
l4m5Z5m6Z6 d
dl7m8Z8 ej9Z:e;e<fZ=e
e>df e?d< G dd� de)�Z@G dd� de)�ZAG dd� de�ZBdd� ZCdd� ZDdd � ZE[)e e; ee; eFd �d d �ZGeGejHe jI�Jd ���r�eE� eKeLeMeNeOePeQeReSeTeUh ZVe jWZXeeg ef ee5gef eeYe5gef ee;eYe5gef f ZZeeg eFf ee5geFf eeYe5geFf ee;eYe5geFf f Z[ee;eYd!e\gdf Z]ee;eYd!eFgdf Z^ee;eYeYd!e5eFgdf Z_ee;eYd!e\eFgdf Z`ejaejb Zce8jdjeZee8jdjfZfd"Zgegd# Zheceg Zid$�jd%d&� ejkD ��Zldamd�d(d)�Znd�e[e;eFd+�d,d-�Zod�e;eYd!eFd.�d/d0�Zpd�e;eYeYd!e5eFd1�d2d3�Zqd�e;eYd!e\eFd4�d5d6�Zrd7d8� ZsG d9d!� d!e�ZtG d:d;� d;et�ZuG d<d=� d=et�ZvG d>d?� d?ev�ZwG d@dA� dAev�ZxG dBdC� dCev�ZyG dDdE� dEey�Zzeyet_{G dFdG� dGev�Z|G dHdI� dIey�Z}G dJdK� dKe|�Z~G dLdM� dMev�ZG dNdO� dOev�Z�G dPdQ� dQe��Z�G dRdS� dSe��Z�G dTdU� dUev�Z�G dVdW� dWev�Z�G dXdY� dYev�Z�G dZd[� d[ev�Z�G d\d]� d]ev�Z�G d^d_� d_e��Z�G d`da� dae��Z�G dbdc� dce��Z�G ddde� dee��Z�G dfdg� dge��Z�G dhdi� die��Z�G djdk� dke��Z�G dldm� dmet�Z�G dndo� doe��Z�G dpdq� dqe��Z�G drds� dse��Z�G dtdu� due��Z�G dvdw� dwet�Z�G dxdy� dye��Z�G dzd{� d{e��Z�G d|d}� d}e��Z�G d~d� de��Z�G d�d�� d�e��Z�G d�d�� d�e��Z�G d�d�� d�e��Z�G d�d�� d�e��Z�G d�d�� d�e��Z�G d�d�� d�e��Z�G d�d�� d��Z�G d�d�� d�e��Z�e�ZG d�d�� d�e��Z�G d�d�� d�e��Z�G d�d�� d�e��Z�G d�d�� d�e��Z�G d�d�� d�e��Z�G d�d�� d�e��ZG d�d�� d�e��Z�eZd��d�d��Z�ew� ��d��Z�e�� ��d��Z�e�� ��d��Z�e�� ��d��Z�e�� ��d��Z�e�e,d�d'd����d�d�� �Z�e�d����d�d�� �Z�e�d����d�d�� �Z�e�e�B e�B e�d�d
d��B Z�e�e�e�d�� e� �Z�eyd��e�d����d�� e�e�e�e�B ����d�� d� Z�d�d�� Z�d�d�� Z�d�d�� Z�e�e�d��d� ���d��Z�e�e�d��d� ���d��Z�e�e�d��d� e�d��d� B ���d��Z�e�d�e��� ���dáZ�e�dăZ�e�dŃZ�d�dDŽ e�� ��� D �Z�e�Z�eoZ�esZ�e�Z�e�Z�e�Z�e�Z�e�Z�e�Z�e�Z�e�Z�e�Z�dS )�� N) �Optional�Iterable�Union�Callable�Any� Generator�Tuple�List�TextIO�Set�Dict)�ABC�abstractmethod)�Enum)r )�
itemgetter)�wraps)�RLock)�Path� ) �
_FifoCache�_UnboundedCache�__config_flags�_collapse_string_to_ranges�_escape_regex_range_chars�_bslash�_flatten�LRUMemo�
UnboundedMemo)�*)� ParseResults�_ParseResultsWithOffset)�pyparsing_unicode.�str_typec @ s0 e Zd ZdZdZdZdd� e� D �Zd�� Z dS )�
__compat__aJ
A cross-version compatibility configuration for pyparsing features that will be
released in a future version. By setting values in this configuration to True,
those features can be enabled in prior versions for compatibility development
and testing.
- ``collect_all_And_tokens`` - flag to enable fix for Issue #63 that fixes erroneous grouping
of results names when an :class:`And` expression is nested within an :class:`Or` or :class:`MatchFirst`;
maintained for compatibility, but setting to ``False`` no longer restores pre-2.3.1
behavior
Z
compatibilityTc C s g | ]}|� d �s|�qS ��_��
startswith��.0�__� r+ �2/usr/lib/python3.9/site-packages/pyparsing/core.py�
<listcomp>^ � z__compat__.<listcomp>z(
collect_all_And_tokens
N)
�__name__�
__module__� __qualname__�__doc__�
_type_descZcollect_all_And_tokens�locals�
_all_names�splitZ _fixed_namesr+ r+ r+ r, r# M s
r# c @ sh e Zd ZdZdZdZdZdZdZdZ dZ
dZ dd� e � D �Z
dd� e
D �Zdd� e
D �Zedd� �Zd S )
�__diag__Z
diagnosticFc C s g | ]}|� d �s|�qS r$ r& r( r+ r+ r, r- p r. z__diag__.<listcomp>c C s g | ]}|� d �r|�qS )�warnr& �r) �namer+ r+ r, r- q r. c C s g | ]}|� d �r|�qS )Z enable_debugr& r9 r+ r+ r, r- r r. c C s | j D ]}| �|� qd S �N)�_warning_names�enable)�clsr: r+ r+ r, �enable_all_warningst s
z __diag__.enable_all_warningsN)r/ r0 r1 r3 �)warn_multiple_tokens_in_named_alternation�)warn_ungrouped_named_tokens_in_collection� warn_name_set_on_empty_Forward�!warn_on_parse_using_empty_Forward� warn_on_assignment_to_Forward�%warn_on_multiple_string_args_to_oneof�(warn_on_match_first_with_lshift_operator�!enable_debug_on_named_expressionsr4 r5 r< Z _debug_names� classmethodr? r+ r+ r+ r, r7 d s r7 c @ s0 e Zd ZdZdZdZdZdZdZdZ dZ
d Z d
S ) � Diagnosticsa�
Diagnostic configuration (all default to disabled)
- ``warn_multiple_tokens_in_named_alternation`` - flag to enable warnings when a results
name is defined on a :class:`MatchFirst` or :class:`Or` expression with one or more :class:`And` subexpressions
- ``warn_ungrouped_named_tokens_in_collection`` - flag to enable warnings when a results
name is defined on a containing expression with ungrouped subexpressions that also
have results names
- ``warn_name_set_on_empty_Forward`` - flag to enable warnings when a :class:`Forward` is defined
with a results name, but has no contents defined
- ``warn_on_parse_using_empty_Forward`` - flag to enable warnings when a :class:`Forward` is
defined in a grammar but has never had an expression attached to it
- ``warn_on_assignment_to_Forward`` - flag to enable warnings when a :class:`Forward` is defined
but is overwritten by assigning using ``'='`` instead of ``'<<='`` or ``'<<'``
- ``warn_on_multiple_string_args_to_oneof`` - flag to enable warnings when :class:`one_of` is
incorrectly called with multiple str arguments
- ``enable_debug_on_named_expressions`` - flag to auto-enable debug on all subsequent
calls to :class:`ParserElement.set_name`
Diagnostics are enabled/disabled by calling :class:`enable_diag` and :class:`disable_diag`.
All warnings can be enabled by calling :class:`enable_all_warnings`.
r r � � � � � � N) r/ r0 r1 r2 r@ rA rB rC rD rE rF rG r+ r+ r+ r, rI z s rI c C s t �| j� dS )zO
Enable a global pyparsing diagnostic flag (see :class:`Diagnostics`).
N)r7 r= r: �Z diag_enumr+ r+ r, � enable_diag� s rQ c C s t �| j� dS )zP
Disable a global pyparsing diagnostic flag (see :class:`Diagnostics`).
N)r7 Zdisabler: rP r+ r+ r, � disable_diag� s rR c C s t �� dS )zU
Enable all global pyparsing diagnostic warnings (see :class:`Diagnostics`).
N)r7 r? r+ r+ r+ r, r? � s r? )�cmd_line_warn_options� warn_env_var�returnc C sx t |�}| D ]f}|d �d�d d� \}}}}}|�� �d�sX|sJ|sJ|rR|dkrXd}q |�� �d�r |dv r d}q |S ) Nz::::�:rM �i� pyparsingT)rX � F)�boolr6 �lowerr' ) rS rT r= Zwarn_optZw_actionZ w_messageZ
w_categoryZw_moduleZw_liner+ r+ r, �_should_enable_warnings� s( ������r\ ZPYPARSINGENABLEALLWARNINGS�
ParserElement�
0123456789Z ABCDEFabcdefrY c c s | ]}|t jvr|V qd S r; )�stringZ
whitespace�r) �cr+ r+ r, � <genexpr>� r. rb rJ c s� �t v r�fdd�S d�d�ddd�� d}tp<tjdd �d
atd td | f�� �����fd d
�}t�dt�d�j�}||_|S )zAdecorator to trim function calls to match the arity of the targetc s � |�S r; r+ ��s�l�t)�funcr+ r, �<lambda>� r. z _trim_arity.<locals>.<lambda>r Fc S s$ t j| |d�}|d }|d d� gS )N��limit���rJ )� traceback�
extract_tb)�tbrj ZframesZ
frame_summaryr+ r+ r, rm s z _trim_arity.<locals>.extract_tb� rJ ri rk r c
s� z�| �d � � }d�|W S t y� } zZ�r2� nF|j}� |dd�d d d� �k}~|rv��krv�d7 �W Y d }~q � W Y d }~q d }~0 0 q d S )NTrJ ri rk r )� TypeError�
__traceback__)�args�ret�tern Ztrim_arity_type_error�rm Z found_arityrg rj �maxargsZpa_call_line_synthr+ r, �wrapper s � z _trim_arity.<locals>.wrapperr/ � __class__)r )�_single_arg_builtins�_trim_arity_call_linerl �
extract_stack�getattrr/ )rg rv Z LINE_DIFFrw � func_namer+ ru r, � _trim_arity� s
�
�r~ F)�fn�message�fatalc s@ |dur |nd�|rt nt� t���t��� ��fdd��}|S )aC
Function to convert a simple predicate function that returns ``True`` or ``False``
into a parse action. Can be used in places when a parse action is required
and :class:`ParserElement.add_condition` cannot be used (such as when adding a condition
to an operator level in :class:`infix_notation`).
Optional keyword arguments:
- ``message`` - define a custom message to be used in the raised exception
- ``fatal`` - if True, will raise :class:`ParseFatalException` to stop parsing immediately;
otherwise will raise :class:`ParseException`
Nz failed user-defined conditionc s t �| ||��s � | |���d S r; )rZ rc ��exc_typer �msgr+ r, �paL s z%condition_as_parse_action.<locals>.pa)�ParseFatalException�ParseExceptionr~ r )r r� r� r� r+ r� r, �condition_as_parse_action8 s r� )�instring�loc�expr� cache_hitc
C sJ |rdnd}t d�|||t|| �t|| �t|| �dt|| �d �� d S )Nr rY z&{}Match {} at loc {}({},{})
{}
{}^� r )�print�format�lineno�col�line)r� r� r� r� �
cache_hit_strr+ r+ r, �_default_start_debug_actionT s ��r� )r� �startloc�endlocr� �toksr� c C s& |rdnd}t d�|||�� �� d S )Nr rY z{}Matched {} -> {})r� r� �as_list)r� r� r� r� r� r� r� r+ r+ r, � _default_success_debug_actiong s r� )r� r� r� �excr� c C s* |rdnd}t d�||t|�j|�� d S )Nr rY z {}Match {} failed, {} raised: {})r� r� �typer/ )r� r� r� r� r� r� r+ r+ r, � _default_exception_debug_actions s ��r� c G s dS )zG'Do-nothing' debug action, to suppress debugging output during parsing.Nr+ )rr r+ r+ r, �null_debug_action� s r� c @ s� e Zd ZU dZdZeed< dZeed< dZ e
e ed< e ed�d d
��Z
e e d �d d
��Zd�ed�dd�Zed�dd�Zd d�dd�Zd�dd�eeed d�dd�Zd�dd �Zd�ed d �d d �Zee
d d!�d"d#�Zed d!�d$d%�Zed d!�d&d'�Zed d(�d)d*�Z d+d,� Z d-d.� Z d�d/d0�Z d1d2� Z d�e!e"e#f d�d3d4�Z$d�ee"ee"d5�d6d7�Z%ee"ed8�d9d:�Z&e'� Z(i Z)e*e!e"d;ef e!e"e+e#e,f f f ed<< i Z-e'� Z.d=d=gZ/d�e!e"e#f d�d>d?�Z0e$Z1e dd�d@dA��Z2dZ3dZ4e dd�dBdC��Z5e d�ddD�e
e" ddE�dFdG��Z6e d�ddD�e"eddI�dJdK��Z7d�ddL�eeee#dM�dNdO�Z8e9dfde9dP�ee"eee"e:e!e#e"e"f ddf dQ�dRdS�Z;ddT�eeedU�dVdW�Z<e9fde9dP�ee"ee"e#dX�dYdZ�Z=e9dfdd[�ee"ee:eddf d\�d]d^�Z>d_d`� Z?dadb� Z@dcdd� ZAdedf� ZBdgdh� ZCdidj� ZDdkdl� ZEdmdn� ZFdodp� ZGdqdr� ZHdsdt� ZIdudv� ZJdwdx� ZKdZLdydz� ZMd�ed{�d|d}�ZNd d�d~d�ZOd�ed d��d�d��ZPd�ed d��d�d��ZQd�e+eRe ef ed d��d�d��ZSd d�d�d��ZTd d d��d�d��ZUeVeWeXd d��d�d��ZYd�d d�d�d��ZZe[ed�d�d���Z\e]d�d�� �Z^ed d��d�d��Z_e[ed�d�d���Z`ed�d�d��Zaed�d�d��Zbd d�d�d��Zcd�d�� Zdd�d�� Zed�d�d��Zfd�ddL�e+eegehf eeee#d��d�d��Zid�d�� Zjd�d�� Zkd�d dL�eeeed��d�d��Zld�d d d ddd��e+eeme f ee
e+d ef eeeenee#gef e
eh eeeeeenee#gef d��d�d��Zod�e+ehegef e"edd��d�d��Zpe
ZqeZreZseZteZueZveZwe Zxe%Zye&Zze2Z{e6Z|e7Z}e8Z~e;Ze=Z�e<Z�eSZ�eTZ�eYZ�eZZ�e\Z�e_Z�eiZ�eoZ�ePZ�eQZ�dS )�r] z)Abstract base level parser element class.z
�DEFAULT_WHITE_CHARSF�verbose_stacktraceN�_literalStringClass��charsc C s$ | t _tD ]}|jr
t| �|_q
dS )a�
Overrides the default whitespace chars
Example::
# default whitespace chars are space, <TAB> and newline
OneOrMore(Word(alphas)).parse_string("abc def\nghi jkl") # -> ['abc', 'def', 'ghi', 'jkl']
# change to just treat newline as significant
ParserElement.set_default_whitespace_chars(" \t")
OneOrMore(Word(alphas)).parse_string("abc def\nghi jkl") # -> ['abc', 'def']
N)r] r� �_builtin_exprs�copyDefaultWhiteChars�set�
whiteChars)r� r� r+ r+ r, � set_default_whitespace_chars� s z*ParserElement.set_default_whitespace_chars�r> c C s
| t _dS )al
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.parse_string("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# change to Suppress
ParserElement.inline_literals_using(Suppress)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parse_string("1999/12/31") # -> ['1999', '12', '31']
N)r] r� r� r+ r+ r, �inline_literals_using� s z#ParserElement.inline_literals_using��savelistc C s� t � | _d | _d | _d | _d | _|| _d| _tt j
�| _ d| _ d| _
d| _t � | _d| _d| _d| _d| _d| _d| _d | _d| _d| _g | _d S )NTFrY )NNN)�list� parseAction�
failAction�
customName� _defaultName� resultsName�
saveAsList�skipWhitespacer� r] r� r� r� �mayReturnEmpty�keepTabs� ignoreExprs�debug� streamlined�
mayIndexError�errmsg� modalResults� debugActions�re� callPreparse�
callDuringTry�suppress_warnings_)�selfr� r+ r+ r, �__init__� s. �zParserElement.__init__)� warning_typec C s | j �|� | S )aY
Suppress warnings emitted for a particular diagnostic on this expression.
Example::
base = pp.Forward()
base.suppress_warning(Diagnostics.warn_on_parse_using_empty_Forward)
# statement would normally raise a warning, but is now suppressed
print(base.parseString("x"))
)r� �append)r� r� r+ r+ r, �suppress_warning� s
z ParserElement.suppress_warning�rU c C s@ t � | �}| jdd� |_| jdd� |_| jr<ttj�|_|S )a8
Make a copy of this :class:`ParserElement`. Useful for defining
different parse actions for the same parsing pattern, using copies of
the original parse element.
Example::
integer = Word(nums).set_parse_action(lambda toks: int(toks[0]))
integerK = integer.copy().add_parse_action(lambda toks: toks[0] * 1024) + Suppress("K")
integerM = integer.copy().add_parse_action(lambda toks: toks[0] * 1024 * 1024) + Suppress("M")
print(OneOrMore(integerK | integerM | integer).parse_string("5K 100 640K 256M"))
prints::
[5120, 100, 655360, 268435456]
Equivalent form of ``expr.copy()`` is just ``expr()``::
integerM = integer().add_parse_action(lambda toks: toks[0] * 1024 * 1024) + Suppress("M")
N)�copyr� r� r� r� r] r� r� )r� Zcpyr+ r+ r, r� � s
zParserElement.copy)�listAllMatches)r: �list_all_matchesr� rU c C s |p|}| � ||�S )a�
Define name for referencing matching tokens as a nested attribute
of the returned parse results.
Normally, results names are assigned as you would assign keys in a dict:
any existing value is overwritten by later values. If it is necessary to
keep all values captured for a particular results name, call ``set_results_name``
with ``list_all_matches`` = True.
NOTE: ``set_results_name`` returns a *copy* of the original :class:`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,
``expr("name")`` in place of ``expr.set_results_name("name")``
- see :class:`__call__`. If ``list_all_matches`` is required, use
``expr("name*")``.
Example::
date_str = (integer.set_results_name("year") + '/'
+ integer.set_results_name("month") + '/'
+ integer.set_results_name("day"))
# equivalent form:
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
)�_setResultsName)r� r: r� r� r+ r+ r, �set_results_name s z ParserElement.set_results_namec C s@ |d u r | S | � � }|�d�r.|d d� }d}||_| |_|S )Nr rk T)r� �endswithr� r� )r� r: r� Znewselfr+ r+ r, r� ' s
z ParserElement._setResultsNameT)�
break_flagrU c s@ |r&| j � d� fdd� }� |_|| _ nt| j d�r<| j j| _ | S )z�
Method to invoke the Python pdb debugger when this element is
about to be parsed. Set ``break_flag`` to ``True`` to enable, ``False`` to
disable.
Tc s dd l }|�� � | |||�S �Nr )�pdbZ set_trace)r� r� � doActions� callPreParser� �Z _parseMethodr+ r, �breaker; s z(ParserElement.set_break.<locals>.breaker�_originalParseMethod)TT)�_parser� �hasattr)r� r� r� r+ r� r, � set_break2 s
zParserElement.set_break)�fnsrU c O s^ t |�dgkrg | _nDtdd� |D ��s0td��t ttt |���| _|�d|�dd��| _| S )aQ
Define one or more actions to perform when successfully matching parse element definition.
Parse actions can be called to perform data conversions, do extra validation,
update external data structures, or enhance or replace the parsed tokens.
Each parse action ``fn`` is a callable method with 0-3 arguments, called as
``fn(s, loc, toks)`` , ``fn(loc, toks)`` , ``fn(toks)`` , or just ``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 :class:`ParseResults` object
The parsed tokens are passed to the parse action as ParseResults. They can be
modified in place using list-style append, extend, and pop operations to update
the parsed list elements; and with dictionary-style item set and del operations
to add, update, or remove any named results. If the tokens are modified in place,
it is not necessary to return them with a return statement.
Parse actions can also completely replace the given tokens, with another ``ParseResults``
object, or with some entirely different object (common for parse actions that perform data
conversions). A convenient way to build a new parse result is to define the values
using a dict, and then create the return value using :class:`ParseResults.from_dict`.
If None is passed as the ``fn`` parse action, all previously added parse actions for this
expression are cleared.
Optional keyword arguments:
- call_during_try = (default= ``False``) indicate if parse action should be run during
lookaheads and alternate testing. For parse actions that have side effects, it is
important to only call the parse action once it is determined that it is being
called as part of a successful parse. For parse actions that perform additional
validation, then call_during_try should be passed as True, so that the validation
code is included in the preliminary "try" parses.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See :class:`parse_string` for more
information on parsing strings containing ``<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::
# parse dates in the form YYYY/MM/DD
# use parse action to convert toks from str to int at parse time
def convert_to_int(toks):
return int(toks[0])
# use a parse action to verify that the date is a valid date
def is_valid_date(toks):
from datetime import date
year, month, day = toks[::2]
try:
date(year, month, day)
except ValueError:
raise ParseException("invalid date given")
integer = Word(nums)
date_str = integer + '/' + integer + '/' + integer
# add parse actions
integer.set_parse_action(convert_to_int)
date_str.set_parse_action(is_valid_date)
# note that integer fields are now ints, not strings
date_str.run_tests('''
# successful parse - note that integer fields were converted to ints
1999/12/31
# fail - invalid date
1999/13/31
''')
Nc s s | ]}t |�V qd S r; )�callable)r) r r+ r+ r, rb � r. z1ParserElement.set_parse_action.<locals>.<genexpr>z parse actions must be callable�call_during_tryr� F)r� r� �allrp �mapr~ �getr� �r� r� �kwargsr+ r+ r, �set_parse_actionI s M �z ParserElement.set_parse_actionc O s< | j tttt|���7 _ | jp4|�d|�dd��| _| S )z�
Add one or more parse actions to expression's list of parse actions. See :class:`set_parse_action`.
See examples in :class:`copy`.
r� r� F)r� r� r� r~ r� r� r� r+ r+ r, �add_parse_action� s
�z ParserElement.add_parse_actionc
O sN |D ](}| j �t||�d�|�dd�d�� q| jpF|�d|�dd��| _| S )a� Add a boolean predicate function to expression's list of parse actions. See
:class:`set_parse_action` for function call signatures. Unlike ``set_parse_action``,
functions passed to ``add_condition`` 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
- call_during_try = boolean to indicate if this method should be called during internal tryParse calls,
default=False
Example::
integer = Word(nums).set_parse_action(lambda toks: int(toks[0]))
year_int = integer.copy()
year_int.add_condition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
date_str = year_int + '/' + integer + '/' + integer
result = date_str.parse_string("1999/12/31") # -> Exception: Only support years 2000 and later (at char 0),
(line:1, col:1)
r� r� F)r� r� r� r� )r� r� r� r� r� )r� r� r� r r+ r+ r, �
add_condition� s ��
�zParserElement.add_condition)r rU c 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
``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 :class:`ParseFatalException`
if it is desired to stop parsing immediately.)r� )r� r r+ r+ r, �set_fail_action� s
z ParserElement.set_fail_actionc C sL d}|rHd}| j D ]2}z|�||�\}}d}qW q tyB Y q0 qq|S �NTF)r� r� r� )r� r� r� Z
exprsFound�eZdummyr+ r+ r, �_skipIgnorables� s
z ParserElement._skipIgnorablesc C sH | j r| �||�}| jrDt|�}| j}||k rD|| |v rD|d7 }q&|S �Nr )r� r� r� �lenr� )r� r� r� �instrlenZ white_charsr+ r+ r, �preParse� s
zParserElement.preParsec C s |g fS r; r+ �r� r� r� r� r+ r+ r, � parseImpl� s zParserElement.parseImplc C s |S r; r+ �r� r� r� � tokenlistr+ r+ r, � postParse� s zParserElement.postParsec C s� d\}}}| j }t|�} |s$| j�r"z�|r>| jr>| �||�}
n|}
|
} | j| rb| j| || | � | jsp|
| kr�z| �||
|�\}} W q� ty� t || | j
| ��Y q�0 n| �||
|�\}} W n^ t �y }
zD| j| r�| j| || | |
� | j�r| �|| | |
� � W Y d }
~
n
d }
~
0 0 n�|�r>| j�r>| �||�}
n|}
|
} | j�sX|
| k�r�z| �||
|�\}} W n$ t�y� t || | j
| ��Y n0 n| �||
|�\}} | � ||| �} t
| | j| j| jd�}| j�rT|�s�| j�rT|�r�z�| jD ]�}z||| |�} W n4 t�y8 } zt d�}||�W Y d }~n
d }~0 0 | d u�r�| |u�r�t
| | j| j�ojt| t
tf�| jd�}�q�W nH t �y� }
z.| j| �r�| j| || | |
� � W Y d }
~
n
d }
~
0 0 n�| jD ]�}z||| |�} W n4 t�y } zt d�}||�W Y d }~n
d }~0 0 | d u�r�| |u�r�t
| | j| j�oFt| t
tf�| jd�}�q�|�r|| j| �r|| j| || || |� ||fS )N�r r rJ )�asList�modalz exception raised in parse action)r� r� r� r� r� r� r� r� �
IndexErrorr� r� � Exceptionr� r r� r� r� r� r� �
isinstancer� )r� r� r� r� r� �TRY�MATCH�FAILZ debuggingZ len_instringZpre_locZ tokens_start�tokens�err�
ret_tokensr Zparse_action_excr� r+ r+ r, �
_parseNoCache s�
�
�
�
zParserElement._parseNoCache)r� r� � raise_fatalrU c C sD z| j ||dd�d W S ty> |r*� t||| j| ��Y n0 d S )NF�r� r )r� r� r� r� )r� r� r� r� r+ r+ r, � try_parse` s zParserElement.try_parse)r� r� rU c C s2 z| � ||� W n ttfy( Y dS 0 dS d S )NFT)r� r� r� )r� r� r� r+ r+ r, �can_parse_nexth s
z ParserElement.can_parse_next�Forward�recursion_memosr c C s( d\}}d\}}} | ||||f}
t j��� t j} | �|
�} | | ju r�t j| d7 < z| �||||�} W n: ty� }
z"| �|
|
j |
j
� � � W Y d }
~
n:d }
~
0 0 | �|
| d | d � � |f� | W d � S �n*t j| d7 < | j �r0| j
| �r0z| j
| ||| dd� W n t�y. Y n0 t| t��r�| j �r�| j
| �r�z | j
| ||| | dd� W n t�y� Y n0 | �| d | d � � | d }}}| j �r�| j
| �r�z | j
| |||| |dd� W n t�y� Y n0 ||fW d � S W d � n1 �s0 Y d S )N)r r r� r r T)r� rJ )r] �packrat_cache_lock�
packrat_cacher� Z not_in_cache�packrat_cache_statsr� �ParseBaseExceptionr� rx rr r� r� r� rp r� r� )r� r� r� r� r� ZHITZMISSr� r� r� �lookup�cache�value�peZloc_�resultr� r+ r+ r, � _parseCache sN
�
�
zParserElement._parseCachec C s2 t j�� dgtt j� t jd d �< t j�� d S r� )r] r �clearr� r r r+ r+ r+ r, � reset_cache� s
�zParserElement.reset_cachec C s t �� dt _dt _t jt _dS )a$
Disables active Packrat or Left Recursion parsing and their memoization
This method also works if neither Packrat nor Left Recursion are enabled.
This makes it safe to call before activating Packrat nor Left Recursion
to clear any previous settings.
FN)r] r �_left_recursion_enabled�_packratEnabledr� r� r+ r+ r+ r, �disable_memoization� s z!ParserElement.disable_memoization)�force)�cache_size_limitrU c C sZ |rt �� nt jr td��| du r.t� t _n"| dkrDt| d�t _n td| ��dt _dS )a#
Enables "bounded recursion" parsing, which allows for both direct and indirect
left-recursion. During parsing, left-recursive :class:`Forward` elements are
repeatedly matched with a fixed recursion depth that is gradually increased
until finding the longest match.
Example::
import pyparsing as pp
pp.ParserElement.enable_left_recursion()
E = pp.Forward("E")
num = pp.Word(pp.nums)
# match `num`, or `num '+' num`, or `num '+' num '+' num`, ...
E <<= E + '+' - num | num
print(E.parse_string("1+2+3"))
Recursion search naturally memoizes matches of ``Forward`` elements and may
thus skip reevaluation of parse actions during backtracking. This may break
programs with parse actions which rely on strict ordering of side-effects.
Parameters:
- cache_size_limit - (default=``None``) - memoize at most this many
``Forward`` elements during matching; if ``None`` (the default),
memoize all ``Forward`` elements.
Bounded Recursion parsing works similar but not identical to Packrat parsing,
thus the two cannot be used together. Use ``force=True`` to disable any
previous, conflicting settings.
�0Packrat and Bounded Recursion are not compatibleNr )ZcapacityzMemo size of %sT) r] r r � RuntimeError�_UnboundedMemor �_LRUMemo�NotImplementedErrorr �r r r+ r+ r, �enable_left_recursion� s $
z#ParserElement.enable_left_recursion� )r r rU c C sP |rt �� nt jr td��t jsLdt _| du r:t� t _n
t| �t _t jt _ dS )af
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= ``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 :class:`ParserElement.enable_packrat`.
For best results, call ``enable_packrat()`` immediately after
importing pyparsing.
Example::
import pyparsing
pyparsing.ParserElement.enable_packrat()
Packrat parsing works similar but not identical to Bounded Recursion parsing,
thus the two cannot be used together. Use ``force=True`` to disable any
previous, conflicting settings.
r TN)
r] r r r r r r r r r� r r+ r+ r, �enable_packrat� s
z ParserElement.enable_packrat)�parseAll)r� � parse_allr rU c
C s� |p|}t �� | js | �� | jD ] }|�� q$| js@|�� }z<| �|d�\}}|rz| �||�}t � t
� }|�||� W n8 t y� } z t j r�� n
|�
d��W Y d}~nd}~0 0 |S dS )a6
Parse a string with respect to the parser definition. This function is intended as the primary interface to the
client code.
:param instring: The input string to be parsed.
:param parse_all: If set, the entire input string must match the grammar.
:param parseAll: retained for pre-PEP8 compatibility, will be removed in a future release.
:raises ParseException: Raised if ``parse_all`` is set and the input string does not match the whole grammar.
:returns: the parsed data as a :class:`ParseResults` object, which may be accessed as a `list`, a `dict`, or
an object with attributes if the given parser includes results names.
If the input string is required to match the entire grammar, ``parse_all`` flag must be set to ``True``. This
is also equivalent to ending the grammar with :class:`StringEnd`().
To report proper column numbers, ``parse_string`` operates on a copy of the input string where all tabs are
converted to spaces (8 spaces per tab, as per the default in ``string.expandtabs``). If the input string
contains tabs and the grammar uses parse actions that use the ``loc`` argument to index into the string
being parsed, one can ensure a consistent view of the input string by doing one of the following:
- calling ``parse_with_tabs`` on your grammar before calling ``parse_string`` (see :class:`parse_with_tabs`),
- define your parse action using the full ``(s,loc,toks)`` signature, and reference the input string using the
parse action's ``s`` argument, or
- explicitly expand the tabs in your input string before calling ``parse_string``.
Examples:
By default, partial matches are OK.
>>> res = Word('a').parse_string('aaaaabaaa')
>>> print(res)
['aaaaa']
The parsing behavior varies by the inheriting class of this abstract class. Please refer to the children
directly to see more examples.
It raises an exception if parse_all flag is set and instring does not match the whole grammar.
>>> res = Word('a').parse_string('aaaaabaaa', parse_all=True)
Traceback (most recent call last):
...
pyparsing.ParseException: Expected end of text, found 'b' (at char 5), (line:1, col:6)
r N)r] r r� �
streamliner� r� �
expandtabsr� r� �Empty� StringEndr r� �with_traceback) r� r� r r r� r� r� Zser� r+ r+ r, � parse_string& s& -
zParserElement.parse_string)r� �
maxMatches)r� � max_matches�overlapr� r% rU c
c sh t ||�}| js| �� | jD ] }|�� q | js>t|��� }t|�}d}| j} | j }
t
� � d} z�||k�r$| |k �r$z | ||�} |
|| dd�\}
}W n t y� | d }Y qd0 |
|k�r| d7 } |r�t
|�� | |
d�� || |
fV |�r| ||�}||k�r
|
}n|d7 }n|
}qd| d }qdW n< t�yb } z"t
j�rD� n
|�d��W Y d}~n
d}~0 0 dS )at
Scan the input string for expression matches. Each match will return the
matching tokens, start location, and end location. May be called with optional
``max_matches`` argument, to clip scanning after 'n' matches are found. If
``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 :class:`parse_string` for more information on parsing
strings with embedded tabs.
Example::
source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
print(source)
for tokens, start, end in Word(alphas).scan_string(source):
print(' '*start + '^'*(end-start))
print(' '*start + tokens[0])
prints::
sldjf123lsdjjkf345sldkjf879lkjsfd987
^^^^^
sldjf
^^^^^^^
lsdjjkf
^^^^^^
sldkjf
^^^^^^
lkjsfd
r F�r� r )r� �start�endN)�minr� r r� r� �strr r� r� r� r] �
resetCacher� r� r� r r� r# )r� r� r& r' r� r% r� r� r� Z
preparseFnZparseFn�matches�prelocZnextLocr� Znextlocr� r+ r+ r, � scan_stringk sR '
��
zParserElement.scan_string�r� )r� r� rU c
C s� g }d}d| _ z�| j||d�D ]h\}}}|�|||� � |r�t|t�rV||�� 7 }n,t|t�rxt|t�sx|t|�7 }n
|�|� |}q |�||d� � dd� |D �}d� t
t t |���W S t
y� } z tjrւ n
|�d��W Y d}~n
d}~0 0 dS )ab
Extension to :class:`scan_string`, to modify matching text with modified tokens that may
be returned from a parse action. To use ``transform_string``, define a grammar and
attach a parse action to it that modifies the returned token list.
Invoking ``transform_string()`` on a target string will then scan for matches,
and replace the matched text patterns according to the logic in the parse
action. ``transform_string()`` returns the resulting transformed string.
Example::
wd = Word(alphas)
wd.set_parse_action(lambda toks: toks[0].title())
print(wd.transform_string("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 Tr1 Nc S s g | ] }|r|�qS r+ r+ �r) �or+ r+ r, r- � r. z2ParserElement.transform_string.<locals>.<listcomp>rY )r� r0 r� r� r r� r r" r� �joinr� r, r r r] r� r# ) r� r� r� �outZlastErf rd r� r� r+ r+ r, �transform_string� s(
z ParserElement.transform_string)r� r& r� r% rU c
C sh t ||�}z tdd� | j|||d�D ��W S tyb } z tjrD� n
|�d��W Y d}~n
d}~0 0 dS )a�
Another extension to :class:`scan_string`, simplifying the access to the tokens found
to match the given parse expression. May be called with optional
``max_matches`` 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.search_string("More than Iron, more than Lead, more than Gold I need Electricity"))
# the sum() builtin can be used to merge results into a single ParseResults object
print(sum(cap_word.search_string("More than Iron, more than Lead, more than Gold I need Electricity")))
prints::
[['More'], ['Iron'], ['Lead'], ['Gold'], ['I'], ['Electricity']]
['More', 'Iron', 'Lead', 'Gold', 'I', 'Electricity']
c S s g | ]\}}}|�qS r+ r+ )r) rf rd r� r+ r+ r, r- r. z/ParserElement.search_string.<locals>.<listcomp>r1 N)r+ r r0 r r] r� r# )r� r� r& r� r% r� r+ r+ r, �
search_string� s
�zParserElement.search_string)�includeSeparators)r� �maxsplit�include_separatorsrU c c sX |p|}d}| j ||d�D ]*\}}}|||� V |r@|d V |}q||d� V dS )aT
Generator method to split a string using the given expression as a separator.
May be called with optional ``maxsplit`` argument, to limit the number of splits;
and the optional ``include_separators`` argument (default= ``False``), if the separating
matching text should be included in the split results.
Example::
punc = one_of(list(".,;:/-!?"))
print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
prints::
['This', ' this', '', ' this sentence', ' is badly punctuated', '']
r )r& N)r0 ) r� r� r9 r: r8 Zlastrf rd r� r+ r+ r, r6 s
zParserElement.splitc C sN |t u rt| �S t|t�r$| �|�}t|t�sBtd�t|�j ���t
| |g�S )ah
Implementation of ``+`` operator - returns :class:`And`. Adding strings to a :class:`ParserElement`
converts them to :class:`Literal`s by default.
Example::
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print(hello, "->", greet.parse_string(hello))
prints::
Hello, World! -> ['Hello', ',', 'World', '!']
``...`` may be used as a parse expression as a short form of :class:`SkipTo`.
Literal('start') + ... + Literal('end')
is equivalent to:
Literal('start') + SkipTo('end')("_skipped*") + Literal('end')
Note that the skipped text is returned with '_skipped' as a results name,
and to support having multiple skips in the same parser, the value returned is
a list of all skipped text.
�4Cannot combine element of type {} with ParserElement) �Ellipsis� _PendingSkipr� r" r� r] rp r� r� r/ �And�r� �otherr+ r+ r, �__add__: s
��zParserElement.__add__c C sR |t u rt| �d�| S t|t�r,| �|�}t|t�sJtd�t|�j ���|| S )zd
Implementation of ``+`` operator when left operand is not a :class:`ParserElement`
� _skipped*r; )
r< �SkipTor� r" r� r] rp r� r� r/ r? r+ r+ r, �__radd__b s
��zParserElement.__radd__c C sB t |t�r| �|�}t |t�s2td�t|�j���| t� � | S )zX
Implementation of ``-`` operator, returns :class:`And` with error stop
r; )
r� r" r� r] rp r� r� r/ r> �
_ErrorStopr? r+ r+ r, �__sub__s s
��zParserElement.__sub__c C s: t |t�r| �|�}t |t�s2td�t|�j���|| S )zd
Implementation of ``-`` operator when left operand is not a :class:`ParserElement`
r; �r� r" r� r] rp r� r� r/ r? r+ r+ r, �__rsub__� s
��zParserElement.__rsub__c s$ |t u rd}n8t|t�rF|dd� t fkrFd|dd� d dd� }t|t�r^|d }}�nt|t��rRtdd � |D ��}|d
dd� }|d du r�d|d f}t|d t��r |d du �r |d dkr�t��S |d dkr�t��S �|d t�� S nPt|d t��r2t|d t��r2|\}}||8 }n td �d �d
d � |D �����ntd�t |�j
���|dk �rxt d��|dk �r�t d��|| k�r�dk�r�n nt g �S |�r� �fdd�� |�r�|dk�r�� |� }nt �g| �� |� }n� |�}n |dk�r�}nt �g| �}|S )a�
Implementation of ``*`` operator, allows use of ``expr * 3`` in place of
``expr + expr + expr``. Expressions may also be multiplied by a 2-integer
tuple, similar to ``{min, max}`` multipliers in regular expressions. Tuples
may also include ``None`` as in:
- ``expr*(n, None)`` or ``expr*(n, )`` is equivalent
to ``expr*n + ZeroOrMore(expr)``
(read as "at least n instances of ``expr``")
- ``expr*(None, n)`` is equivalent to ``expr*(0, n)``
(read as "0 to n instances of ``expr``")
- ``expr*(None, None)`` is equivalent to ``ZeroOrMore(expr)``
- ``expr*(1, None)`` is equivalent to ``OneOrMore(expr)``
Note that ``expr*(None, n)`` does not raise an exception if
more than n exprs exist in the input stream; that is,
``expr*(None, n)`` does not enforce a maximum number of expr
occurrences. If this behavior is desired, then write
``expr*(None, n) + ~expr``
)r NNr )r r; rJ r c s s | ]}|t ur|nd V qd S r; )r< r2 r+ r+ r, rb � r. z(ParserElement.__mul__.<locals>.<genexpr>)NNz.cannot multiply ParserElement and ({}) objects�,c s s | ]}t |�jV qd S r; �r� r/ )r) �itemr+ r+ r, rb � r. z,cannot multiply ParserElement and {} objectsz/cannot multiply ParserElement by negative valuez@second tuple value must be greater or equal to first tuple valuec s( | dkr t �� | d � �S t ��S d S r� )�Opt)�n��makeOptionalListr� r+ r, rO � s z/ParserElement.__mul__.<locals>.makeOptionalList)
r< r� �tuple�int�
ZeroOrMore� OneOrMorerp r� r4 r� r/ �
ValueErrorr> )r� r@ Z minElementsZ optElementsrs r+ rN r, �__mul__� sb
����
�
zParserElement.__mul__c C s
| � |�S r; )rU r? r+ r+ r, �__rmul__� s zParserElement.__rmul__c C sR |t u rt| dd�S t|t�r(| �|�}t|t�sFtd�t|�j ���t
| |g�S )zP
Implementation of ``|`` operator - returns :class:`MatchFirst`
T)� must_skipr; ) r< r= r� r" r� r] rp r� r� r/ �
MatchFirstr? r+ r+ r, �__or__� s
��zParserElement.__or__c C s: t |t�r| �|�}t |t�s2td�t|�j���|| B S )zd
Implementation of ``|`` operator when left operand is not a :class:`ParserElement`
r; rG r? r+ r+ r, �__ror__� s
��zParserElement.__ror__c C s> t |t�r| �|�}t |t�s2td�t|�j���t| |g�S )zH
Implementation of ``^`` operator - returns :class:`Or`
r; ) r� r" r� r] rp r� r� r/ �Orr? r+ r+ r, �__xor__ s
��zParserElement.__xor__c C s: t |t�r| �|�}t |t�s2td�t|�j���|| A S )zd
Implementation of ``^`` operator when left operand is not a :class:`ParserElement`
r; rG r? r+ r+ r, �__rxor__ s
��zParserElement.__rxor__c C s> t |t�r| �|�}t |t�s2td�t|�j���t| |g�S )zJ
Implementation of ``&`` operator - returns :class:`Each`
r; ) r� r" r� r] rp r� r� r/ �Eachr? r+ r+ r, �__and__# s
��zParserElement.__and__c C s: t |t�r| �|�}t |t�s2td�t|�j���|| @ S )zd
Implementation of ``&`` operator when left operand is not a :class:`ParserElement`
r; rG r? r+ r+ r, �__rand__1 s
��zParserElement.__rand__c C s t | �S )zL
Implementation of ``~`` operator - returns :class:`NotAny`
)�NotAny�r� r+ r+ r, �
__invert__? s zParserElement.__invert__c C s� z t |t�r|f}t|� W n ty6 ||f}Y n0 t|�dkrvtd�|dd� t|�dkrnd�t|��nd���| t|dd� � }|S )a{
use ``[]`` indexing notation as a short form for expression repetition:
- ``expr[n]`` is equivalent to ``expr*n``
- ``expr[m, n]`` is equivalent to ``expr*(m, n)``
- ``expr[n, ...]`` or ``expr[n,]`` is equivalent
to ``expr*n + ZeroOrMore(expr)``
(read as "at least n instances of ``expr``")
- ``expr[..., n]`` is equivalent to ``expr*(0, n)``
(read as "0 to n instances of ``expr``")
- ``expr[...]`` and ``expr[0, ...]`` are equivalent to ``ZeroOrMore(expr)``
- ``expr[1, ...]`` is equivalent to ``OneOrMore(expr)``
``None`` may be used in place of ``...``.
Note that ``expr[..., n]`` and ``expr[m, n]``do not raise an exception
if more than ``n`` ``expr``s exist in the input stream. If this behavior is
desired, then write ``expr[..., n] + ~expr``.
rJ z,only 1 or 2 index arguments supported ({}{})NrM z... [{}]rY )r� r" �iterrp r� r� rP )r� �keyrs r+ r+ r, � __getitem__I s
&��zParserElement.__getitem__�r: c C s |dur| � |�S | �� S dS )a
Shortcut for :class:`set_results_name`, with ``list_all_matches=False``.
If ``name`` is given with a trailing ``'*'`` character, then ``list_all_matches`` will be
passed as ``True``.
If ``name` is omitted, same as calling :class:`copy`.
Example::
# these are equivalent
userdata = Word(alphas).set_results_name("name") + Word(nums + "-").set_results_name("socsecno")
userdata = Word(alphas)("name") + Word(nums + "-")("socsecno")
N)r� r� �r� r: r+ r+ r, �__call__q s
zParserElement.__call__c C s t | �S )z�
Suppresses the output of this :class:`ParserElement`; useful to keep punctuation from
cluttering up returned output.
)�Suppressrb r+ r+ r, �suppress� s zParserElement.suppress)� recursiverU c C s
d| _ | S )z�
Enables the skipping of whitespace before matching the characters in the
:class:`ParserElement`'s defined pattern.
:param recursive: If ``True`` (the default), also enable whitespace skipping in child elements (if any)
T�r� �r� rl r+ r+ r, �ignore_whitespace� s z ParserElement.ignore_whitespacec C s
d| _ | S )a|
Disables the skipping of whitespace before matching the characters in the
:class:`ParserElement`'s defined pattern. This is normally only used internally by
the pyparsing module, but may be needed in some whitespace-sensitive grammars.
:param recursive: If true (the default), also disable whitespace skipping in child elements (if any)
Frm rn r+ r+ r, �leave_whitespace� s z ParserElement.leave_whitespace)r� �
copy_defaultsrU c C s d| _ t|�| _|| _| S )z8
Overrides the default whitespace chars
T)r� r� r� r� )r� r� rq r+ r+ r, �set_whitespace_chars� s
z"ParserElement.set_whitespace_charsc C s
d| _ | S )z�
Overrides default behavior to expand ``<TAB>`` s to spaces before parsing the input string.
Must be called before ``parse_string`` when the input grammar contains elements that
match ``<TAB>`` characters.
T)r� rb r+ r+ r, �parse_with_tabs� s z ParserElement.parse_with_tabs)r@ rU c C sT ddl }t|t�rt|�}t|t�r<|| jvrP| j�|� n| j�t|�� �� | 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.parse_string('ablaj /* comment */ lskjd')
# -> ['ablaj']
patt.ignore(c_style_comment)
patt.parse_string('ablaj /* comment */ lskjd')
# -> ['ablaj', 'lskjd']
r N)�typingr� r" rj r� r� r� )r� r@ rt r+ r+ r, �ignore� s
zParserElement.ignore)� start_action�success_action�exception_actionrU c C s" |pt |p t|ptf| _d| _| S )a
Customize display of debugging messages while doing pattern matching:
- ``start_action`` - method to be called when an expression is about to be parsed;
should have the signature ``fn(input_string: str, location: int, expression: ParserElement, cache_hit: bool)``
- ``success_action`` - method to be called when an expression has successfully parsed;
should have the signature ``fn(input_string: str, start_location: int, end_location: int, expression: ParserELement, parsed_tokens: ParseResults, cache_hit: bool)``
- ``exception_action`` - method to be called when expression fails to parse;
should have the signature ``fn(input_string: str, location: int, expression: ParserElement, exception: Exception, cache_hit: bool)``
T)r� r� r� r� r� )r� rv rw rx r+ r+ r, �set_debug_actions� s �z ParserElement.set_debug_actionsc C s |r| � ttt� nd| _| S )a�
Enable display of debugging messages while doing pattern matching.
Set ``flag`` to ``True`` to enable, ``False`` to disable.
Example::
wd = Word(alphas).set_name("alphaword")
integer = Word(nums).set_name("numword")
term = wd | integer
# turn on debugging for wd
wd.set_debug()
OneOrMore(term).parse_string("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 :class:`set_debug_actions`. Prior to attempting
to match the ``wd`` expression, the debugging message ``"Match <exprname> at loc <n>(<line>,<col>)"``
is shown. Then if the parse succeeds, a ``"Matched"`` message is shown, or an ``"Exception raised"``
message is shown. Also note the use of :class:`set_name` 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 :class:`Word` expression without calling ``set_name`` is ``"W:(A-Za-z)"``.
F)ry r� r� r� r� )r� �flagr+ r+ r, � set_debug� s %�zParserElement.set_debugc C s | j d u r| �� | _ | j S r; )r� �_generateDefaultNamerb r+ r+ r, � default_name s
zParserElement.default_namec C s dS )zg
Child classes must define this method, which defines how the ``default_name`` is set.
Nr+ rb r+ r+ r, r| s z"ParserElement._generateDefaultName)r: rU c C s$ || _ d| j | _tjr | �� | S )a\
Define name for this expression, makes debugging and exception messages clearer.
Example::
Word(nums).parse_string("ABC") # -> Exception: Expected W:(0-9) (at char 0), (line:1, col:1)
Word(nums).set_name("integer").parse_string("ABC") # -> Exception: Expected integer (at char 0), (line:1, col:1)
� Expected )r� r: r� r7 rG r{ rh r+ r+ r, �set_name& s
zParserElement.set_namec C s | j d ur| j S | jS r; )r� r} rb r+ r+ r, r: 3 s zParserElement.namec C s | j S r; rg rb r+ r+ r, �__str__8 s zParserElement.__str__c C s t | �S r; �r, rb r+ r+ r, �__repr__; s zParserElement.__repr__c C s d| _ d | _| S �NT)r� r� rb r+ r+ r, r > s zParserElement.streamlinec C s g S r; r+ rb r+ r+ r, �recurseC s zParserElement.recursec C s. |d d � | g }| � � D ]}|�|� qd S r; )r� �_checkRecursion�r� �parseElementList�subRecCheckListr� r+ r+ r, r� F s z ParserElement._checkRecursionc C s | � g � dS )zj
Check defined expressions for valid structure, check for infinite recursive definitions.
N)r� )r� �
validateTracer+ r+ r, �validateK s zParserElement.validate�utf-8)�file_or_filename�encodingr r rU c C s� |p|}z |� � }W nH ty\ t|d|d��}|� � }W d � n1 sN0 Y Y n0 z| �||�W S ty� } z tjr�� n
|�d��W Y d}~n
d}~0 0 dS )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.
�r�r� N)�read�AttributeError�openr$ r r] r� r# )r� r� r� r r Z
file_contents�fr� r+ r+ r, �
parse_fileQ s
,zParserElement.parse_filec C sB | |u r dS t |t�r$| j|dd�S t |t�r>t| �t|�kS dS )NT�r F)r� r" r. r] �varsr? r+ r+ r, �__eq__m s
zParserElement.__eq__c C s t | �S r; )�idrb r+ r+ r, �__hash__v s zParserElement.__hash__)� test_stringr r rU c C s: |o|}z| j t|�|d� W dS ty4 Y dS 0 dS )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:
- ``test_string`` - to test against this expression for a match
- ``parse_all`` - (default= ``True``) - flag to pass to :class:`parse_string` when running tests
Example::
expr = Word(nums)
assert expr.matches("100")
r� TFN)r$ r, r )r� r� r r r+ r+ r, r. y s zParserElement.matches�#)r �fullDump� printResults� failureTestsr� )�testsr �comment� full_dump�
print_results�
failure_tests�
post_parse�file�with_line_numbersr r� r� r� r� c
C s( ddl m} |
o|}
| o|} | o"|} |
p*|}
|p2|}t|t�rZttt|�j|�� � � ��}t|t�rlt
|�}|du rzt j }|j
}g }g }d}t
d��td���t�}d}|D �]p}|dur�|�|d�s�|r�|s�|�|�|�� q�|s�q�|r�dd�|� nd | �r
|�|�n|g}g }z"|�|�|��}| j||
d
�}W n� t�y� } zjt|t��rXd nd }|�|�� � |�d t |� � t j �r�|� t �!|j"�� |�o�|
}|}W Y d}~�n@d}~0 t#�y } zL|�d
�$t|�j%|�� t j �r�|� t �!|j"�� |�o|
}|}W Y d}~n�d}~0 0 |�o*|
}|du�r�zR|||�} | du�rxt| t&��rh|�| �'� � n|�t | �� n|�|�'� � W nT t#�y� } z:|�|j'| d�� |�d�$|j%t| �j%| �� W Y d} ~ n
d} ~ 0 0 n|�|j'| d�� |�d � | �r|d�|�� |�||f� q�||fS )a�
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
- ``parse_all`` - (default= ``True``) - flag to pass to :class:`parse_string` when running tests
- ``comment`` - (default= ``'#'``) - expression for indicating embedded comments in the test
string; pass None to disable comment filtering
- ``full_dump`` - (default= ``True``) - dump results as list followed by results names in nested outline;
if False, only dump nested list
- ``print_results`` - (default= ``True``) prints test output to stdout
- ``failure_tests`` - (default= ``False``) indicates if these tests are expected to fail parsing
- ``post_parse`` - (default= ``None``) optional callback for successful parse results; called as
`fn(test_string, parse_results)` and returns a string to be added to the test output
- ``file`` - (default= ``None``) optional file-like object to which test output will be written;
if None, will default to ``sys.stdout``
- ``with_line_numbers`` - default= ``False``) show test strings with line and column numbers
Returns: a (success, results) tuple, where success indicates that all tests succeeded
(or failed if ``failure_tests`` 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.run_tests('''
# 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.run_tests('''
# stray character
100Z
# missing leading digit before '.'
-.100
# too many '.'
3.14.159
''', failure_tests=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.run_tests(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'``.)
r )�pyparsing_testNT�\n�
u FrY r� z(FATAL)zFAIL: zFAIL-EXCEPTION: {}: {})Zfullz{} failed: {}: {})(Ztestingr� r� r" r� r� r� �strip�rstrip�
splitlines�Literal�sys�stdout�writer� Z replace_withru �
quoted_stringr. r� r� r4 r6 �lstripr$ r r� Zexplainr, r] r� �extendrl � format_tbrq r� r� r/ r �dump) r� r� r r� r� r� r� r� r� r� r r� r� r� r� r� �print_Z
allResultsZcomments�success�NL�BOMrf r5 r r
r� r� Zpp_valuer� r+ r+ r, � run_tests� s� p
�
��
zParserElement.run_testsrK )� output_html�vertical�show_results_namesrU c
K s� zddl m}m} W n. tyB } ztd�|�W Y d}~n
d}~0 0 | �� || |||d�}t|ttf�r�t |ddd�� } | �
||�� W d � q�1 s�0 Y n|�
||�� dS ) a
Create a railroad diagram for the parser.
Parameters:
- output_html (str or file-like object) - output target for generated
diagram HTML
- vertical (int) - threshold for formatting multiple alternatives vertically
instead of horizontally (default=3)
- show_results_names - bool flag whether diagram should show annotations for
defined results names
Additional diagram-formatting keyword arguments can also be included;
see railroad.Diagram class.
r )� to_railroad�railroad_to_htmlzMmust ``pip install pyparsing[diagrams]`` to generate parser railroad diagramsN)r� r� Zdiagram_kwargs�wr� r� ) Zdiagramr� r� � ImportErrorr� r r� r, r r� r� )
r� r� r� r� r� r� r� ZieZrailroadZ diag_filer+ r+ r, �create_diagramP s& ���.z ParserElement.create_diagram)F)F)F)T)T)TT)F)TT)N)r )F)N)T)T)F)T)N)r� F)T)Tr� TTFNNF)rK F)�r/ r0 r1 r2 r� r, �__annotations__r� rZ r� � OptionalTyper� � staticmethodr� r� r� rI r� r� r� r� r� � ParseActionr� r� �ParseConditionr� �ParseFailActionr� r� r� r� r� r rQ r r� r� r r �recursion_lockr �DictTyper r� r r r r r� r r r r r r r$ �_MAX_INTr r0 r6 r7 r6 rA rD rF rH rU rV rY rZ r\ r] r_ r` rc �__iter__rf ri rk ro rp r rr rs ru �DebugStartAction�DebugSuccessAction�DebugExceptionActionry r{ �propertyr} r r| r r: r� r� r r� r� r� r r
r� r� r� r. r r r� r� ZsetDefaultWhitespaceCharsZinlineLiteralsUsingZsetResultsNameZsetBreakZsetParseActionZaddParseActionZ addConditionZ
setFailAction�tryParse� canParseNextr- ZenableLeftRecursionZ
enablePackratZ parseStringZ
scanStringZ searchStringZtransformStringZsetWhitespaceCharsZ
parseWithTabsZsetDebugActionsZsetDebug� defaultName�setNameZ parseFileZrunTests�ignoreWhitespace�leaveWhitespacer+ r+ r+ r, r] � s�
! ��� !
� X #
�
� ` � �� �
� 0
���/ , ��� H��� Y1��� +�� � (V(
�� � /
�� � ��� � �� D � � ,c sF e Zd Zd
eed�� fdd�
Zdd� Zdd� Zd d
� Zd d � Z � Z
S )r= F)r� rW c s t � �� || _|| _d S r; )�superr� �anchorrW )r� r� rW �rx r+ r, r� � s
z_PendingSkip.__init__c C s t | jt� ��dd�S )Nr! �...)r, r� r! �replacerb r+ r+ r, r| � s z!_PendingSkip._generateDefaultNamec s\ t |��d�d�}� jrNdd� }� fdd�}� j|� �|� |� �|�B | S � j| | S )Nr� rB c S s, | j r| j �� dgkr(| d= | �dd � d S )NrY r �_skipped)r� r� �pop�rf r+ r+ r, rW � s z'_PendingSkip.__add__.<locals>.must_skipc s< | j �� dd � dgkr8| �d� dt� j� d | d< d S )Nrk rY r� z missing <�>)r� r� r� �reprr� r� rb r+ r, � show_skip� s
z'_PendingSkip.__add__.<locals>.show_skip)rC r rW r� r� )r� r@ �skipperrW r� r+ rb r, rA � s
��z_PendingSkip.__add__c C s | j S r; )r� rb r+ r+ r, r� � s z_PendingSkip.__repr__c G s t d��d S )NzBuse of `...` expression without following SkipTo target expression)r� )r� rr r+ r+ r, r� � s �z_PendingSkip.parseImpl)F) r/ r0 r1 r] rZ r� r| rA r� r� �
__classcell__r+ r+ r� r, r= � s
r= c s( e Zd ZdZ� fdd�Zdd� Z� ZS )�TokenzYAbstract :class:`ParserElement` subclass, for defining atomic
matching patterns.
c s t � jdd� d S )NFr� �r� r� rb r� r+ r, r� � s zToken.__init__c C s
t | �jS r; rJ rb r+ r+ r, r| � s zToken._generateDefaultName)r/ r0 r1 r2 r� r| r� r+ r+ r� r, r� � s r� c s e Zd ZdZ� fdd�Z� ZS )r! z,
An empty token, will always match.
c s t � �� d| _d| _d S r� �r� r� r� r� rb r� r+ r, r� � s
zEmpty.__init__)r/ r0 r1 r2 r� r� r+ r+ r� r, r! � s r! c s* e Zd ZdZ� fdd�Zddd�Z� ZS )�NoMatchz(
A token that will never match.
c s t � �� d| _d| _d| _d S )NTFzUnmatchable token)r� r� r� r� r� rb r� r+ r, r� � s
zNoMatch.__init__Tc C s t ||| j| ��d S r; )r� r� r� r+ r+ r, r� � s zNoMatch.parseImpl)T�r/ r0 r1 r2 r� r� r� r+ r+ r� r, r� � s r� c sB e Zd ZdZd dd�eed�� fdd�Zdd� Zd
d
d �Z� ZS )r� a�
Token to exactly match a specified string.
Example::
Literal('blah').parse_string('blah') # -> ['blah']
Literal('blah').parse_string('blahfooblah') # -> ['blah']
Literal('blah').parse_string('bla') # -> Exception: Expected "blah"
For case-insensitive matching, use :class:`CaselessLiteral`.
For keyword matching (force word break before and after the matched string),
use :class:`Keyword` or :class:`CaselessKeyword`.
rY �� matchString�� match_stringr� c s� t � �� |p|}|| _t|�| _z|d | _W n tyJ td��Y n0 d| j | _ d| _
d| _ | jdkr�t | �t
u r�t| _d S )Nr z2null string passed to Literal; use Empty() insteadr~ Fr )r� r� �matchr� �matchLen�firstMatchCharr� rT r: r� r� r� r� r� �_SingleCharLiteralrx �r� r� r� r� r+ r, r� � s
zLiteral.__init__c C s
t | j�S r; �r� r� rb r+ r+ r, r|
s z Literal._generateDefaultNameTc C s@ || | j kr,|�| j|�r,|| j | jfS t||| j| ��d S r; )r� r' r� r� r� r� r� r+ r+ r, r�
s
�zLiteral.parseImpl)rY )T) r/ r0 r1 r2 r, r� r| r� r� r+ r+ r� r, r� � s r� c @ s e Zd Zddd�ZdS )r� Tc C s0 || | j kr |d | jfS t||| j| ��d S r� )r� r� r� r� r� r+ r+ r, r� s z _SingleCharLiteral.parseImplN)T�r/ r0 r1 r� r+ r+ r+ r, r� s r� c sj e Zd ZdZed Zdddd�eee eeee d�� fdd �Z d
d � Z
dd
d�Z e dd� �Z
e
Z� ZS )�Keyworda�
Token to exactly match a specified string as a keyword, that is,
it must be immediately followed by a non-keyword character. Compare
with :class:`Literal`:
- ``Literal("if")`` will match the leading ``'if'`` in
``'ifAndOnlyIf'``.
- ``Keyword("if")`` will not; it will only match the leading
``'if'`` in ``'if x=1'``, or ``'if(y==2)'``
Accepts two optional constructor arguments in addition to the
keyword string:
- ``identChars`` is a string of characters that would be valid
identifier characters, defaulting to all alphanumerics + "_" and
"$"
- ``caseless`` allows case-insensitive matching, default is ``False``.
Example::
Keyword("start").parse_string("start") # -> ['start']
Keyword("start").parse_string("starting") # -> Exception
For case-insensitive matching, use :class:`CaselessKeyword`.
z_$rY NF�r� �
identChars)r� � ident_chars�caselessr� r� c s� t � �� |p|}|d u r tj}|p&|}|| _t|�| _z|d | _W n ty` t d��Y n0 d�
t | �j | j
�| _d| _d| _|| _|r�|�� | _|�� }t|�| _d S )Nr z2null string passed to Keyword; use Empty() insteadzExpected {} {}F)r� r� r� �DEFAULT_KEYWORD_CHARSr� r� r� r� r� rT r� r� r/ r: r� r� r� r� �upper�
caselessmatchr� r� )r� r� r� r� r� r� r� r+ r, r� < s&
zKeyword.__init__c C s
t | j�S r; r� rb r+ r+ r, r| Y s z Keyword._generateDefaultNameTc C s^ | j }|}| jr�|||| j � �� | jkr�|dksJ||d �� | jvr�|t|�| j kst||| j �� | jvr�|| j | jfS |d7 }|| j }n|d7 }|d }n�|| | jkr�| jdks�|� | j|��rL|dks�||d | jv�r<|t|�| j k�s||| j | jv�r(|| j | jfS |d7 }|| j }n|d7 }|d }t
|||| ��d S )Nr r z/, was immediately followed by keyword characterz7, keyword was immediately preceded by keyword characterz7, keyword was immediately followed by keyword character) r� r� r� r� r� r� r� r� r� r' r� )r� r� r� r� r� Zerrlocr+ r+ r, r� \ sB ��
�� � ��� zKeyword.parseImplc C s
| t _dS )zX
Overrides the default characters used by :class:`Keyword` expressions.
N)r� r� r� r+ r+ r, �set_default_keyword_chars� s z!Keyword.set_default_keyword_chars)rY NF)T)r/ r0 r1 r2 � alphanumsr� r, r� rZ r� r| r� r� r� ZsetDefaultKeywordCharsr� r+ r+ r� r, r� s( ���
/
r� c s: e Zd ZdZd
dd�eed�� fdd�Zd dd �Z� ZS ) �CaselessLiteralat
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")).parse_string("cmd CMD Cmd10")
# -> ['CMD', 'CMD', 'CMD']
(Contrast with example for :class:`CaselessKeyword`.)
rY r� r� c s. |p|}t � �|�� � || _d| j | _d S )Nr~ )r� r� r� � returnStringr: r� r� r� r+ r, r� � s zCaselessLiteral.__init__Tc C s@ |||| j � �� | jkr,|| j | jfS t||| j| ��d S r; )r� r� r� r� r� r� r� r+ r+ r, r� � s zCaselessLiteral.parseImpl)rY )T)r/ r0 r1 r2 r, r� r� r� r+ r+ r� r, r� � s
r� c s> e Zd ZdZdddd�eee eee d�� fdd�Z� ZS ) �CaselessKeywordz�
Caseless version of :class:`Keyword`.
Example::
OneOrMore(CaselessKeyword("CMD")).parse_string("cmd CMD Cmd10")
# -> ['CMD', 'CMD']
(Contrast with example for :class:`CaselessLiteral`.)
rY Nr� )r� r� r� r� c s& |p|}|p|}t � j||dd� d S )NT)r� r� )r� r� r� r� r� r� r+ r, r� � s zCaselessKeyword.__init__)rY N)r/ r0 r1 r2 r, r� r� r� r+ r+ r� r, r � s
���r c sF e Zd ZdZdddd�eeed�� fdd�Zd d
� Zdd d
�Z� Z S )�
CloseMatcha� A variation on :class:`Literal` which matches "close" matches,
that is, strings with at most 'n' mismatching characters.
:class:`CloseMatch` takes parameters:
- ``match_string`` - string to be matched
- ``caseless`` - a boolean indicating whether to ignore casing when comparing characters
- ``max_mismatches`` - (``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:
- ``mismatches`` - a list of the positions within the
match_string where mismatches were found
- ``original`` - the original match_string used to compare
against the input string
If ``mismatches`` is an empty list, then the match was an exact
match.
Example::
patt = CloseMatch("ATCATCGAATGGA")
patt.parse_string("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
patt.parse_string("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
# exact match
patt.parse_string("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
# close match allowing up to 2 mismatches
patt = CloseMatch("ATCATCGAATGGA", max_mismatches=2)
patt.parse_string("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
Nr F)�
maxMismatchesr� )r� �max_mismatchesr c sN |d ur |n|}t � �� || _|| _d�| j| j�| _|| _d| _d| _d S )Nz(Expected {!r} (with up to {} mismatches)F) r� r� r� r r� r� r� r� r� )r� r� r r r� r� r+ r, r� � s
�zCloseMatch.__init__c C s d� t| �j| j�S )Nz{}:{!r})r� r� r/ r� rb r+ r+ r, r| � s z CloseMatch._generateDefaultNameTc C s� |}t |�}|t | j� }||kr�| j}d}g } | j}
tt|||� |��D ]J\}} | \} }
| jrt| �� |
�� } }
| |
krL| �|� t | �|
krL q�qL|| d }t|||� g�}||d< | |d< ||fS t ||| j
| ��d S )Nr r Zoriginal�
mismatches) r� r� r � enumerate�zipr� r[ r� r r� r� )r� r� r� r� r) r� �maxlocr� Zmatch_stringlocr r Zs_m�src�mat�resultsr+ r+ r, r�
s0 �
zCloseMatch.parseImpl)N)T�
r/ r0 r1 r2 r, rQ r� r| r� r� r+ r+ r� r, r � s % ���r c sn e Zd ZdZdddddd�eee eeeeee ee ee eee d� � fd d
�Zd d � Z ddd�Z
� Z S )�Worda8 Token for matching words composed of allowed character sets.
Parameters:
- ``init_chars`` - string of all characters that should be used to
match as a word; "ABC" will match "AAA", "ABAB", "CBAC", etc.;
if ``body_chars`` is also specified, then this is the string of
initial characters
- ``body_chars`` - string of characters that
can be used for matching after a matched initial character as
given in ``init_chars``; if omitted, same as the initial characters
(default=``None``)
- ``min`` - minimum number of characters to match (default=1)
- ``max`` - maximum number of characters to match (default=0)
- ``exact`` - exact number of characters to match (default=0)
- ``as_keyword`` - match as a keyword (default=``False``)
- ``exclude_chars`` - characters that might be
found in the input ``body_chars`` string but which should not be
accepted for matching ;useful to define a word of all
printables except for one or two characters, for instance
(default=``None``)
:class:`srange` is useful for defining custom character set strings
for defining :class:`Word` expressions, using range notation from
regular expression character sets.
A common mistake is to use :class:`Word` to match a specific literal
string, as in ``Word("Address")``. Remember that :class:`Word`
uses the string argument to define *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 :class:`Literal` or :class:`Keyword`.
pyparsing includes helper strings for building Words:
- :class:`alphas`
- :class:`nums`
- :class:`alphanums`
- :class:`hexnums`
- :class:`alphas8bit` (alphabetic characters in ASCII range 128-255
- accented, tilded, umlauted, etc.)
- :class:`punc8bit` (non-alphabetic characters in ASCII range
128-255 - currency, symbols, superscripts, diacriticals, etc.)
- :class:`printables` (any non-whitespace character)
``alphas``, ``nums``, and ``printables`` are also defined in several
Unicode sets - see :class:`pyparsing_unicode``.
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, exclude_chars=",")
rY Nr r F)� initChars� bodyChars� asKeyword� excludeChars) �
init_chars�
body_charsr+ �max�exact�
as_keyword�
exclude_charsr
r r r c
s� |p|}| p|} |
p|}
| p |} t � �� |sBtd�t| �j���t|�}|| _| rtt| �} || 8 }| rtt| �| } d�t |��| _
| r�d�t | ��| _ t| �| _ nd�t |��| _ t|�| _ |dk| _
|dk r�td��|| _|dkr�|| _nt| _|dk�r
|| _|| _d| j | _d| _|
| _d| j| j B v�r�|dk�r�|dk�r�| j | jk�r�|dk�rfd } n0|dk�rvd} n d
�| j| jtk�r�dn| j�} d �t| j�| �| _n�t| j�dk�r�|dk�r�d } nd
�|d �} d�t�| j
�t| j �| �| _nJ|dk�r
d } n |dk�rd} nd
�|d �} d�t| j�t| j �| �| _| j�r\d| j d | _zt�| j�| _W n tj �y� d | _Y n0 | jj | _ t | _ d S )Nz,invalid {}, initChars cannot be empty stringrY r r zUcannot specify a minimum length < 1; use Opt(Word()) if zero-length word is permittedr~ Fr� �+� {{{},{}}}z[{}]{}r z{{0,{}}}z{}[{}]{}rJ z
[{}][{}]{}z\b)!r� r� rT r� r� r/ r� r
r4 �sortedZ
initCharsOrigZ
bodyCharsOrigr � maxSpecified�minLen�maxLenr� r: r� r� r r �reStringr� r� �escape�compile�
sre_constants�errorr� �re_match�
_WordRegexrx )
r� r r r+ r r r r r
r r r �repeatr� r+ r, r� c
s�
��
�
&
��
�
�
z
Word.__init__c C s� dd� }| j | jkr.d�|| j �|| j��}nd�|| j ��}| jdksR| jtkr�| j| jkr�| jdkrt|dd � S |d�| j� S n.| jtkr�|d�| j� S |d �| j| j� S |S )
Nc S s8 d}t | dd�} t| �|kr0| d |d � d S | S d S )N� F)Z re_escaperK r� )r r� )rd Z max_repr_lenr+ r+ r, �
charsAsStr�
s
z-Word._generateDefaultName.<locals>.charsAsStrz
W:({}, {})zW:({})r rJ z{{{}}}z
{{{},...}}r )r
r r� r r r� )r� r& �baser+ r+ r, r| �
s �
zWord._generateDefaultNameTc C s� || | j vr t||| j| ��|}|d7 }t|�}| j}|| j }t||�}||k rj|| |v rj|d7 }qLd}|| | jk r�d}nV| jr�||k r�|| |v r�d}n6| j r�|dkr�||d |v s�||k r�|| |v r�d}|r�t||| j| ��||||� fS )Nr FTr )
r
r� r� r� r r r+ r r r ) r� r� r� r� r) r� Z bodycharsr ZthrowExceptionr+ r+ r, r� �
s8
���
�zWord.parseImpl)rY Nr r r FN)T) r/ r0 r1 r2 r, r� rQ rZ r� r| r� r� r+ r+ r� r, r "
s8 B �
��q r c @ s e Zd Zddd�ZdS )r# Tc C s4 | � ||�}|s t||| j| ��|�� }||�� fS r; )r" r� r� r* �group)r� r� r� r� r r+ r+ r, r� s
z_WordRegex.parseImplN)Tr� r+ r+ r+ r, r# s r# c s@ e Zd ZdZdddd�eeee eee d�� fdd�Z� ZS ) �Charz�A short-cut class for defining :class:`Word` ``(characters, exact=1)``,
when defining a match of any single character in a string of
characters.
FN)r r )�charsetr r r r c sd |p|}|p|}t � j|d||d� d�t| j��| _|rHd�| j�| _t�| j�| _| jj| _ d S )Nr )r r r z[{}]z\b{}\b)
r� r� r� r r
r r� r r� r" )r� r* r r r r r� r+ r, r� " s �z
Char.__init__)FN) r/ r0 r1 r2 r, rZ r� r� r� r+ r+ r� r, r) s ���r) c sr e Zd ZdZdddd�eeejef e e e e d�� fdd�Z
dd � Z dd d �Z dd
d�Z
ddd�Zdd� Z� ZS )�Regexa� Token for matching strings that match a given regular
expression. Defined with string specifying the regular expression in
a form recognized by the stdlib Python `re module <https://docs.python.org/3/library/re.html>`_.
If the given regex contains named groups (defined using ``(?P<name>...)``),
these will be preserved as named :class:`ParseResults`.
If instead of the Python stdlib ``re`` module you wish to use a different RE module
(such as the ``regex`` module), you can do so by building your ``Regex`` object with
a compiled RE that was compiled using ``regex``.
Example::
realnum = Regex(r"[+-]?\d+\.\d*")
# ref: https://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?{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
# named fields in a regex will be returned as named results
date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
# the Regex class will accept re's compiled using the regex module
import regex
parser = pp.Regex(regex.compile(r'[0-9]'))
r F)� asGroupList�asMatch)�pattern�flags�
as_group_list�as_matchr, r- c s t � �� |p|}|p|}t|t�r�|s0td��|| _|| _z t�| j| j�| _| j| _ W q� t
j y| td� |���Y q�0 n8t
|d�r�t
|d�r�|| _|j | _| _ || _ntd��| jj| _d| j | _d| _| �d�d u| _|| _|| _| jr�| j| _| j�r| j| _d S )
a The parameters ``pattern`` and ``flags`` are passed
to the ``re.compile()`` function as-is. See the Python
`re module <https://docs.python.org/3/library/re.html>`_ module for an
explanation of the acceptable patterns and flags.
z0null string passed to Regex; use Empty() insteadz&invalid pattern ({!r}) passed to Regexr. r� zCRegex may only be constructed with a string or a compiled RE objectr~ FrY N)r� r� r� r" rT r. r/ r� r r r r! r� r� rp r� r" r: r� r� r� r, r- �parseImplAsGroupListr� �parseImplAsMatch)r� r. r/ r0 r1 r, r- r� r+ r, r� P s@
� �
zRegex.__init__c C s d� t| j��dd��S )NzRe:({})z\\�\)r� r� r. r� rb r+ r+ r, r| � s zRegex._generateDefaultNameTc C sb | � ||�}|s t||| j| ��|�� }t|�� �}|�� }|rZ|�� D ]\}}|||< qH||fS r; )r" r� r� r* r r( � groupdict�items) r� r� r� r� r rs �d�k�vr+ r+ r, r� � s
zRegex.parseImplc C s8 | � ||�}|s t||| j| ��|�� }|�� }||fS r; )r" r� r� r* �groups�r� r� r� r� r rs r+ r+ r, r2 � s zRegex.parseImplAsGroupListc C s4 | � ||�}|s t||| j| ��|�� }|}||fS r; )r" r� r� r* r; r+ r+ r, r3 � s zRegex.parseImplAsMatchc sP �j rtd���jr$t� �r$td���jr8� fdd�}n� �fdd�}��|�S )a�
Return :class:`Regex` with an attached parse action to transform the parsed
result as if called using `re.sub(expr, repl, string) <https://docs.python.org/3/library/re.html#re.sub>`_.
Example::
make_html = Regex(r"(\w+):(.*?):").sub(r"<\1>\2</\1>")
print(make_html.transform_string("h1:main title:"))
# prints "<h1>main title</h1>"
z-cannot use sub() with Regex(asGroupList=True)z9cannot use sub() with a callable with Regex(asMatch=True)c s | d � � �S r� )�expand�r� )�replr+ r, r� � s zRegex.sub.<locals>.pac s �j �� | d �S r� )r� �subr= �r> r� r+ r, r� � s )r, rp r- r� r� )r� r> r� r+ r@ r, r? � s z Regex.sub)r FF)T)T)T)r/ r0 r1 r2 r r r� � RegexFlagrQ rZ r� r| r� r2 r3 r? r� r+ r+ r� r, r+ 7 s( �� �8
r+ c s~ e Zd ZdZdZdddddddd�eee ee eeee eeee ee eee ed�
� fd d
�Zd d � Z dd
d�Z
� Z S )� QuotedStringa
Token for matching strings that are delimited by quoting characters.
Defined with the following parameters:
- ``quote_char`` - string of one or more characters defining the
quote delimiting string
- ``esc_char`` - character to re_escape quotes, typically backslash
(default= ``None``)
- ``esc_quote`` - special quote sequence to re_escape an embedded quote
string (such as SQL's ``""`` to re_escape an embedded ``"``)
(default= ``None``)
- ``multiline`` - boolean indicating whether quotes can span
multiple lines (default= ``False``)
- ``unquote_results`` - boolean indicating whether the matched text
should be unquoted (default= ``True``)
- ``end_quote_char`` - string of one or more characters defining the
end of the quote delimited string (default= ``None`` => same as
quote_char)
- ``convert_whitespace_escapes`` - convert escaped whitespace
(``'\t'``, ``'\n'``, etc.) to actual whitespace
(default= ``True``)
Example::
qs = QuotedString('"')
print(qs.search_string('lsjdf "This is the quote" sldjf'))
complex_qs = QuotedString('{{', end_quote_char='}}')
print(complex_qs.search_string('lsjdf {{This is the "quote"}} sldjf'))
sql_qs = QuotedString('"', esc_quote='""')
print(sql_qs.search_string('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']]
))z\t� )r� r� )z\f� )z\r�
rY NFT)� quoteChar�escChar�escQuote�unquoteResults� endQuoteChar�convertWhitespaceEscapes)
�
quote_char�esc_char� esc_quote� multiline�unquote_results�end_quote_char�convert_whitespace_escapesrF rG rH rI rJ rK c sd t � �� | p|} |
p|}
| o |} | p(|} |
o0|}
|p8|}|�� }|sNtd��| d u r\|} n| �� } | sptd��|� _t|�� _|d � _| � _t| �� _ | � _
|
� _ | � _ |
� _
d}d}|
r�|d�|t�|
��7 }d}| �r
|d�|t�| ��7 }d}t�� j
�d � _t� j�d k�rZ|d
�|�d�� fd d �tt� j�d dd
�D �� d 7 }d}|�r�tjtjB � _|d�|t� jd �| d u�r�t| �nd�7 }n4d� _|d�|t� jd �| d u�r�t| �nd�7 }d�t�� j�d|dt�� j�g�� _z(t�� j� j�� _� j� _� jj� _ W n& t j �yF td�� j���Y n0 d� j � _ d� _!d� _"d S )Nz%quote_char cannot be the empty stringz'endQuoteChar cannot be the empty stringr rY z{}(?:{})�|z {}(?:{}.)z(.)r z{}(?:c 3 s8 | ]0}d � t�� jd|� �t� j|d� ��V qdS )z (?:{}(?!{}))N)r� r� r rJ r )r) rW rb r+ r, rb 1 s
��z(QuotedString.__init__.<locals>.<genexpr>rk �)z
{}(?:[^{}{}])z{}(?:[^{}\n\r{}])z(?:z)*z$invalid pattern {!r} passed to Regexr~ FT)#r� r� r� rT rF r� � quoteCharLen�firstQuoteCharrJ �endQuoteCharLenrG rH rI rK r� r� r �escCharReplacePatternr4 �range� MULTILINE�DOTALLr/ r r. r r r� r" r r! r: r� r� r� )r� rL rM rN rO rP rQ rR rF rG rH rI rJ rK �sepZ
inner_patternr� rb r, r� � s�
�
���� � �
��
�
zQuotedString.__init__c C s4 | j | jkr$t| j t�r$d�| j �S d�| j | j�S )Nzstring enclosed in {!r}z.quoted string, starting with {} ending with {})rF rJ r� r" r� rb r+ r+ r, r| b s
�z!QuotedString._generateDefaultNamec C s� || | j kr| �||�p d }|s2t||| j| ��|�� }|�� }| jr�|| j| j � }t |t
�r�d|v r�| j r�| j D ]\}}|�
||�}qx| jr�t�| jd|�}| jr�|�
| j| j�}||fS )Nr4 z\g<1>)rV r" r� r� r* r( rI rU rW r� r" rK �ws_mapr� rG r� r? rX rH rJ )r� r� r� r� r rs ZwslitZwscharr+ r+ r, r� j s(
��
zQuotedString.parseImpl)rY NNFTNT)T) r/ r0 r1 r2 r] r, r� rZ r� r| r� r� r+ r+ r� r, rB � sB & �
��qrB c sH e Zd ZdZddd�eeeeed�� fdd�Zd d
� Zdd d
�Z� Z S )�
CharsNotIna� Token for matching words composed of characters *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 ``min`` is
1 (a minimum value < 1 is not valid); the default values for
``max`` and ``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(delimited_list(csv_value).parse_string("dkls,lsdkjf,s12 34,@!#,213"))
prints::
['dkls', 'lsdkjf', 's12 34', '@!#', '213']
rY r r )�notChars)� not_charsr+ r r r_ c s� t � �� d| _|p|| _t| j�| _|dk r6td��|| _|dkrL|| _nt | _|dkrf|| _|| _d| j
| _ | jdk| _ d| _
d S )NFr zacannot specify a minimum length < 1; use Opt(CharsNotIn()) if zero-length char group is permittedr r~ )r� r� r� r_ r� � notCharsSetrT r r r� r: r� r� r� )r� r` r+ r r r_ r� r+ r, r� � s$
� zCharsNotIn.__init__c C s: t | j�}t|�dkr*d�| jd d� �S d�| j�S d S )Nr% z
!W:({}...)�
z!W:({}))r r_ r� r� )r� Z
not_chars_strr+ r+ r, r| � s
z CharsNotIn._generateDefaultNameTc C s� | j }|| |v r"t||| j| ��|}|d7 }t|| j t|��}||k r`|| |vr`|d7 }qB|| | jk r~t||| j| ��||||� fS r� )ra r� r� r+ r r� r )r� r� r� r� Znotcharsr) �maxlenr+ r+ r, r� � s
zCharsNotIn.parseImpl)rY r r r )Tr r+ r+ r� r, r^ � s ���#r^ c st e Zd ZdZdddddddd d
d d d
dddddddddddd�Zd%eeeed �� fd d �
Zd d!� Zd&d#d$�Z � Z
S )'�Whitea� 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 ``" \t\r\n"``. Also takes optional ``min``,
``max``, and ``exact`` arguments, as defined for the
:class:`Word` class.
z<SP>z<TAB>z<LF>z<CR>z<FF>z<NBSP>z<OGHAM_SPACE_MARK>z<MONGOLIAN_VOWEL_SEPARATOR>z <EN_QUAD>z <EM_QUAD>z
<EN_SPACE>z
<EM_SPACE>z<THREE-PER-EM_SPACE>z<FOUR-PER-EM_SPACE>z<SIX-PER-EM_SPACE>z<FIGURE_SPACE>z<PUNCTUATION_SPACE>z <THIN_SPACE>z <HAIR_SPACE>z<ZERO_WIDTH_SPACE>z<NNBSP>z<MMSP>z<IDEOGRAPHIC_SPACE>)r� rC r� rE rD � u u u u u u u u u u u u u u u u u �
r r )�wsr+ r r c sz t � �� |� _� jd�� fdd�� jD ��dd� d� _d� j � _|� _ |dkr\|� _
nt � _
|dkrv|� _
|� _ d S )NrY c 3 s | ]}|� j vr|V qd S r; )�
matchWhiter` rb r+ r, rb
r. z!White.__init__.<locals>.<genexpr>T�rq r~ r ) r� r� rh rr r4 r� r� r: r� r r r� )r� rg r+ r r r� rb r, r�
s
� zWhite.__init__c C s d� dd� | jD ��S )NrY c s s | ]}t j| V qd S r; )rd � whiteStrsr` r+ r+ r, rb
r. z-White._generateDefaultName.<locals>.<genexpr>)r4 rh rb r+ r+ r, r|
s zWhite._generateDefaultNameTc C s� || | j vr t||| j| ��|}|d7 }|| j }t|t|��}||k rb|| | j v rb|d7 }qB|| | jk r�t||| j| ��||||� fS r� )rh r� r� r r+ r� r )r� r� r� r� r) r r+ r+ r, r�
s
zWhite.parseImpl)rf r r r )T) r/ r0 r1 r2 rj r, rQ r� r| r� r� r+ r+ r� r, rd � s8
�rd c s e Zd Z� fdd�Z� ZS )�
PositionTokenc s t � �� d| _d| _d S r� r� rb r� r+ r, r� *
s
zPositionToken.__init__)r/ r0 r1 r� r� r+ r+ r� r, rk )
s rk c s8 e Zd ZdZed�� fdd� Zdd� Zd
dd �Z� ZS ) �
GoToColumnzaToken to advance to a specific column of input text; useful for
tabular report scraping.
)�colnoc s t � �� || _d S r; )r� r� r� )r� rm r� r+ r, r� 5
s
zGoToColumn.__init__c C s\ t ||�| j krXt|�}| jr*| �||�}||k rX|| �� rXt ||�| j krX|d7 }q*|S r� )r� r� r� r� �isspace)r� r� r� r� r+ r+ r, r� 9
s �
��
zGoToColumn.preParseTc C sD t ||�}|| j kr"t||d| ��|| j | }|||� }||fS )NzText not in expected column)r� r� )r� r� r� r� ZthiscolZnewlocrs r+ r+ r, r� F
s
zGoToColumn.parseImpl)T) r/ r0 r1 r2 rQ r� r� r� r� r+ r+ r� r, rl 0
s
rl c s2 e Zd ZdZ� fdd�Zdd� Zd dd�Z� ZS )
� LineStarta� 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).search_string(test):
print(t)
prints::
['AAA', ' this line']
['AAA', ' and this line']
c sF t � �� | �� t� | jB | _| j�d� t� �| j�| _ d| _
d S )Nr� zExpected start of line) r� r� rp r� r� �orig_whiteChars�discardr! rr r� r� rb r� r+ r, r� f
s
zLineStart.__init__c C sT |dkr |S | j �||�}d| jv rL|||d � dkrL| j �||d �}q$|S d S )Nr r� r )r� r� rp )r� r� r� rs r+ r+ r, r� n
s
zLineStart.preParseTc C s* t ||�dkr|g fS t||| j| ��d S r� )r� r� r� r� r+ r+ r, r� x
s zLineStart.parseImpl)T)r/ r0 r1 r2 r� r� r� r� r+ r+ r� r, ro O
s
ro c s* e Zd ZdZ� fdd�Zddd�Z� ZS )�LineEndzTMatches if current position is at the end of a line within the
parse string
c s0 t � �� | j�d� | j| jdd� d| _d S )Nr� Fri zExpected end of line)r� r� r� rq rr r� rb r� r+ r, r� �
s
zLineEnd.__init__Tc C sb |t |�k r6|| dkr$|d dfS t||| j| ��n(|t |�krN|d g fS t||| j| ��d S )Nr� r �r� r� r� r� r+ r+ r, r� �
s zLineEnd.parseImpl)Tr� r+ r+ r� r, rr ~
s rr c s* e Zd ZdZ� fdd�Zddd�Z� ZS )� StringStartzLMatches if current position is at the beginning of the parse
string
c s t � �� d| _d S )NzExpected start of text�r� r� r� rb r� r+ r, r� �
s
zStringStart.__init__Tc C s0 |dkr(|| � |d�kr(t||| j| ��|g fS r� )r� r� r� r� r+ r+ r, r� �
s zStringStart.parseImpl)Tr� r+ r+ r� r, rt �
s rt c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r" zG
Matches if current position is at the end of the parse string
c s t � �� d| _d S )NzExpected end of textru rb r� r+ r, r� �
s
zStringEnd.__init__Tc C s^ |t |�k r t||| j| ��n<|t |�kr6|d g fS |t |�krJ|g fS t||| j| ��d S r� rs r� r+ r+ r, r� �
s zStringEnd.parseImpl)Tr� r+ r+ r� r, r" �
s r" c s< e Zd ZdZefed�eed�� fdd�Zd dd�Z� ZS )
� WordStarta� Matches if the current position is at the beginning of a
:class:`Word`, and is not preceded by any character in a given
set of ``word_chars`` (default= ``printables``). To emulate the
```` behavior of regular expressions, use
``WordStart(alphanums)``. ``WordStart`` will also match at
the beginning of the string being parsed, or at the beginning of
a line.
�� wordChars��
word_charsrx c s. |t kr |n|}t� �� t|�| _d| _d S )NzNot at the start of a word)�
printablesr� r� r� rx r� �r� rz rx r� r+ r, r� �
s
zWordStart.__init__Tc C s@ |dkr8||d | j v s(|| | j vr8t||| j| ��|g fS �Nr r )rx r� r� r� r+ r+ r, r� �
s � �zWordStart.parseImpl)T� r/ r0 r1 r2 r{ r, r� r� r� r+ r+ r� r, rv �
s rv c s< e Zd ZdZefed�eed�� fdd�Zd dd�Z� ZS )
�WordEndai Matches if the current position is at the end of a :class:`Word`,
and is not followed by any character in a given set of ``word_chars``
(default= ``printables``). To emulate the ```` behavior of
regular expressions, use ``WordEnd(alphanums)``. ``WordEnd``
will also match at the end of the string being parsed, or at the end
of a line.
rw ry c s4 |t kr |n|}t� �� t|�| _d| _d| _d S )NFzNot at the end of a word)r{ r� r� r� rx r� r� r| r� r+ r, r� �
s
zWordEnd.__init__Tc C sP t |�}|dkrH||k rH|| | jv s8||d | jvrHt||| j| ��|g fS r} )r� rx r� r� )r� r� r� r� r� r+ r+ r, r� �
s ��zWordEnd.parseImpl)Tr~ r+ r+ r� r, r �
s r c s� e Zd ZdZd ee ed�� fdd�
Zdd� Zdd � Z d � fd d � Z
d � fd
d� Z � fdd�Z dd� Z
� fdd�Zd dd�Z� fdd�Zd � fdd� Ze Ze
Z� ZS )!�ParseExpressionz]Abstract subclass of ParserElement, for combining and
post-processing parsed tokens.
F��exprsr� c s� t � �|� � t|t�r"t|�}t|t�r<� �|�g� _n�t|t�rP|g� _nlt|t �r�t|�}t
dd� |D ��r�� fdd�|D �}t|�� _n*zt|�� _W n t y� |g� _Y n0 d� _ d S )Nc s s | ]}t |t�V qd S r; )r� r" )r) r� r+ r+ r, rb r. z+ParseExpression.__init__.<locals>.<genexpr>c 3 s& | ] }t |t�r� �|�n|V qd S r; )r� r" r� �r) r� rb r+ r, rb s �F)
r� r� r� �_generatorTyper� r" r� r� r] r �anyrp r� �r� r� r� r� rb r, r� �
s(
� zParseExpression.__init__c C s | j d d � S r; )r� rb r+ r+ r, r� s zParseExpression.recursec C s | j �|� d | _| S r; )r� r� r� r? r+ r+ r, r� s zParseExpression.appendTc s< t � �|� |r8dd� | jD �| _| jD ]}|�|� q(| S )z�
Extends ``leave_whitespace`` defined in base class, and also invokes ``leave_whitespace`` on
all contained expressions.
c S s g | ] }|� � �qS r+ �r� r� r+ r+ r, r- r. z4ParseExpression.leave_whitespace.<locals>.<listcomp>)r� rp r� �r� rl r� r� r+ r, rp s
z ParseExpression.leave_whitespacec s< t � �|� |r8dd� | jD �| _| jD ]}|�|� q(| S )z�
Extends ``ignore_whitespace`` defined in base class, and also invokes ``leave_whitespace`` on
all contained expressions.
c S s g | ] }|� � �qS r+ r� r� r+ r+ r, r- * r. z5ParseExpression.ignore_whitespace.<locals>.<listcomp>)r� ro r� r� r� r+ r, ro # s
z!ParseExpression.ignore_whitespacec sj t |t�r>|| jvrft� �|� | jD ]}|�| jd � q&n(t� �|� | jD ]}|�| jd � qP| S �Nrk )r� rj r� r� ru r� )r� r@ r� r� r+ r, ru / s
zParseExpression.ignorec C s d� | jjt| j��S �Nz{}:({}))r� rx r/ r, r� rb r+ r+ r, r| ; s z$ParseExpression._generateDefaultNamec s0 | j r
| S t� �� | jD ] }|�� qt| j�dk�r | jd }t|| j�r�|js�|jd u r�|j s�|jd d � | jd g | _d | _
| j |j O _ | j |j O _ | jd }t|| j��r |j�s |jd u �r |j �s | jd d� |jd d � | _d | _
| j |j O _ | j |j O _ dt
| � | _| S )NrJ r r rk r~ )r� r� r r� r� r� rx r� r� r� r� r� r� r, r� )r� r� r@ r� r+ r, r > sD
����
���� zParseExpression.streamlineNc C sB |d ur |ng d d � | g }| j D ]}|�|� q$| �g � d S r; )r� r� r� )r� r� �tmpr� r+ r+ r, r� g s
zParseExpression.validatec s t � �� }dd� | jD �|_|S )Nc S s g | ] }|� � �qS r+ r� r� r+ r+ r, r- o r. z(ParseExpression.copy.<locals>.<listcomp>)r� r� r� �r� rs r� r+ r, r� m s
zParseExpression.copyc sj t jr\tj| jvr\| jD ]B}t|t�r|jrtj|jvrtj d�
d|t | �j |j�dd� qt
� �||�S �NzY{}: setting results name {!r} on {} expression collides with {!r} on contained expressionrA rK ��
stacklevel)r7 rA rI r� r� r� r] r� �warningsr8 r� r� r/ r� r� �r� r: r� r� r� r+ r, r� r s2 ���
������ z ParseExpression._setResultsName)F)T)T)N)F)r/ r0 r1 r2 � IterableTyper] rZ r� r� r� rp ro ru r| r r� r� r� r� r� r� r+ r+ r� r, r� �
s
)
r� c sr e Zd ZdZG dd� de�Zdee ed�� fdd�
Z ed�� fd d
� Z
dd d �Z d
d� Z dd� Z
dd� Z� ZS )r> a
Requires all given :class:`ParseExpression` s to be found in the given order.
Expressions may be separated by whitespace.
May be constructed using the ``'+'`` operator.
May also be constructed using the ``'-'`` 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 Zd Z� fdd�Zdd� Z� ZS )zAnd._ErrorStopc s t � j|i |�� | �� d S r; )r� r� rp )r� rr r� r� r+ r, r� � s zAnd._ErrorStop.__init__c C s dS )N�-r+ rb r+ r+ r, r| � s z#And._ErrorStop._generateDefaultName)r/ r0 r1 r� r| r� r+ r+ r� r, rE � s rE T)� exprs_argr� c s� t |�}|r�t|v r�g }t|�D ]`\}}|tu rv|t|�d k rlt� ||d jd }|�t|�d�� q�td��q |�|� q ||d d �< t � �
||� | jr�t dd� | jD ��| _ | j
| jd j| jd jd� | jd j| _nd | _ d | _d S )
Nr rk rB z0cannot construct And with sequence ending in ...c s s | ] }|j V qd S r; �r� r� r+ r+ r, rb � r. z And.__init__.<locals>.<genexpr>r ri T)r� r< r r� r! r� r� rC r� r� r� r� r� rr r� r� r� r� )r� r� r� r� r� rW r� Z
skipto_argr� r+ r, r� � s. �
�z And.__init__r� c sH | j r�tdd� | j d d� D ��r�t| j d d� �D ]^\}}|d u rFq4t|t�r4|j r4t|j d t�r4|j d | j |d |j d< d | j |d < q4dd� | j D �| _ t� �� t| j | j dd � �D ]f\}� t � }� r�t
� �|v r�q�|� t
� �� t� t ��r|�
� fdd�� qƈ �� }tt|�d �� q�q�td d� | j D ��| _| S )
Nc s s. | ]&}t |t�o$|jo$t |jd t�V qdS �rk N)r� r� r� r= r� r+ r+ r, rb � s
�
�z!And.streamline.<locals>.<genexpr>rk r c S s g | ]}|d ur|�qS r; r+ r� r+ r+ r, r- � r. z"And.streamline.<locals>.<listcomp>c s t � dt|| ��S )N�
parent_anchor)�setattrr� rc �Zcurr+ r, rh � r. z And.streamline.<locals>.<lambda>c s s | ] }|j V qd S r; r� r� r+ r+ r, rb � r. )r� r� r r� r� r= r� r r r� r� �add�
IndentedBlockr� r� �nextrd r� r� )r� rW r� �prev�seenZsubsr� r� r, r � s@ ����
�zAnd.streamlinec C s� | j d j|||dd�\}}d}| j dd � D ]�}t|�tju rFd}q.|r�z|�|||�\}}W q� tyt � Y q� ty� } z d |_t�|��W Y d }~q�d }~0 t y� t|t
|�| j | ��Y q�0 n|�|||�\}}|s�|� � r.||7 }q.||fS )Nr Fr( r T)
r� r� r� r> rE ZParseSyntaxExceptionr rq Z_from_exceptionr� r� r� �haskeys) r� r� r� r� Z
resultlistZ errorStopr� Z
exprtokensr
r+ r+ r, r� � s0
�
�
z
And.parseImplc C s t |t�r| �|�}| �|�S r; �r� r" r� r� r? r+ r+ r, �__iadd__ s
z And.__iadd__c C s6 |d d � | g }| j D ]}|�|� |js q2qd S r; )r� r� r� r� r+ r+ r, r� s
zAnd._checkRecursionc C sV d� dd� | jD ��}t|�dkrJ|dd t|�d � dkrJ|dd� }qd| d S )
Nr� c s s | ]}t |�V qd S r; r� r� r+ r+ r, rb r. z+And._generateDefaultName.<locals>.<genexpr>r r �{}rk �{�})r4 r� r� �r� �innerr+ r+ r, r| s &zAnd._generateDefaultName)T)T)r/ r0 r1 r2 r! rE r� r] rZ r� r r� r� r� r| r� r+ r+ r� r, r> � s +
r> c sh e Zd ZdZdee ed�� fdd�
Zed�� fdd� Zdd
d �Z d d
� Z
dd� Z d� fdd� Z � Z
S )r[ a� Requires that at least one :class:`ParseExpression` is found. If
two expressions match, the expression that matches the longest
string will be used. May be constructed using the ``'^'``
operator.
Example::
# construct Or using '^' operator
number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
print(number.search_string("123 3.1416 789"))
prints::
[['123'], ['3.1416'], ['789']]
Fr� c sL t � �||� | jrBtdd� | jD ��| _tdd� | jD ��| _nd| _d S )Nc s s | ] }|j V qd S r; r� r� r+ r+ r, rb 8 r. z Or.__init__.<locals>.<genexpr>c s s | ] }|j V qd S r; rm r� r+ r+ r, rb 9 r. T�r� r� r� r� r� r� r� r� r� r+ r, r� 5 s
z Or.__init__r� c s^ t � �� | jrTtdd� | jD ��| _tdd� | jD ��| _tdd� | jD ��| _nd| _| S )Nc s s | ] }|j V qd S r; r� r� r+ r+ r, rb @ r. z Or.streamline.<locals>.<genexpr>c s s | ] }|j V qd S r; �r� r� r+ r+ r, rb A r. c s s | ] }|j V qd S r; rm r� r+ r+ r, rb B r. F)r� r r� r� r� r� r� r� rb r� r+ r, r = s
z
Or.streamlineTc C s� d}d }g }g }t dd� | jD ��r0| �||�}| jD ]�}z|j||dd�} W n� ty� }
z*d |
_||
_|�|
� d }d}W Y d }
~
q6d }
~
0 ty� } z*|s�d | _| j |kr�| }| j }W Y d } ~ q6d } ~ 0 t
�y t |�|k�rt|t |�|j | �}t |�}Y q60 |�| |f� q6|�r|j
td�dd� |�sV|d d } | �|||�S d }
|D ]�\}}||
d k�r||
S z|�|||�\} }W nB t�y� } z(d | _| j |k�r�| }| j }W Y d } ~ n6d } ~ 0 0 | |k�r�| |f S | |
d k�r^| |f}
�q^|
d k�r|
S |�rjt |�dk�r^|j
d
d � d � |d j |d j k�r^|j
d
d � d � |d }|�|d u�r�| j |_|�nt||d| ��d S )Nrk c s s | ] }|j V qd S r; )r� r� r+ r+ r, rb L r. z Or.parseImpl.<locals>.<genexpr>T�r� r )re �reverser r� c S s | j S r; �r� �r� r+ r+ r, rh � r. z Or.parseImpl.<locals>.<lambda>�re c S s | j tt| j�� fS r; �r� r� r, �
parserElementr� r+ r+ r, rh � r. � no defined alternatives to match)r� r� r� r� r� rq r� r� r� r� r� r� r� �sortr r� r� )r� r� r� r� � maxExcLoc� maxExceptionr. �fatalsr� Zloc2�pfer� Z best_exprZlongestZloc1Zexpr1r� � max_fatalr+ r+ r, r� G s~
�
�z Or.parseImplc C s t |t�r| �|�}| �|�S r; r� r? r+ r+ r, �__ixor__� s
z Or.__ixor__c C s dd� dd� | jD �� d S )Nr� z ^ c s s | ]}t |�V qd S r; r� r� r+ r+ r, rb � r. z*Or._generateDefaultName.<locals>.<genexpr>r� �r4 r� rb r+ r+ r, r| � s zOr._generateDefaultNamec sR t jrDtj| jvrDtdd� | jD ��rDtjd�d|t | �j
�dd� t � � ||�S )Nc s s$ | ] }t |t�otj|jvV qd S r; �r� r> rI r@ r� r� r+ r+ r, rb � s
�
�z%Or._setResultsName.<locals>.<genexpr>��{}: setting results name {!r} on {} expression will return a list of all parsed tokens in an And alternative, in prior versions only the first token was returned; enclosecontained argument in Groupr@ rK r� �
r7 r@ rI r� r� r� r� r8 r� r� r/ r� r� �r� r: r� r� r+ r, r� � s$ ������ zOr._setResultsName)F)T)F)r/ r0 r1 r2 r� r] rZ r� r r� r� r| r� r� r+ r+ r� r, r[ # s
Rr[ c sh e Zd ZdZdee ed�� fdd�
Zed�� fdd� Zdd
d �Z d d
� Z
dd� Z d� fdd� Z � Z
S )rX a� Requires that at least one :class:`ParseExpression` is found. If
more than one expression matches, the first one listed is the one that will
match. May be constructed using the ``'|'`` operator.
Example::
# construct MatchFirst using '|' operator
# watch the order of expressions to match
number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
print(number.search_string("123 3.1416 789")) # Fail! -> [['123'], ['3'], ['1416'], ['789']]
# put more selective expression first
number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
print(number.search_string("123 3.1416 789")) # Better -> [['123'], ['3.1416'], ['789']]
Fr� c sL t � �||� | jrBtdd� | jD ��| _tdd� | jD ��| _nd| _d S )Nc s s | ] }|j V qd S r; r� r� r+ r+ r, rb � r. z&MatchFirst.__init__.<locals>.<genexpr>c s s | ] }|j V qd S r; rm r� r+ r+ r, rb � r. Tr� r� r� r+ r, r� � s
zMatchFirst.__init__r� c sn | j r
| S t� �� | jr^tdd� | jD ��| _tdd� | jD ��| _tdd� | jD ��| _n d| _d| _| S )Nc s s | ] }|j V qd S r; r� r� r+ r+ r, rb � r. z(MatchFirst.streamline.<locals>.<genexpr>c s s | ] }|j V qd S r; r� r� r+ r+ r, rb � r. c s s | ] }|j V qd S r; rm r� r+ r+ r, rb � r. FT) r� r� r r� r� r� r� r� r� rb r� r+ r, r � s
zMatchFirst.streamlineTc C s� d}d }| j D ]�}z|�|||�W S tyX } zd |_||_� W Y d }~qd }~0 ty� } z |j|krz|}|j}W Y d }~qd }~0 ty� t|�|kr�t|t|�|j | �}t|�}Y q0 q|d ur�| j |_
|�nt||d| ��d S )Nrk r� ) r� r� r� rq r� r� r� r� r� r� r� ) r� r� r� r� r� r� r� r� r� r+ r+ r, r� � s:
�
��zMatchFirst.parseImplc C s t |t�r| �|�}| �|�S r; r� r? r+ r+ r, �__ior__ s
zMatchFirst.__ior__c C s dd� dd� | jD �� d S )Nr� z | c s s | ]}t |�V qd S r; r� r� r+ r+ r, rb r. z2MatchFirst._generateDefaultName.<locals>.<genexpr>r� r� rb r+ r+ r, r| s z MatchFirst._generateDefaultNamec sR t jrDtj| jvrDtdd� | jD ��rDtjd�d|t | �j
�dd� t � � ||�S )Nc s s$ | ] }t |t�otj|jvV qd S r; r� r� r+ r+ r, rb s
�
�z-MatchFirst._setResultsName.<locals>.<genexpr>r� r@ rK r� r� r� r� r+ r, r� s$ ������ zMatchFirst._setResultsName)F)T)F)r/ r0 r1 r2 r� r] rZ r� r r� r� r| r� r� r+ r+ r� r, rX � s
"rX c sR e Zd ZdZd
ee ed�� fdd�
Zed�� fdd� Zdd d
�Z d d � Z
� Z S )r^ al Requires all given :class:`ParseExpression` s to be found, but in
any order. Expressions may be separated by whitespace.
May be constructed using the ``'&'`` operator.
Example::
color = one_of("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
shape_type = one_of("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 & Opt(color_attr) & Opt(size_attr)
shape_spec.run_tests('''
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
Tr� c sH t � �||� | jr,tdd� | jD ��| _nd| _d| _d| _d| _d S )Nc s s | ] }|j V qd S r; r� r� r+ r+ r, rb f r. z Each.__init__.<locals>.<genexpr>T)r� r� r� r� r� r� �initExprGroupsr� r� r� r+ r, r� c s z
Each.__init__r� c s2 t � �� | jr(tdd� | jD ��| _nd| _| S )Nc s s | ] }|j V qd S r; r� r� r+ r+ r, rb p r. z"Each.streamline.<locals>.<genexpr>T)r� r r� r� r� rb r� r+ r, r m s
zEach.streamlinec s� | j r�tdd� | jD ��| _dd� | jD �}dd� | jD �}|| | _dd� | jD �| _dd� | jD �| _dd� | jD �| _| j| j7 _d | _ |}| jd d � }| jd d � � | jd d � }g } d
}
g } g } |
�r�|� | }
| �� | �� |
D ]�}z|j ||d
d �}W nb t
�yT } z,d |_ ||_ | �
|� | �
|� W Y d }~q�d }~0 t�yp | �
|� Y q�0 | �
| j�t|�|�� ||v �r�|�|� q�|� v r�� �|� q�t| �t|
�kr�d }
q�| �r t| �d k�r| jd
d� d� | d j| d jk�r| jdd� d� | d }|�|�rLd�dd� |D ��}t||d�|���| � fdd�| jD �7 } tg �}| D ] }|�|||�\}}||7 }�qp||fS )Nc s s& | ] }t |t�rt|j�|fV qd S r; )r� rL r� r� r� r+ r+ r, rb w s z!Each.parseImpl.<locals>.<genexpr>c S s g | ]}t |t�r|j�qS r+ �r� rL r� r� r+ r+ r, r- z r. z"Each.parseImpl.<locals>.<listcomp>c S s& g | ] }|j rt|tttf�s|�qS r+ )r� r� rL r+ rR r� r+ r+ r, r- { s �c S s( g | ] }t |t�r|jj|jd d��qS �T)r� )r� �_MultipleMatchr� r� r� r� r+ r+ r, r- � s
�c S s( g | ] }t |t�r|jj|jd d��qS r� )r� rS r� r� r� r� r+ r+ r, r- � s
�c S s g | ]}t |tttf�s|�qS r+ )r� rL rR rS r� r+ r+ r, r- � s FTr� r c S s | j S r; r� r� r+ r+ r, rh � r. z Each.parseImpl.<locals>.<lambda>r� r c S s | j tt| j�� fS r; r� r� r+ r+ r, rh � r. z, c s s | ]}t |�V qd S r; r� r� r+ r+ r, rb � r. z*Missing one or more required elements ({})c s$ g | ] }t |t�r|j� v r|�qS r+ r� r� �ZtmpOptr+ r, r- � r. )r� �dictr� Zopt1map� optionalsZmultioptionalsZ
multirequired�requiredr
r� r� rq r� r� r� r� r� �remover� r� r� r4 r� r r� )r� r� r� r� Zopt1Zopt2ZtmpLocZtmpReqdZmultisZ
matchOrderZ keepMatchingZfailedr� ZtmpExprsr� r� r� �missingZ
total_resultsr
r+ r� r, r� u s� �
�
���
� zEach.parseImplc C s dd� dd� | jD �� d S )Nr� z & c s s | ]}t |�V qd S r; r� r� r+ r+ r, rb � r. z,Each._generateDefaultName.<locals>.<genexpr>r� r� rb r+ r+ r, r| � s zEach._generateDefaultName)T)T) r/ r0 r1 r2 r� r] rZ r� r r� r| r� r+ r+ r� r, r^ ) s
9
Wr^ c s� e Zd ZdZdeeef ed�� fdd�
Zdd� Z dd d
�Z
d � fd d � Z d � fd
d� Z � fdd�Z
� fdd�Zdd� Zd dd�Zdd� Ze Ze Z� ZS ) �ParseElementEnhancezfAbstract subclass of :class:`ParserElement`, for combining and
post-processing parsed tokens.
F�r� r� c s� t � �|� t|t�rVt| jt�r.| �|�}n(tt| �| j�rHt|�}n| �t|��}|| _ |d ur�|j
| _
|j | _ | j |j
|jd� |j| _|j| _|j| _| j�|j� d S )Nri )r� r� r� r" �
issubclassr� r� r� r� r� r� r� rr r� r� r� r� r� r� r� �r� r� r� r� r+ r, r� � s$
�z ParseElementEnhance.__init__c C s | j d ur| j gS g S r; �r� rb r+ r+ r, r� � s zParseElementEnhance.recurseTc C s2 | j d ur | j j|||dd�S td|| j| ��d S )NFr( rY )r� r� r� r� r� r+ r+ r, r� � s
z ParseElementEnhance.parseImplc s6 t � �|� |r2| j�� | _| jd ur2| j�|� | S r; )r� rp r� r� rn r� r+ r, rp � s
z$ParseElementEnhance.leave_whitespacec s6 t � �|� |r2| j�� | _| jd ur2| j�|� | S r; )r� ro r� r� rn r� r+ r, ro � s
z%ParseElementEnhance.ignore_whitespacec sj t |t�r>|| jvrft� �|� | jd urf| j�| jd � n(t� �|� | jd urf| j�| jd � | S r� )r� rj r� r� ru r� r? r� r+ r, ru s
zParseElementEnhance.ignorec s" t � �� | jd ur | j�� | S r; )r� r r� rb r� r+ r, r s
z ParseElementEnhance.streamlinec C sB | |v rt || g ��|d d � | g }| jd ur>| j�|� d S r; )ZRecursiveGrammarExceptionr� r� )r� r� r� r+ r+ r, r� s
z#ParseElementEnhance._checkRecursionNc C sB |d u r g }|d d � | g }| j d ur4| j �|� | �g � d S r; �r� r� r� �r� r� r� r+ r+ r, r� s
z ParseElementEnhance.validatec C s d� | jjt| j��S r� )r� rx r/ r, r� rb r+ r+ r, r| & s z(ParseElementEnhance._generateDefaultName)F)T)T)T)N)r/ r0 r1 r2 r r] r, rZ r� r� r� rp ro ru r r� r� r| r� r� r� r+ r+ r� r, r� � s
r� c s\ e Zd ZdZG dd� de�ZG dd� de�Zddd�eeed �� fd
d �Z dd d
�Z
� Z S )r� z�
Expression to match one or more expressions at a given indentation level.
Useful for parsing text where structure is implied by indentation (like Python source code).
c s" e Zd Zed�� fdd� Z� ZS )zIndentedBlock._Indent��ref_colc s, t � �� d�� �| _| �� fdd�� d S )Nz expected indent at column {}c s t || �� kS r; �r� rc r� r+ r, rh 7 r. z0IndentedBlock._Indent.__init__.<locals>.<lambda>�r� r� r� r� r� �r� r� r� r� r, r� 4 s
z IndentedBlock._Indent.__init__�r/ r0 r1 rQ r� r� r+ r+ r� r, �_Indent3 s r� c s" e Zd Zed�� fdd� Z� ZS )z IndentedBlock._IndentGreaterr� c s, t � �� d�� �| _| �� fdd�� d S )Nz)expected indent at column greater than {}c s t || �� kS r; r� rc r� r+ r, rh = r. z7IndentedBlock._IndentGreater.__init__.<locals>.<lambda>r� r� r� r� r, r� : s
z%IndentedBlock._IndentGreater.__init__r� r+ r+ r� r, �_IndentGreater9 s r� FT�rl �grouped)r� rl r� c s& t � j|dd� || _|| _d| _d S )NTr� r )r� r� �
_recursive�_groupedr� )r� r� rl r� r� r+ r, r� ? s zIndentedBlock.__init__c
C s� t � �||�}| j�|||� t||�}| �|�}t � | | j }| jr�| �|�}t| j| j| j d�} | �
| j � || _ |t
|| �7 }|�dtt|��dd � �� � d|� �� t|�}
| �| j �t� B } | j r�t} ndd� } | |
�t| � �|||�S )Nr� zinner ����@c S s | S r; r+ r� r+ r+ r, rh g r. z)IndentedBlock.parseImpl.<locals>.<lambda>)r! r� r� r� r� r� r� r� r� r� r{ r� r� rL r �hexr� r� rS r" �Groupr r� )
r� r� r� r� Z
anchor_locZ
indent_colZpeer_detect_exprZ
inner_exprZ
sub_indentZ nested_block�blockZtrailing_undentrw r+ r+ r, r� I s,
� *�zIndentedBlock.parseImpl)T) r/ r0 r1 r2 r! r� r� r] rZ r� r� r� r+ r+ r� r, r� - s ��
r� c s< e Zd ZdZeeef d�� fdd� Zd� fdd� Z� Z S ) �
AtStringStartz�Matches if expression matches at the beginning of the parse
string::
AtStringStart(Word(nums)).parse_string("123")
# prints ["123"]
AtStringStart(Word(nums)).parse_string(" 123")
# raises ParseException
r� c s t � �|� d| _d S �NF�r� r� r� �r� r� r� r+ r, r� x s zAtStringStart.__init__Tc s$ |dkrt ||d��t� �|||�S )Nr znot found at string start)r� r� r� r� r� r+ r, r� | s zAtStringStart.parseImpl)T�
r/ r0 r1 r2 r r] r, r� r� r� r+ r+ r� r, r� m s
r� c s< e Zd ZdZeeef d�� fdd� Zd� fdd� Z� Z S ) � AtLineStarta� Matches if an expression matches 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 (AtLineStart('AAA') + restOfLine).search_string(test):
print(t)
prints::
['AAA', ' this line']
['AAA', ' and this line']
r� c s t � �|� d| _d S r� r� r� r� r+ r, r� � s zAtLineStart.__init__Tc s* t ||�dkrt||d��t� �|||�S )Nr znot found at line start)r� r� r� r� r� r� r+ r, r� � s zAtLineStart.parseImpl)Tr� r+ r+ r� r, r� � s r� c s8 e Zd ZdZeeef d�� fdd� Zddd�Z� Z S ) �
FollowedByaf Lookahead matching of the given parse expression.
``FollowedBy`` does *not* advance the parsing position within
the input string, it only verifies that the specified parse
expression matches at the current position. ``FollowedBy``
always returns a null token list. If any results names are defined
in the lookahead expression, those *will* be returned for access by
name.
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, stop_on=label).set_parse_action(' '.join))
OneOrMore(attr_expr).parse_string("shape: SQUARE color: BLACK posn: upper left").pprint()
prints::
[['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
r� c s t � �|� d| _d S r� �r� r� r� r� r� r+ r, r� � s zFollowedBy.__init__Tc C s( | j j|||d�\}}|d d �= ||fS )Nr� )r� r� )r� r� r� r� r% rs r+ r+ r, r� � s
zFollowedBy.parseImpl)Tr� r+ r+ r� r, r� � s r� c s@ e Zd ZdZd
eeef ee d�� fdd�
Z d dd �Z
� Z S ) �
PrecededBya� Lookbehind matching of the given parse expression.
``PrecededBy`` does not advance the parsing position within the
input string, it only verifies that the specified parse expression
matches prior to the current position. ``PrecededBy`` always
returns a null token list, but if a results name is defined on the
given expression, it is returned.
Parameters:
- expr - expression that must match prior to the current parse
location
- retreat - (default= ``None``) - (int) maximum number of characters
to lookbehind prior to the current parse location
If the lookbehind expression is a string, :class:`Literal`,
:class:`Keyword`, or a :class:`Word` or :class:`CharsNotIn`
with a specified exact or maximum length, then the retreat
parameter is not required. Otherwise, retreat must be specified to
give a maximum number of characters to look back from
the current parse position for a lookbehind match.
Example::
# VB-style variable names with type prefixes
int_var = PrecededBy("#") + pyparsing_common.identifier
str_var = PrecededBy("$") + pyparsing_common.identifier
N)r� �retreatc s� t � �|� | �� �� | _d| _d| _d| _t|t�rFt |�}d| _nVt|t
t f�rb|j }d| _n:t|t
tf�r�|jtkr�|j}d| _nt|t�r�d}d| _|| _dt|� | _d| _| j�dd� � d S )NTFr znot preceded by c S s |� td d ��S r; )� __delitem__�slicerc r+ r+ r, rh � r. z%PrecededBy.__init__.<locals>.<lambda>)r� r� r� rp r� r� r r� r" r� r� r� r� r r^ r r� rk r� r, r� r� r� r� )r� r� r� r� r+ r, r� � s*
zPrecededBy.__init__r Tc C s� | j r<|| jk r t||| j��|| j }| j�||�\}}n�| jt� }|td|| j �|� }t||| j�} tdt || jd �d �D ]N}
z |�|t
|�|
�\}}W n( t y� } z| } W Y d } ~ q�d } ~ 0 0 q�q�| �||fS r} ) r r� r� r� r� r� r" r rY r+ r� r ) r� r� r� r� r) r% rs Z test_exprZinstring_sliceZ last_expr�offsetZpber+ r+ r, r� � s$
� zPrecededBy.parseImpl)N)r T) r/ r0 r1 r2 r r] r, r� rQ r� r� r� r+ r+ r� r, r� � s ��r� c @ s e Zd ZdZddd�ZdS )�Locateda�
Decorates 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 ``<TAB>`` characters, you
may want to call :class:`ParserElement.parse_with_tabs`
Example::
wd = Word(alphas)
for match in Located(wd).search_string("ljsdf123lksdjjf123lkkjj1222"):
print(match)
prints::
[0, ['ljsdf'], 5]
[8, ['lksdjjf'], 15]
[18, ['lkkjj'], 23]
Tc C s^ |}| j j|||dd�\}}t|||g�}||d< ||d< ||d< | jrR||gfS ||fS d S )NFr( Z
locn_startr Zlocn_end)r� r� r r� )r� r� r� r� r) r� r� r+ r+ r, r� 4 s
zLocated.parseImplN)T)r/ r0 r1 r2 r� r+ r+ r+ r, r� s r� c s@ e Zd ZdZeeef d�� fdd� Zd
dd�Zdd � Z � Z
S ) ra a�
Lookahead to disallow matching with the given parse expression.
``NotAny`` does *not* advance the parsing position within the
input string, it only verifies that the specified parse expression
does *not* match at the current position. Also, ``NotAny`` does
*not* skip over leading whitespace. ``NotAny`` always returns
a null token list. May be constructed using the ``'~'`` operator.
Example::
AND, OR, NOT = map(CaselessKeyword, "AND OR NOT".split())
# take care not to mistake keywords for identifiers
ident = ~(AND | OR | NOT) + Word(alphas)
boolean_term = Opt(NOT) + ident
# very crude boolean expression - to support parenthesis groups and
# operation hierarchy, use infix_notation
boolean_expr = boolean_term + ZeroOrMore((AND | OR) + boolean_term)
# integers that are followed by "." are actually floats
integer = Word(nums) + ~Char(".")
r� c s, t � �|� d| _d| _dt| j� | _d S )NFTzFound unwanted token, )r� r� r� r� r, r� r� r� r� r+ r, r� [ s zNotAny.__init__Tc C s& | j �||�r t||| j| ��|g fS r; )r� r r� r� r� r+ r+ r, r� d s zNotAny.parseImplc C s dt | j� d S )Nz~{r� �r, r� rb r+ r+ r, r| i s zNotAny._generateDefaultName)T) r/ r0 r1 r2 r r] r, r� r� r| r� r+ r+ r� r, ra B s
ra c sf e Zd Zddd�eeeeef eeeef d�� fdd�Zdd� Zdd d
�Z d� fd d
� Z
� Z S )r� N��stopOn�r� �stop_onr� c s@ t � �|� |p|}d| _|}t|t�r2| �|�}| �|� d S r� )r� r� r� r� r" r� r� )r� r� r� r� �enderr� r+ r, r� n s
z_MultipleMatch.__init__c C s, t |t�r| �|�}|d ur"| nd | _| S r; )r� r" r� � not_ender)r� r� r+ r+ r, r� } s
z_MultipleMatch.stopOnTc C s� | j j}| j}| jd u}|r$| jj}|r2|||� ||||�\}}zV| j } |r\|||� | rl|||�}
n|}
|||
|�\}} | s�| �� rN|| 7 }qNW n ttfy� Y n0 ||fS r; ) r� r� r� r� r� r� r� r� r� ) r� r� r� r� �self_expr_parseZself_skip_ignorablesZ check_enderZ
try_not_enderr� ZhasIgnoreExprsr/ Z tmptokensr+ r+ r, r� � s*
z_MultipleMatch.parseImplFc sv t jrhtj| jvrh| jg| j�� D ]B}t|t�r$|jr$tj|jvr$t j
d� d|t | �j
|j�dd� q$t� �||�S r� )r7 rA rI r� r� r� r� r] r� r� r8 r� r� r/ r� r� r� r� r+ r, r� � s2 ��������� z _MultipleMatch._setResultsName)N)T)F) r/ r0 r1 r] r� r r, r� r� r� r� r� r+ r+ r� r, r� m s ���
r� c @ s e Zd ZdZdd� ZdS )rS au
Repetition of one or more of the given expression.
Parameters:
- expr - expression that must match one or more times
- stop_on - (default= ``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).set_parse_action(' '.join))
text = "shape: SQUARE posn: upper left color: BLACK"
OneOrMore(attr_expr).parse_string(text).pprint() # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
# use stop_on attribute for OneOrMore to avoid reading label string as part of the data
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stop_on=label).set_parse_action(' '.join))
OneOrMore(attr_expr).parse_string(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
# could also be written as
(attr_expr * (1,)).parse_string(text).pprint()
c C s dt | j� d S )Nr� z}...r� rb r+ r+ r, r| � s z OneOrMore._generateDefaultNameN)r/ r0 r1 r2 r| r+ r+ r+ r, rS � s rS c s` e Zd ZdZd dd�eeeeef eeeef d�� fdd�Zd
� fdd � Z d
d � Z
� Z S )rR ao
Optional repetition of zero or more of the given expression.
Parameters:
- ``expr`` - expression that must match zero or more times
- ``stop_on`` - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression) - (default= ``None``)
Example: similar to :class:`OneOrMore`
Nr� r� c s t � j||p|d� d| _d S )Nr� Tr� )r� r� r� r� r� r+ r, r� � s zZeroOrMore.__init__Tc s@ zt � �|||�W S ttfy: |tg | jd�f Y S 0 d S )Nrg )r� r� r� r� r r� r� r� r+ r, r� � s zZeroOrMore.parseImplc C s dt | j� d S )N�[z]...r� rb r+ r+ r, r| � s z ZeroOrMore._generateDefaultName)N)T) r/ r0 r1 r2 r] r� r r, r� r� r| r� r+ r+ r� r, rR � s ���
rR c @ s e Zd Zdd� Zdd� ZdS )�
_NullTokenc C s dS r� r+ rb r+ r+ r, �__bool__� s z_NullToken.__bool__c C s dS )NrY r+ rb r+ r+ r, r� � s z_NullToken.__str__N)r/ r0 r1 r� r� r+ r+ r+ r, r� � s r� c sL e Zd ZdZe� Zefeeef e d�� fdd�
Z
d
dd�Z dd � Z � Z
S ) rL aN
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) + Opt('-' + Word(nums, exact=4)))
zip.run_tests('''
# 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)
)r� �defaultc s* t � j|dd� | jj| _|| _d| _d S )NFr� T)r� r� r� r� � defaultValuer� )r� r� r� r� r+ r, r� , s
z Opt.__init__Tc C sx | j }z|j|||dd�\}}W nN ttfyn | j}|| jurf|jr^t|g�}|||j< qj|g}ng }Y n0 ||fS )NFr( )r� r� r� r� r� �_Opt__optionalNotMatchedr� r )r� r� r� r� Z self_exprr� Z
default_valuer+ r+ r, r� 4 s
z
Opt.parseImplc C sJ t | j�}t|�dkr>|dd t|�d � dkr>|dd� }q
d| d S )Nr r r� rk r� �])r, r� r� r� r+ r+ r, r| D s
&zOpt._generateDefaultName)T)r/ r0 r1 r2 r� r� r r] r, r r� r� r| r� r+ r+ r� r, rL s &� �
rL c s\ e Zd ZdZd dd�eeef eeeeeef eeef d�� fdd�Z d d d
�Z
� Z S )
rC 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`` - if ``True``, the target expression is also parsed
(the skipped text and target expression are returned as a 2-element
list) (default= ``False``).
- ``ignore`` - (default= ``None``) used to define grammars (typically quoted strings and
comments) that might contain false matches to the target expression
- ``fail_on`` - (default= ``None``) define expressions that are not allowed to be
included in the skipped test; if found before the target expression is found,
the :class:`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=quoted_string)
string_data.set_parse_action(token_map(str.strip))
ticket_expr = (integer("issue_num") + SEP
+ string_data("sev") + SEP
+ string_data("desc") + SEP
+ integer("days_open"))
for tkt in ticket_expr.search_string(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
FN)�failOn)r@ �includeru �fail_onr� c sd t � �|� |p|}|| _d| _d| _|| _d| _t|t�rJ| � |�| _
n|| _
dt | j � | _
d S )NTFzNo match found for )r� r� �
ignoreExprr� r� � includeMatchr� r� r" r� r� r, r� r� )r� r@ r� ru r� r� r� r+ r, r� � s
zSkipTo.__init__Tc
C s |}t |�}| jj}| jd ur&| jjnd }| jd ur<| jjnd }|} | |kr�|d ur`||| �r`q�|d ur�z||| �} W qh ty� Y q�Y qh0 qhz||| ddd� W q� tt fy� | d7 } Y qD0 q�qDt||| j
| ��| }|||� }
t |
�} | j �r||||dd�\}} | | 7 } || fS )NF)r� r� r r( )
r� r� r� r� r� r r� r r� r� r� r r )
r� r� r� r� r� r� r� Zself_failOn_canParseNextZself_ignoreExpr_tryParseZtmplocZskiptextZ
skipresultr r+ r+ r, r� � s< ��
zSkipTo.parseImpl)FNN)T) r/ r0 r1 r2 r r] r, rZ r� r� r� r� r+ r+ r� r, rC O s ? ��
�rC c s� e Zd ZdZd eeeef d�� fdd�
Zdd� Z dd � Z
� fd
d �Z d d
� Z d!� fdd� Z
d"dd�Zd#dd�Zdd� Zd$dd�Zdd� Z� fdd �Zd%� fd d � ZeZeZ� ZS )&r aw
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 ``Forward``
variable using the ``'<<'`` operator.
Note: take care when assigning to ``Forward`` not to overlook
precedence of operators.
Specifically, ``'|'`` has a lower precedence than ``'<<'``, so that::
fwd_expr << a | b | c
will actually be evaluated as::
(fwd_expr << a) | b | c
thereby leaving b and c out as parseable alternatives. It is recommended that you
explicitly group the values inserted into the ``Forward``::
fwd_expr << (a | b | c)
Converting to use the ``'<<='`` operator instead will avoid this problem.
See :class:`ParseResults.pprint` for an example of a recursive
parser created using ``Forward``.
N)r@ c s, t jdd�d | _t� j|dd� d | _d S )NrJ ri r Fr� )rl r{ � caller_framer� r� � lshift_liner? r� r+ r, r� � s zForward.__init__c C s� t | d�r| `t|t�r"| �|�}|| _| jj| _| jj| _| j| jj | jj
d� | jj | _ | jj | _ | j
�| jj
� tjdd�d | _| S )Nr ri rJ ri ���)r� r r� r" r� r� r� r� rr r� r� r� r� r� r� rl r{ r r? r+ r+ r, �
__lshift__� s
�
zForward.__lshift__c C s | |> S r; r+ r? r+ r+ r, � __ilshift__ s zForward.__ilshift__c sJ t jdd�d }tjr:|| jkr:tj| jvr:tjddd� t � �
|�}|S )NrJ ri r z<using '<<' operator with '|' is probably an error, use '<<='r� ) rl r{ r7 rF r rI r� r� r8 r� rY )r� r@ Z caller_liners r� r+ r, rY s ����� zForward.__or__c C s: | j d u r6tjr6tj| jvr6tjdt| jj | jj
d� d S )NzIForward defined here but no expression attached later using '<<=' or '<<')�filenamer� ) r� r7 rD rI r� r� �
warn_explicit� UserWarningr r r� rb r+ r+ r, �__del__ s ��
��zForward.__del__Tc s� | j d u rrtjrrtj| jvrrg d�}tjdd�}tt|�dd�D ] \}}|j |v r@|d } qdq@d}t
j d|d� t j
s�t� �|||�S t j��� t j} z<| || |f \}
} t| t�r�| �|
| �� fW W d � S t�y\ || d f} || d
f}
|d t||d | �f \}
}| |
< |�r,| |
| | < zt� �||d
�\}}W n, t�yp t|t��rb� |
| }}Y n0 ||
k�r�|�r�| | \}
} | |
< | |
= | | = |
| �� f Y W d � S | |
= |
|�� f Y W d � S |�r@zt� �||d �| | < W n< t�y> } z"||f | |
< | | < � W Y d }~n
d }~0 0 ||f \}
}| |
< �q,Y n0 W d � n1 �st0 Y d S ) N)r$ r0 r7 r6 �� ri r )r) rJ zGForward expression was never assigned a value, will not parse any inputr� TFz#Forward recursion without base case)r� r7 rC rI r� rl r{ r �reversedr: r� r8 r] r r� r� r� r r� r� r� �KeyErrorr� )r� r� r� r� Z parse_fnsrn rW Zfrmr� �memoZprev_locZ prev_resultZact_keyZpeek_keyZ prev_peekZnew_locZnew_peekr� r� r+ r, r� ( st ����
�
��
zForward.parseImplc C s
d| _ | S r� rm rn r+ r+ r, rp � s zForward.leave_whitespacec C s
d| _ | S r� rm rn r+ r+ r, ro � s zForward.ignore_whitespacec C s$ | j s d| _ | jd ur | j�� | S r� )r� r� r rb r+ r+ r, r � s
zForward.streamlinec C sJ |d u r g }| |vr<|d d � | g }| j d ur<| j �|� | �g � d S r; r� r� r+ r+ r, r� � s
zForward.validatec C sb d| _ d}z4| jd ur*t| j�d d� }nd}W | jjd | S | jjd | Y S 0 d S )Nz: ...r� i� �Nonez: )r� r� r, rx r/ )r� Z retStringr+ r+ r, r| � s
z Forward._generateDefaultNamec s* | j d urt� �� S t� }|| K }|S d S r; )r� r� r� r r� r� r+ r, r� � s
z Forward.copyFc sH t jr:tj| jvr:| jd u r:tjd�d|t| �j �dd� t
� � ||�S )NzO{}: setting results name {!r} on {} expression that has no contained expressionrB rK r� ) r7 rB rI r� r� r� r8 r� r� r/ r� r� )r� r: r� r� r+ r, r� � s ���
��zForward._setResultsName)N)T)T)T)N)F)r/ r0 r1 r2 r� r r] r, r� r r rY r
r� rp ro r r� r| r� r� r� r� r� r+ r+ r� r, r � s _
r c s0 e Zd ZdZdeeef d�� fdd�
Z� ZS )�TokenConverterzW
Abstract subclass of :class:`ParseExpression`, for converting parsed results.
Fr� c s t � �|� d| _d S r� )r� r� r� r� r� r+ r, r� � s zTokenConverter.__init__)F) r/ r0 r1 r2 r r] r, r� r� r+ r+ r� r, r � s r c sL e Zd ZdZd
dd�eeeee d�� fdd�Z� fd d
�Z d d � Z
� Z S )�Combinea� 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
``'adjacent=False'`` in the constructor.
Example::
real = Word(nums) + '.' + Word(nums)
print(real.parse_string('3.1416')) # -> ['3', '.', '1416']
# will also erroneously match the following
print(real.parse_string('3. 1416')) # -> ['3', '.', '1416']
real = Combine(Word(nums) + '.' + Word(nums))
print(real.parse_string('3.1416')) # -> ['3.1416']
# no match when there are internal spaces
print(real.parse_string('3. 1416')) # -> Exception: Expected W:(0123...)
rY TN)�
joinString)r� � join_string�adjacentr c sD t � �|� |d ur|n|}|r(| �� || _d| _|| _d| _d S r� )r� r� rp r r� r r� )r� r� r r r r� r+ r, r� � s zCombine.__init__c s$ | j rt�| |� n t� �|� | S r; )r r] ru r� r? r� r+ r, ru � s zCombine.ignorec C sP |� � }|d d �= |td�|�| j��g| jd�7 }| jrH|�� rH|gS |S d S )NrY )r� )r� r r4 Z
_asStringListr r� r� r� )r� r� r� r� ZretToksr+ r+ r, r� s
�zCombine.postParse)rY T) r/ r0 r1 r2 r] r, rZ r� r� ru r� r� r+ r+ r� r, r � s ��� r c s2 e Zd ZdZdeed�� fdd�
Zdd� Z� ZS ) r� a� Converter to return the matched tokens as a list - useful for
returning tokens of :class:`ZeroOrMore` and :class:`OneOrMore` expressions.
The optional ``aslist`` argument when set to True will return the
parsed tokens as a Python list instead of a pyparsing ParseResults.
Example::
ident = Word(alphas)
num = Word(nums)
term = ident | num
func = ident + Opt(delimited_list(term))
print(func.parse_string("fn a, b, 100"))
# -> ['fn', 'a', 'b', '100']
func = ident + Group(Opt(delimited_list(term)))
print(func.parse_string("fn a, b, 100"))
# -> ['fn', ['a', 'b', '100']]
F)r� �aslistc s t � �|� d| _|| _d S r� )r� r� r� �
_asPythonList)r� r� r r� r+ r, r� # s zGroup.__init__c C s0 | j r&t�t|t�r |�� nt|��S |gS d S r; )r r r r� r� r� r� r+ r+ r, r� ( s �
�zGroup.postParse)F� r/ r0 r1 r2 r] rZ r� r� r� r+ r+ r� r, r� s r� c s2 e Zd ZdZdeed�� fdd�
Zdd� Z� ZS ) r as 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.
The optional ``asdict`` argument when set to True will return the
parsed tokens as a Python dict instead of a pyparsing ParseResults.
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stop_on=label).set_parse_action(' '.join))
# print attributes as plain groups
print(OneOrMore(attr_expr).parse_string(text).dump())
# instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
result = Dict(OneOrMore(Group(attr_expr))).parse_string(text)
print(result.dump())
# access named fields as dict entries, or output as dict
print(result['shape'])
print(result.as_dict())
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 :class:`ParseResults` of accessing fields by results name.
F)r� �asdictc s t � �|� d| _|| _d S r� )r� r� r� �
_asPythonDict)r� r� r r� r+ r, r� ] s z
Dict.__init__c C s4 t |�D ]�\}}t|�dkr q|d }t|t�r<t|��� }t|�dkrXtd|�||< qt|�dkr�t|d t�s�t|d |�||< qz |�� }W n t y� t
d�}|d �Y n0 |d= t|�dks�t|t�r�|� � r�t||�||< qt|d |�||< q| j �r | j
�r|�� gS |�� S | j
�r,|gS |S d S )Nr r rY rJ zdcould not extract dict values from parsed results - Dict expression must contain Grouped expressions)r r� r� rQ r, r� r r r� r� rp r� r r� Zas_dict) r� r� r� r� rW �tokZikeyZ dictvaluer� r+ r+ r, r� b s8
� ��zDict.postParse)Fr r+ r+ r� r, r 3 s )r c sZ e Zd ZdZdeeef ed�� fdd�
Z� fdd�Z � fdd �Z
d
d � Z d d
� Z � Z
S )rj a� 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.parse_string(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.parse_string(source))
# Skipped text (using '...') can be suppressed as well
source = "lead in START relevant text END trailing text"
start_marker = Keyword("START")
end_marker = Keyword("END")
find_body = Suppress(...) + start_marker + ... + end_marker
print(find_body.parse_string(source)
prints::
['a', ',', 'b', ',', 'c', ',', 'd']
['a', 'b', 'c', 'd']
['START', 'relevant text ', 'END']
(See also :class:`delimited_list`.)
Fr� c s" |du rt t� �}t� �|� d S )N.)r= r� r� r� r� r� r+ r, r� � s
zSuppress.__init__c s, t | jt�r tt|��| S t� �|�S d S r; )r� r� r= rj rC r� rA r? r� r+ r, rA � s zSuppress.__add__c s, t | jt�r tt|��| S t� �|�S d S r; )r� r� r= rj rC r� rF r? r� r+ r, rF � s zSuppress.__sub__c C s g S r; r+ r� r+ r+ r, r� � s zSuppress.postParsec C s | S r; r+ rb r+ r+ r, rk � s zSuppress.suppress)F)r/ r0 r1 r2 r r] r, rZ r� rA rF r� rk r� r+ r+ r� r, rj � s rj �r� c s t � �� � fdd�}� j|_|S )av Decorator for debugging parse actions.
When the parse action is called, this decorator will print
``">> entering method-name(line:<current_source_line>, <parse_location>, <matched_tokens>)"``.
When the parse action completes, the decorator will print
``"<<"`` followed by the returned value, or any exception that the parse action raised.
Example::
wd = Word(alphas)
@trace_parse_action
def remove_duplicate_chars(tokens):
return ''.join(sorted(set(''.join(tokens))))
wds = OneOrMore(wd).set_parse_action(remove_duplicate_chars)
print(wds.parse_string("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 }| dd � \}}}t| �dkr8| d jj d | }tj�d�|t||�||�� z � | � }W n: ty� } z"tj�d�||�� � W Y d }~n
d }~0 0 tj�d�||�� |S )N���rK r �.z$>>entering {}(line: {!r}, {}, {!r})
z <<leaving {} (exception: {})
z<<leaving {} (ret: {!r})
) r/ r� rx r� �stderrr� r� r� r� )ZpaArgsZthisFuncrd re rf rs r� r r+ r, �z� s � z trace_parse_action.<locals>.z)r~ r/ )r� r r+ r r, �trace_parse_action� s r �empty�
line_start�line_end� string_start�
string_endz\[]-*.$+^?()~ )r c C s |d d S r} r+ rc r+ r+ r, rh � r. rh z\\0?[xX][0-9a-fA-F]+c C s t t|d �d�d��S )Nr z\0xr% )�chrrQ r� rc r+ r+ r, rh � r. z \\0[0-7]+c C s t t|d dd � d��S )Nr r � )r& rQ rc r+ r+ r, rh � r. z\]r� r� �^�negate�bodyr� c sD dd� � z"d� � fdd�t�| �jD ��W S ty> Y dS 0 dS )a Helper to easily define string ranges for use in :class:`Word`
construction. Borrows syntax from regexp ``'[]'`` string range
definitions::
srange("[0-9]") -> "0123456789"
srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz"
srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
The input string must be enclosed in []'s, and the returned string
is the expanded character set joined into a single string. The
values enclosed in the []'s may be:
- a single character
- an escaped character with a leading backslash (such as ``\-``
or ``\]``)
- an escaped hex character with a leading ``'\x'``
(``\x21``, which is a ``'!'`` character) (``\0x##``
is also supported for backwards compatibility)
- an escaped octal character with a leading ``'\0'``
(``\041``, which is a ``'!'`` character)
- a range of any of the above, separated by a dash (``'a-z'``,
etc.)
- any combination of the above (``'aeiouy'``,
``'a-zA-Z0-9_$'``, etc.)
c S s< t | t�s| S d�dd� tt| d �t| d �d �D ��S )NrY c s s | ]}t |�V qd S r; )r& r` r+ r+ r, rb ) r. z+srange.<locals>.<lambda>.<locals>.<genexpr>r r )r� r r4 rY �ord)�pr+ r+ r, rh ' s �zsrange.<locals>.<lambda>rY c 3 s | ]}� |�V qd S r; r+ )r) �part�Z _expandedr+ r, rb , r. zsrange.<locals>.<genexpr>N)r4 �_reBracketExprr$ r* r� )rd r+ r. r, �srange s �" r0 c s, � �fdd�}t �dt �d�j�}||_|S )ag Helper to define a parse action by mapping a function to all
elements of a :class:`ParseResults` list. If any additional args are passed,
they are forwarded to the given function as additional arguments
after the token, as in
``hex_integer = Word(hexnums).set_parse_action(token_map(int, 16))``,
which will convert the parsed data to an integer using base 16.
Example (compare the last to example in :class:`ParserElement.transform_string`::
hex_ints = OneOrMore(Word(hexnums)).set_parse_action(token_map(int, 16))
hex_ints.run_tests('''
00 11 22 aa FF 0a 0d 1a
''')
upperword = Word(alphas).set_parse_action(token_map(str.upper))
OneOrMore(upperword).run_tests('''
my kingdom for a horse
''')
wd = Word(alphas).set_parse_action(token_map(str.title))
OneOrMore(wd).set_parse_action(' '.join).run_tests('''
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 � �fdd�|D �S )Nc s g | ]}�|g� �R � �qS r+ r+ )r) Ztokn�rr rg r+ r, r- W r. z)token_map.<locals>.pa.<locals>.<listcomp>r+ rc r1 r+ r, r� V s ztoken_map.<locals>.par/ rx )r| r/ )rg rr r� r} r+ r1 r, � token_map1 s %r2 c C s8 t �� jj�� D ]"\} }t|t�r|js|�| � qdS )zy
Utility to simplify mass-naming of parser elements, for
generating railroad diagram with named subdiagrams.
N) r� � _getframe�f_back�f_localsr6 r� r] r� r )r: �varr+ r+ r, �autoname_elements_ s r7 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 literalz#[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]z[\0xa1-\0xbf\0xd7\0xf7]c C s g | ]}t |t�r|�qS r+ )r� r] )r) r9 r+ r+ r, r- ~ r. r- )rJ )NF)F)F)F)��osrt r r� r r� r r r r r r r
r r r� �abcr
r �enumr r_ r� r� r� r r� �collections.abcrl �types�operatorr � functoolsr � threadingr �pathlibr �utilr r r r r r r r r r r �
exceptions�actionsr
r r Zunicoder! �maxsizer� r, �bytesr" r� r� r# r7 rI rQ rR r? rZ r\ � warnoptions�environr� �sumr� r r r� rP r� r� r� r+ r ry �
GeneratorTyper� rQ r� r� r� r� r� r� r� Zascii_uppercaseZascii_lowercaseZalphasZLatin1Z
identcharsZidentbodycharsZnumsZhexnumsr� r4 Z printabler{ rz r~ r� r� r� r� r� r] r= r� r! r� r� r� r� r� r� r r r r# r) r+ rB r^ rd rk rl ro rr rt r" rv r r� r> r[ rX r^ r� r� r� r� r� r� r� ra r� rS rR r� rL rC r r r r� rj r r r! r" r# r$ r% r� Z _escapedPuncZ_escapedHexCharZ_escapedOctCharZ _singleCharZ
_charRanger� r/ r0 r2 r7 Zdbl_quoted_stringZsgl_quoted_stringr� Zunicode_stringZ
alphas8bitZpunc8bitr� �valuesr� ZtokenMapZconditionAsParseActionZnullDebugActionZsglQuotedStringZdblQuotedStringZ quotedStringZ
unicodeStringZ lineStartZlineEndZ stringStartZ stringEndZtraceParseActionr+ r+ r+ r, �<module> s�
4
, ! � ��
��
���
? �� �� �� �� !) -vY q
EPM / " m (]@!$Q*+N !I w
9%W70 ���� ����%.
��
��
���