관리-도구
편집 파일: core.cpython-38.pyc
U ʗRe`A � @ s� U d dl Z d dlZd dlmZmZmZmZmZmZmZm Z m Z m Z d dl m Z mZ d dlmZ d dlZd dlZd dlZd dlZd dlZd dlmZ d dlZd dlZd dlmZ 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+m,Z- d d l.T d d l/T d d l0m1Z1m2Z2 d dl3m4Z4 ej5Z6e7e8fZ9ee:df e;d< ej<dk�rbd dl m=Z= nG dd� d�Z=G dd� de%�Z>G dd� de%�Z?G dd� de�Z@e@dd�d d �ZAe@dd�d d �ZBdd �d!d"�ZC[%eje7 ejDe7 eEd#�d$d%�ZFeFejGe jH�Id&���r eC� eJeKeLeMeNeOePeQeReSeTh ZUejVZWeeg ef ee1gef eeXe1gef ee7eXe1gef f ZYeeg eEf ee1geEf eeXe1geEf ee7eXe1geEf f ZZee7eXd'e[gdf Z\ee7eXd'eEgdf Z]ee7eXeXd'e1eEgdf Z^ee7eXd'e[eEgdf Z_ej`eja Zbe4jcjdZde4jcjeZed(Zfefd) Zgebef Zhd*�id+d,� ejjD ��Zkdalejme;d-< d�d/d0�Znd�eZe7eEeYd2�d3d4�Zod�e7eXd'eEd5�d6d7�Zpd�e7eXeXd'e1eEd8�d9d:�Zqd�e7eXd'e[eEd;�d<d=�Zrd>d?� ZsG d@d'� d'e �ZtG dAdB� dBet�ZuG dCdD� dDet�ZvG dEdF� dFev�ZwG dGdH� dHev�ZxG dIdJ� dJev�ZyG dKdL� dLey�Zzeyet_{G dMdN� dNev�Z|G dOdP� dPey�Z}G dQdR� dRe|�Z~G dSdT� dTev�ZG dUdV� dVev�Z�G dWdX� dXe��Z�G dYdZ� dZe��Z�G d[d\� d\ev�Z�G d]d^� d^ev�Z�G d_d`� d`ev�Z�G dadb� dbev�Z�G dcdd� ddev�Z�G dedf� dfe��Z�G dgdh� dhe��Z�G didj� dje��Z�G dkdl� dle��Z�G dmdn� dne��Z�G dodp� dpe��Z�G dqdr� dre��Z�G dsdt� dtet�Z�G dudv� dve��Z�G dwdx� dxe��Z�G dydz� dze��Z�G d{d|� d|e��Z�G d}d~� d~et�Z�G dd�� 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�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�ZDG 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�e��Z�eYeYd��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�e7e7d��d�d��Z�eYd �d�d��Z�dd �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�dZ�d�d,� e�� ��� D �Z�eet e;d�< e�Z�eoZ�esZ�e�Z�e�Z�e�Z�e�Z�e�Z�e�Z�e�Z�e�Z�e�Z�dS )�� N) � NamedTuple�Union�Callable�Any� Generator�Tuple�List�TextIO�Set�Sequence)�ABC�abstractmethod)�Enum)�Iterable)� 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_type)� � )�cached_propertyc @ s e Zd Zdd� Zddd�ZdS )r% c C s || _ d S �N)�_func)�self�func� r* ��/builddir/build/BUILDROOT/alt-python38-pip-22.2.1-2.el8.x86_64/opt/alt/python38/lib/python3.8/site-packages/pip/_vendor/pyparsing/core.py�__init__Q s zcached_property.__init__Nc C s | � |� }|j| j j< |S r& )r' �__dict__�__name__)r( �instance�owner�retr* r* r+ �__get__T s zcached_property.__get__)N)r. � __module__� __qualname__r, r2 r* r* r* r+ r% P s r% c @ 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 � compatibilityTc C s g | ]}|� d �s|�qS ��_�� startswith��.0�__r* r* r+ � <listcomp>j s z__compat__.<listcomp>z( collect_all_And_tokens N) r. r3 r4 �__doc__� _type_desc�collect_all_And_tokens�locals� _all_names�split� _fixed_namesr* r* r* r+ r5 Y s r5 c @ sn e Zd ZdZdZdZdZdZdZdZ dZ dZ dd� e � D �Z dd� e D �Zdd� e D �Zedd�d d ��ZdS ) �__diag__� diagnosticFc C s g | ]}|� d �s|�qS r7 r9 r; r* r* r+ r> | s z__diag__.<listcomp>c C s g | ]}|� d �r|�qS )�warnr9 �r< �namer* r* r+ r> } s c C s g | ]}|� d �r|�qS )Z enable_debugr9 rI r* r* r+ r> ~ s N��returnc C s | j D ]}| �|� qd S r& )�_warning_names�enable)�clsrJ r* r* r+ �enable_all_warnings� s z __diag__.enable_all_warnings)r. r3 r4 r@ �)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_expressionsrB rC rM � _debug_names� classmethodrP r* r* r* r+ rF p s rF 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 � r# � � � � N) r. r3 r4 r? rQ rR rS rT rU rV rW rX r* r* r* r+ r[ � s r[ )� diag_enumrL c C s t �| j� dS )zO Enable a global pyparsing diagnostic flag (see :class:`Diagnostics`). N)rF rN rJ �ra r* r* r+ � enable_diag� s rc c C s t �| j� dS )zP Disable a global pyparsing diagnostic flag (see :class:`Diagnostics`). N)rF �disablerJ rb r* r* r+ � disable_diag� s re rK c C s t �� dS )zU Enable all global pyparsing diagnostic warnings (see :class:`Diagnostics`). N)rF rP r* r* r* r+ rP � s rP )�cmd_line_warn_options� warn_env_varrL c C sx t |�}| D ]f}|d �d�d d� \}}}}}|�� �d�sX|sJ|sJ|rR|dkrXd}q |�� �d�r |dkr d}q |S ) Nz::::�:r^ �i� pyparsingT)rj � F)�boolrD �lowerr: ) rf rg rN �warn_opt�w_action� w_message� w_category�w_module�w_liner* r* r+ �_should_enable_warnings� s( ������rt ZPYPARSINGENABLEALLWARNINGS� ParserElement� 0123456789Z ABCDEFabcdefrk c C s g | ]}|t jkr|�qS r* )�string� whitespace�r< �cr* r* r+ r> s r> �_trim_arity_call_liner# c s� �t kr�fdd�S d�d�ddd�� d}tp<tjdd �d atd td | f�� �����fd d �}t�dt�d�j�}||_�j|_|S )zAdecorator to trim function calls to match the arity of the targetc s � |�S r& r* ��s�l�t)r) r* r+ �<lambda> � z _trim_arity.<locals>.<lambda>r Fc S s$ t j| |d�}|d }|d d� gS )N��limit���r\ )� traceback� extract_tb)�tbr� �frames� frame_summaryr* r* r+ r� s z _trim_arity.<locals>.extract_tbr` r\ r� r� r c s� z�| �d � � }d�|W S t k r� } zN�r4� nB|j}� |dd�d d d� �k}~|rt��k rt�d7 �W Y �q � W 5 d }~X Y q X q d S )NTr\ r� r� r )� TypeError� __traceback__)�argsr1 �ter� �trim_arity_type_error�r� � found_arityr) r� � max_limit�pa_call_line_synthr* r+ �wrapper s �z _trim_arity.<locals>.wrapperr. � __class__)r )�_single_arg_builtinsr{ r� � extract_stack�getattrr. r? )r) r� � LINE_DIFFr� � func_namer* r� r+ � _trim_arity s r� F)�fn�message�fatalrL c s@ |dk r |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& )rl r| ��exc_typer� �msgr* r+ �paV s z%condition_as_parse_action.<locals>.pa)�ParseFatalException�ParseExceptionr� r )r� r� r� r� r* r� r+ �condition_as_parse_actionB s r� )�instring�loc�expr� cache_hitc C sJ |rdnd}t d�|||t|| �t|| �t|| �dt|| �d �� d S )Nr rk z&{}Match {} at loc {}({},{}) {} {}^� r )�print�format�lineno�col�line)r� r� r� r� � cache_hit_strr* r* r+ �_default_start_debug_action^ s ��r� )r� �startloc�endlocr� �toksr� c C s& |rdnd}t d�|||�� �� d S )Nr rk z{}Matched {} -> {})r� r� �as_list)r� r� r� r� r� r� r� r* r* r+ � _default_success_debug_actionq s r� )r� r� r� �excr� c C s* |rdnd}t d�||t|�j|�� d S )Nr rk z {}Match {} failed, {} raised: {})r� r� �typer. )r� r� r� r� r� r� r* r* r+ � _default_exception_debug_action} s ��r� c G s dS )zG'Do-nothing' debug action, to suppress debugging output during parsing.Nr* )r� r* r* r+ �null_debug_action� s r� c @ st e Zd ZU dZdZeed< dZeed< dZ e j e ed< e edd�d d ��Ze e dd �d d ��ZG dd� de�Zd�ed�dd�Zed d�dd�Zd d�dd�Zd�dd�eeed d�dd �Zd�d d �Zd�ed d �d!d"�Zed d#�d$d%�Zed d#�d&d'�Ze d d#�d(d)�Z e d d*�d+d,�Z d-d.� Z d/d0� Z!d�d1d2�Z"d3d4� Z#d�e$e%e&f d�d5d6�Z'd�ee%ee%d7�d8d9�Z(ee%ed:�d;d<�Z)e*� Z+i Z,e j-e$e%d=ef e$e%e.e&e/f f f ed>< i Z0e*� Z1d?d?gZ2d�e$e%e&f d�d@dA�Z3e'Z4e dd�dBdC��Z5dZ6dZ7e dd�dDdE��Z8e d�ddF�e j e% ddG�dHdI��Z9e d�ddF�e%eddK�dLdM��Z:d�ddN�eeee&dO�dPdQ�Z;e<dfde<dR�ee%eee%e=e$e&e%e%f ddf dS�dTdU�Z>ddV�eeedW�dXdY�Z?e<fde<dR�ee%ee%e&dZ�d[d\�Z@e<dfdd]�ee%ee=eddf d^�d_d`�ZAd d�dadb�ZBd d�dcdd�ZCd d�dedf�ZDd d�dgdh�ZEd d�didj�ZFd d�dkdl�ZGd d�dmdn�ZHd d�dodp�ZId d�dqdr�ZJd d�dsdt�ZKd d�dudv�ZLd d�dwdx�ZMd d�dydz�ZNdZOd{d|� ZPd�ed d}�d~d�ZQd d�d�d��ZRd�ed d��d�d��ZSd�ed d��d�d��ZTd�e.eUe ef ed d��d�d��ZVd d�d�d��ZWd d d��d�d��ZXeYeZe[d d��d�d��Z\d�ed d��d�d��Z]e^ed�d�d���Z_e`d�d�� �Zaed d}�d�d��Zbe^ed�d�d���Zced�d�d��Zded�d�d��Zed d�d�d��Zfegd d�d�d��Zhd�d�� Zid�dd�d�d��Zjd�ddN�e.eekelf eeee&d��d�d��Zmd�d�� Znd�d�� Zod�d dN�eeeed��d�d��Zpd�d d d ddd��e.eeqe f ee j e.d ef eeeeree&gef e j el eeeeeeree&gef e$eeqe$ee.e&e/f f f d��d�d��Zsd�e.elekef e%eedd��d�d��ZteZueZveZweZxeZyeZze Z{e Z|e(Z}e)Z~e5Ze9Z�e:Z�e;Z�e>Z�e@Z�e?Z�eVZ�eWZ�e\Z�e]Z�e_Z�ebZ�emZ�esZ�eSZ�eTZ�dS )�ru z)Abstract base level parser element class.z �DEFAULT_WHITE_CHARSF�verbose_stacktraceN�_literalStringClass)�charsrL c C s$ | t _tD ]}|jr t| �|_q dS )a� Overrides the default whitespace chars Example:: # default whitespace chars are space, <TAB> and newline Word(alphas)[1, ...].parse_string("abc def\nghi jkl") # -> ['abc', 'def', 'ghi', 'jkl'] # change to just treat newline as significant ParserElement.set_default_whitespace_chars(" \t") Word(alphas)[1, ...].parse_string("abc def\nghi jkl") # -> ['abc', 'def'] N)ru r� �_builtin_exprs�copyDefaultWhiteChars�set� whiteChars)r� r� r* r* r+ � set_default_whitespace_chars� s z*ParserElement.set_default_whitespace_chars)rO rL 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)ru r� )rO r* r* r+ �inline_literals_using� s z#ParserElement.inline_literals_usingc @ s8 e Zd ZU eje ed< eje ed< eje ed< dS )zParserElement.DebugActions� debug_try� debug_match� debug_failN) r. r3 r4 �typing�Optional�DebugStartAction�__annotations__�DebugSuccessAction�DebugExceptionActionr* r* r* r+ � DebugActions� s r� ��savelistc C s� t � | _d | _d | _d | _d | _|| _d| _tt j �| _ d| _ d| _ d| _t � | _d| _d| _d| _d| _d| _| �d d d �| _d| _d| _g | _d S )NTFrk )�list� parseAction� failAction� customName� _defaultName� resultsName� saveAsList�skipWhitespacer� ru r� r� r� �mayReturnEmpty�keepTabs� ignoreExprs�debug� streamlined� mayIndexError�errmsg� modalResultsr� � debugActions� callPreparse� callDuringTry�suppress_warnings_)r( r� r* r* r+ r, � s* zParserElement.__init__)� warning_typerL c 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_warningrK c C s@ t � | �}| jdd� |_| jdd� |_| jr<ttj�|_|S )a7 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((integerK | integerM | integer)[1, ...].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� ru r� r� )r( �cpyr* r* r+ r� � s zParserElement.copy)�listAllMatches)rJ �list_all_matchesr� rL 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( rJ r� r� r* r* r+ �set_results_name s z ParserElement.set_results_namec C s@ |d kr | S | � � }|�d�r.|d d� }d}||_| |_|S )Nr r� T)r� �endswithr� r� )r( rJ r� �newselfr* r* r+ r� 1 s z ParserElement._setResultsNameT)� break_flagrL 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 )�pdb� set_trace)r� r� � doActions� callPreParser� �� _parseMethodr* r+ �breakerE s z(ParserElement.set_break.<locals>.breaker�_originalParseMethod)TT)�_parser� �hasattr)r( r� r� r* r� r+ � set_break< s zParserElement.set_break)�fnsrL c O sZ t |�dgkrg | _n@tdd� |D ��s0td��dd� |D �| _|�d|�dd ��| _| S ) ao 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(instring, loc, toks): from datetime import date year, month, day = toks[::2] try: date(year, month, day) except ValueError: raise ParseException(instring, loc, "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+ � <genexpr>� s z1ParserElement.set_parse_action.<locals>.<genexpr>z parse actions must be callablec S s g | ] }t |��qS r* �r� r� r* r* r+ r> � s z2ParserElement.set_parse_action.<locals>.<listcomp>�call_during_tryr� F)r� r� �allr� �getr� �r( r� �kwargsr* r* r+ �set_parse_actionS s K �z ParserElement.set_parse_actionc O s8 | j dd� |D �7 _ | jp0|�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`. c S s g | ] }t |��qS r* r r� r* r* r+ r> � s z2ParserElement.add_parse_action.<locals>.<listcomp>r r� F)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� rL 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 sN d}|rJd}| j D ]4}z|�||�\}}d}qW q tk rD Y qX qq|S �NTF)r� r� r� )r( r� r� � exprsFound�e�dummyr* r* r+ �_skipIgnorables� s z ParserElement._skipIgnorablesc C sH | j r| �||�}| jrDt|�}| j}||k rD|| |krD|d7 }q&|S �Nr )r� r r� �lenr� )r( r� r� �instrlen� 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 sx d\}}}| j }t|�} |s$| j�r z�|r>| jr>| �||�} n|} | } | jjr`| j�|| | d� | jsn| | kr�z| �|| |�\}} W q� t k r� t || | j | ��Y q�X n| �|| |�\}} W nZ t k �r } z:| jj r�| j� || | | d� | j�r| �|| | | � � W 5 d } ~ X Y nX n�|�r:| j�r:| �||�} n|} | } | j�sT| | k�r�z| �|| |�\}} W n& t k �r� t || | j | ��Y nX n| �|| |�\}} | �||| �} t| | j| j| jd�}| j�rJ|�s�| j�rJ|�r�z�| jD ]�}z||| |�} W n2 t k �r4 } zt d�}||�W 5 d }~X Y nX | d k �r�| |k �r�t| | j| j�oft| ttf�| jd�}�q�W nD t k �r� } z$| jj �r�| j� || | | d� � W 5 d } ~ X Y nX n�| jD ]�}z||| |�} W n2 t k �r } zt d�}||�W 5 d }~X Y nX | d k �r�| |k �r�t| | j| j�o<t| ttf�| jd�}�q�|�rp| jj�rp| j�|| || |d� ||fS )N�r r r\ F)�asList�modalz exception raised in parse action)r� r r� r� r r� r� r� r � IndexErrorr� r� � Exceptionr� r r r� r� r� r� r� � isinstancer� r� )r( r� r� r� r� �TRY�MATCH�FAIL� debugging� len_instring�pre_loc� tokens_start�tokens�err� ret_tokensr� �parse_action_excr� r* r* r+ � _parseNoCache s� � � � � � �zParserElement._parseNoCache)r� r� � raise_fatalrL c C sF z| j ||dd�d W S tk r@ |r,� t||| j| ��Y nX d S )NF�r� r )r� r� r� r� )r( r� r� r+ r* r* r+ � try_parsen s zParserElement.try_parse)r� r� rL c C s4 z| � ||� W n ttfk r* Y dS X dS d S )NFT)r- r� r )r( r� r� r* r* r+ �can_parse_nextv s z ParserElement.can_parse_next�Forward�recursion_memosr c C s d\}}d\}}} | ||||f} t j��� t j} | �| �} | | jkr�t j| d7 < z| �||||�} W n8 tk r� } z| �| | j | j � � � W 5 d } ~ X Y n0X | �| | d | d � � |f� | W 5 Q R � S �n"t j| d7 < | j �r*| j j�r*z| j j||| dd� W n tk �r( Y nX t| t��r~| j �rz| j j�rzz| j j||| | dd� W n tk �rx Y nX | �| d | d � � | d }}}| j �r�| j j�r�z | j j|||| |dd� W n tk �r� Y nX ||fW 5 Q R � S W 5 Q R X d S )N)r r r r r T)r� r\ )ru �packrat_cache_lock� packrat_cacher � not_in_cache�packrat_cache_statsr* �ParseBaseExceptionr� r� r� r� r� r� r� r� r r r� r� )r( r� r� r� r� �HIT�MISSr r r! �lookup�cache�value�pe�loc_�resultr� r* r* r+ � _parseCache� s` � � zParserElement._parseCachec C s2 t j�� dgtt j� t jd d �< t j�� d S r� )ru r2 �clearr r4 r0 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)ru r@ �_left_recursion_enabled�_packratEnabledr* r� r* r* r* r+ �disable_memoization� s z!ParserElement.disable_memoization)�force)�cache_size_limitrL c C sZ |rt �� nt jr td��| dkr.t� t _n"| dkrDt| d�t _n td| ��dt _dS )a4 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:: from pip._vendor 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 )�capacityzMemo size of %sT) ru rC rB � RuntimeError�_UnboundedMemor0 �_LRUMemo�NotImplementedErrorrA �rE rD r* r* r+ �enable_left_recursion� s $ z#ParserElement.enable_left_recursion� )rE rD rL c C sP |rt �� nt jr td��t jsLdt _| dkr:t� t _n t| �t _t jt _ dS )aw 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:: from pip._vendor 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. rF TN) ru rC rA rH rB r r2 r r> r� rL r* r* r+ �enable_packrat s z ParserElement.enable_packrat)�parseAll)r� � parse_allrP rL c C s� |p|}t �� | js | �� | jD ] }|�� q$| js@|�� }z<| �|d�\}}|rz| �||�}t � t � }|�||� W n6 t k r� } zt j r�� n |� d��W 5 d}~X Y nX |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)ru r@ r� � streamliner� r� � expandtabsr� r �Empty� StringEndr5 r� �with_traceback) r( r� rQ rP r r� r& �ser� r* r* r+ � parse_string4 s& - zParserElement.parse_string)r� � maxMatches)r� � max_matches�overlapr� rY rL 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 k r� | d }Y qdX | |k�r | d7 } |r�t |�� | | d�� || | fV |�r| ||�}||k�r | }n|d7 }n| }qd| d }qdW n: tk �rb } zt j�rH� n |�d��W 5 d}~X Y nX 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� rR r� r� �strrS r r r� ru � resetCacher� r� r r5 r� rV )r( r� rZ r[ r� rY r r r� � preparseFn�parseFn�matches�preloc�nextLocr& �nextlocr� r* r* r+ � scan_stringy sR ' �� zParserElement.scan_string�r� )r� r� rL c C s� g }d}d| _ z�| j||d�D ]f\}}}|�|||� � |r�t|t�rV||�� 7 }n*t|t�rvt|t�sv|�|� n |�|� |}q |�||d� � dd� |D �}d� dd� t |�D ��W S t k r� } zt j rڂ n |�d��W 5 d}~X Y nX 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 Tri Nc S s g | ] }|r|�qS r* r* �r< �or* r* r+ r> � s z2ParserElement.transform_string.<locals>.<listcomp>rk c S s g | ] }t |��qS r* �r` )r< r} r* r* r+ r> � s )r� rh r� r r r� r r" �extend�joinr r5 ru r� rV ) r( r� r� �out�lastEr r} r r� r* r* r+ �transform_string� s( z ParserElement.transform_string)r� rZ r� rY rL c C sf t ||�}z tdd� | j|||d�D ��W S tk r` } ztjrF� n |�d��W 5 d}~X Y nX 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< r r} r r* r* r+ r> s z/ParserElement.search_string.<locals>.<listcomp>ri N)r_ r rh r5 ru r� rV )r( r� rZ r� rY r� r* r* r+ � search_string s �zParserElement.search_string)�includeSeparators)r� �maxsplit�include_separatorsrL 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 )rZ N)rh ) r( r� rt ru rs �lastr r} r r* r* r+ rD ( s zParserElement.splitc C sN |t krt| �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� ru r� r� r� r. �And�r( �otherr* r* r+ �__add__H s ��zParserElement.__add__c C sR |t krt| �d�| S t|t�r,| �|�}t|t�sJtd�t|�j ���|| S )zd Implementation of ``+`` operator when left operand is not a :class:`ParserElement` � _skipped*rw ) rx �SkipTor r" r� ru r� r� r� r. r{ r* r* r+ �__radd__p 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 rw ) r r" r� ru r� r� r� r. rz � _ErrorStopr{ r* r* r+ �__sub__� 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` rw �r r" r� ru r� r� r� r. r{ r* r* r+ �__rsub__� s ��zParserElement.__rsub__c s$ |t krd}n8t|t�rF|dd� t fkrFd|dd� d dd� }t|t�r^|d }}�nt|t��rRtdd � |D ��}|d dd� }|d dkr�d|d f}t|d t��r |d dk�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& r\ r c s s | ]}|t k r|nd V qd S r& )rx rj r* r* r+ r� � s 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+ r� � s 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+ r� � s z/ParserElement.__mul__.<locals>.makeOptionalList) rx r �tuple�int� ZeroOrMore� OneOrMorer� r� rn r� r. � ValueErrorrz )r( r| � minElements� optElementsr1 r* r� r+ �__mul__� sb ���� � zParserElement.__mul__c C s | � |�S r& )r� r{ r* r* r+ �__rmul__� s zParserElement.__rmul__c C sR |t krt| dd�S t|t�r(| �|�}t|t�sFtd�t|�j ���t | |g�S )zP Implementation of ``|`` operator - returns :class:`MatchFirst` T)� must_skiprw ) rx ry r r" r� ru r� 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` rw r� 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` rw ) r r" r� ru r� 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` rw r� 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` rw ) r r" r� ru r� r� r� r. �Eachr{ r* r* r+ �__and__1 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` rw r� r{ r* r* r+ �__rand__? s ��zParserElement.__rand__c C s t | �S )zL Implementation of ``~`` operator - returns :class:`NotAny` )�NotAny�r( r* r* r+ � __invert__M s zParserElement.__invert__c C s� z t |t�r|f}t|� W n tk r8 ||f}Y nX t|�dkrxtd�|dd� t|�dkrpd�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``. r\ z,only 1 or 2 index arguments supported ({}{})Nr^ z... [{}]rk )r r" �iterr� r r� r� )r( �keyr1 r* r* r+ � __getitem__W s ��zParserElement.__getitem__)rJ rL c C s |dk r| � |�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( rJ r* r* r+ �__call__ 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. )�Suppressr� r* r* r+ �suppress� s zParserElement.suppress�� recursiverL 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( r� 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) Fr� r� r* r* r+ �leave_whitespace� s z ParserElement.leave_whitespace)r� � copy_defaultsrL c C s d| _ t|�| _|| _| S )z8 Overrides the default whitespace chars T)r� r� r� r� )r( r� r� 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� r� r* r* r+ �parse_with_tabs� s z ParserElement.parse_with_tabs)r| rL c C sT ddl }t|t�rt|�}t|t�r<|| jkrP| 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 = Word(alphas)[1, ...] patt.parse_string('ablaj /* comment */ lskjd') # -> ['ablaj'] patt.ignore(c_style_comment) patt.parse_string('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd'] r N)r� r r" r� r� r� r� )r( r| r� r* r* r+ �ignore� s zParserElement.ignore)� start_action�success_action�exception_actionrL c C s& | � |p t|pt|pt�| _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� )r( r� r� r� r* r* r+ �set_debug_actions� s �z ParserElement.set_debug_actions)�flagrL c 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() term[1, ...].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)r� r� r� r� r� )r( r� r* r* r+ � set_debug� s %�zParserElement.set_debugc C s | j d kr| �� | _ | j S r& )r� �_generateDefaultNamer� 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* r� r* r* r+ r� . s z"ParserElement._generateDefaultNamec 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� rJ r� rF rX r� r� r* r* r+ �set_name4 s zParserElement.set_namec C s | j d k r| j S | jS r& )r� r� r� r* r* r+ rJ A s zParserElement.namec C s | j S r& �rJ r� r* r* r+ �__str__F s zParserElement.__str__c C s t | �S r& rl r� r* r* r+ �__repr__I s zParserElement.__repr__c C s d| _ d | _| S �NT)r� r� r� r* r* r+ rR L s zParserElement.streamlinec C s g S r& r* r� r* r* r+ �recurseQ s zParserElement.recursec C s. |d d � | g }| � � D ]}|�|� qd S r& )r� �_checkRecursion�r( �parseElementList�subRecCheckListr r* r* r+ r� T 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+ �validateY s zParserElement.validate�utf-8)�file_or_filename�encodingrQ rP rL c C s� |p|}z |� � }W n6 tk rJ t|d|d��}|� � }W 5 Q R X Y nX z| �||�W S tk r� } ztjrv� n |�d��W 5 d}~X Y nX 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�openrX r5 ru r� rV )r( r� r� rQ rP � file_contents�fr� r* r* r+ � parse_file_ s zParserElement.parse_filec C sB | |kr dS t |t�r$| j|dd�S t |t�r>t| �t|�kS dS )NT�rQ F)r r" rd ru �varsr{ r* r* r+ �__eq__{ s zParserElement.__eq__c C s t | �S r& )�idr� r* r* r+ �__hash__� s zParserElement.__hash__)� test_stringrQ rP rL c C s< |o|}z| j t|�|d� W dS tk r6 Y dS X 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)rX r` r5 )r( r� rQ rP r* r* r+ rd � s zParserElement.matches�#)rP �fullDump� printResults� failureTestsr )�testsrQ �comment� full_dump� print_results� failure_tests� post_parse�file�with_line_numbersrP r� r� r� r rL c s4 ddl m} | o|} | o|} | o"|} | p*|} |p2|}t|t�rbt|�j� � fdd�|�� �� D �}t|t�rtt|�}|dkr�t j }|j }g }g }d}td�� t d���t�}d }|D �]t}|dk r�|�|d �s�|r�|s�|�| r�|�|�n|� q�|s�q�|�r dd�|� nd | �r |�|�n|g}g }z"|�|�|��}| j|| d �}W n� tk �r� } z`t|t��rld nd }|�|�� � |�dt|� � tj �r�|� t � |j �� |�o�| }|}W 5 d}~X Y �n4 t!k �r, } zD|�d�"t|�j#|�� tj �r|� t � |j �� |�o| }|}W 5 d}~X Y n�X |�o8| }|dk �r�zR|||�} | dk �r�t| t$��rv|�| �%� � n|�t| �� n|�|�%� � W nR t!k �r� } z2|�|j%| d�� |�d�"|j#t| �j#| �� W 5 d} ~ X Y nX 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_testc s g | ] }� |��qS r* r* )r< � test_line�� line_stripr* r+ r> s z+ParserElement.run_tests.<locals>.<listcomp>NT�\n� u Frk r� z(FATAL)zFAIL: zFAIL-EXCEPTION: {}: {})�fullz{} failed: {}: {})&�testingr� r r" r� �strip�rstrip� splitlines�Literal�sys�stdout�writer � replace_withr� � quoted_stringrd r� r� rn rq �lstriprX r5 r� �explainr` ru r� rm r� � format_tbr� r r� r. r �dump) r( r� rQ r� r� r� r� r� r� r� rP r� r� r� r r� �print_� allResults�comments�success�NL�BOMr ro r= r; r� r� �pp_valuer r* r� r+ � run_tests� s� p �� �� zParserElement.run_testsr# )� output_html�vertical�show_results_names� show_groupsrL c K s� zddl m}m} W n, tk r@ } ztd�|�W 5 d}~X Y nX | �� || ||||d�} t|ttf�r�t |ddd��} | � || �� W 5 Q R X 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 - show_groups - bool flag whether groups should be highlighted with an unlabeled surrounding box 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 r �diagram_kwargs�wr� r� ) �diagramr r � ImportErrorr rR r r` r r� r� ) r( r r r r r r r �ie�railroad� diag_filer* r* r+ �create_diagrama s( ���z ParserElement.create_diagram)F)F)F)T)T)TT)F)TT)N)rN )F)N)T)T)F)T)N)r� F)T)Tr� TTFNNF)r# FF)�r. r3 r4 r? r� r` r� r� rl r� r� r� r� � staticmethodr� r� r r� r, r[ r� r� r� r� r� � ParseActionr r �ParseConditionr �ParseFailActionr r r r r r r� r r* r- r. r �recursion_lockr0 �Dictr r r2 r1 r4 r> r� r@ rB rA rC rM rO rX �_MAX_INTr rh rq rr rD r} r� r� r� r� r� r� r� r� r� r� r� r� �__iter__r� r� r� r� r� r r� r� r� r� r� r� r� r� �propertyr� r r� r� rJ r� r� rR r r� r� r� r r r� r� r� rd r r r r �setDefaultWhitespaceChars�inlineLiteralsUsing�setResultsName�setBreak�setParseAction�addParseAction� addCondition� setFailAction�tryParse� canParseNextra �enableLeftRecursion� enablePackrat� parseString� scanString� searchString�transformString�setWhitespaceChars� parseWithTabs�setDebugActions�setDebug� defaultName�setName� parseFile�runTests�ignoreWhitespace�leaveWhitespacer* r* r* r+ ru � s� �� � ! V # � � f � �� � � 0 ���/ , �� � H��� Y1��� +�� � (V( � � � / �� � �� � � � � G � � .c sL e Zd Zdeed�� fdd� Zdd� Zdd�d d �Zd d � Zd d� Z � Z S )ry F)r� r� c s t � �� || _|| _d S r& )�superr, �anchorr� )r( r� r� �r� r* r+ r, � s z_PendingSkip.__init__c C s t | jt� ��dd�S )NrT �...)r` r4 rT �replacer� r* r* r+ r� � s z!_PendingSkip._generateDefaultNameru rK c s\ t |��d�d�}� jrNdd� }� fdd�}� j|� �|� |� �|�B | S � j| | S )Nr6 r~ c S s, | j r| j �� dgkr(| d= | �dd � d S )Nrk r �_skipped)r8 r� �pop�r r* r* r+ r� � s z'_PendingSkip.__add__.<locals>.must_skipc s< | j �� dd � dgkr8| �d� dt� j� d | d< d S )Nr� rk r8 z missing <�>)r8 r� r9 �reprr4 r: r� r* r+ � show_skip� s z'_PendingSkip.__add__.<locals>.show_skip)r r� r� r4 r )r( r| �skipperr� r= r* r� r+ r} � s ��z_PendingSkip.__add__c C s | j S r& )r- r� 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( r� r* r* r+ r � s �z_PendingSkip.parseImpl)F) r. r3 r4 ru rl r, r� r} r� r � __classcell__r* r* r5 r+ ry � s ry 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� �r3 r, r� r5 r* r+ r, � s zToken.__init__c C s t | �jS r& r� r� r* r* r+ r� � s zToken._generateDefaultName)r. r3 r4 r? r, r� r? r* r* r5 r+ r@ � s r@ c s e Zd ZdZ� fdd�Z� ZS )rT z, An empty token, will always match. c s t � �� d| _d| _d S r �r3 r, r� r� r� r5 r* r+ r, � s zEmpty.__init__)r. r3 r4 r? r, r? r* r* r5 r+ rT � s rT 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)r3 r, r� r� r� r� r5 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. r3 r4 r? r, r r? r* r* r5 r+ rC � s rC 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`. rk �� matchString�� match_stringrF c s� t � �� |p|}|| _t|�| _z|d | _W n tk rL td��Y nX d| j | _ d| _ d| _ | jdkr�t | �t kr�t| _d S )Nr z2null string passed to Literal; use Empty() insteadr� Fr )r3 r, �matchr �matchLen�firstMatchCharr r� rJ r� r� r� r� r� �_SingleCharLiteralr� �r( rH rF r5 r* r+ r, s zLiteral.__init__c C s t | j�S r& �r< rI r� r* r* r+ r� s z Literal._generateDefaultNameTc C s@ || | j kr,|�| j|�r,|| j | jfS t||| j| ��d S r& )rK r: rI rJ r� r� r r* r* r+ r s �zLiteral.parseImpl)rk )T) r. r3 r4 r? r` r, r� r r? r* r* r5 r+ r� � s r� c @ s e Zd Zddd�ZdS )rL Tc C s0 || | j kr |d | jfS t||| j| ��d S r )rK rI r� r� r r* r* r+ r ) s z _SingleCharLiteral.parseImplN)T�r. r3 r4 r r* r* r* r+ rL ( s rL c st e Zd ZdZed Zdddd�eeje e eeje d�� fdd �Z d d � Z dd d�Z e dd�dd��ZeZ� 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_$rk NF�rF � identChars)rH � ident_chars�caselessrF rR c s� t � �� |p|}|d kr tj}|p&|}|| _t|�| _z|d | _W n tk rb t d��Y nX d� t | �j | j �| _d| _d| _|| _|r�|�� | _|�� }t|�| _d S )Nr z2null string passed to Keyword; use Empty() insteadzExpected {} {}F)r3 r, rP �DEFAULT_KEYWORD_CHARSrI r rJ rK r r� r� r� r. rJ r� r� r� rT �upper� caselessmatchr� rR )r( rH rS rT rF rR r5 r* r+ r, O s& zKeyword.__init__c C s t | j�S r& rN r� r* r* r+ r� l s z Keyword._generateDefaultNameTc C s^ | j }|}| jr�|||| j � �� | jkr�|dksJ||d �� | jkr�|t|�| j kst||| j �� | jkr�|| j | jfS |d7 }|| j }n|d7 }|d }n�|| | jkr�| jdks�|� | j|��rL|dks�||d | jk�r<|t|�| j k�s||| j | jk�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� rT rJ rV rW rR r rI rK r: r� )r( r� r� r� r� �errlocr* r* r+ r o sB �� �� � ��� zKeyword.parseImplrK c C s | t _dS )zX Overrides the default characters used by :class:`Keyword` expressions. N)rP rU )r� r* r* r+ �set_default_keyword_chars� s z!Keyword.set_default_keyword_chars)rk NF)T)r. r3 r4 r? � alphanumsrU r` r� r� rl r, r� r r rY �setDefaultKeywordCharsr? r* r* r5 r+ rP 2 s( ��� /rP c s: e Zd ZdZd dd�eed�� fdd�Zd dd �Z� ZS ) �CaselessLiteralaq 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:: CaselessLiteral("CMD")[1, ...].parse_string("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD'] (Contrast with example for :class:`CaselessKeyword`.) rk rE rG c s. |p|}t � �|�� � || _d| j | _d S )Nr� )r3 r, rV � returnStringrJ r� rM r5 r* r+ r, � s zCaselessLiteral.__init__Tc C s@ |||| j � �� | jkr,|| j | jfS t||| j| ��d S r& )rJ rV rI r] r� r� r r* r* r+ r � s zCaselessLiteral.parseImpl)rk )T)r. r3 r4 r? r` r, r r? r* r* r5 r+ r\ � s r\ c sB e Zd ZdZdddd�eeje eeje d�� fdd�Z� ZS ) �CaselessKeywordz� Caseless version of :class:`Keyword`. Example:: CaselessKeyword("CMD")[1, ...].parse_string("cmd CMD Cmd10") # -> ['CMD', 'CMD'] (Contrast with example for :class:`CaselessLiteral`.) rk NrQ )rH rS rF rR c s& |p|}|p|}t � j||dd� d S )NT)rT rA )r( rH rS rF rR r5 r* r+ r, � s zCaselessKeyword.__init__)rk N) r. r3 r4 r? r` r� r� r, r? r* r* r5 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)� maxMismatchesrT )rH �max_mismatchesr` c sN |d k r |n|}t � �� || _|| _d�| j| j�| _|| _d| _d| _d S )Nz(Expected {!r} (with up to {} mismatches)F) r3 r, rH r` r� r� rT r� r� )r( rH ra r` rT r5 r* r+ r, � s �zCloseMatch.__init__c C s d� t| �j| j�S )Nz{}:{!r})r� r� r. rH r� 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 �original� mismatches) r rH r` � enumerate�ziprT rm r� r r� r� )r( r� r� r� r] r �maxlocrH �match_stringlocrc r` �s_m�src�mat�resultsr* r* r+ r s0 � zCloseMatch.parseImpl)N)T� r. r3 r4 r? r` r� r, r� r r? r* r* r5 r+ r_ � s % ���r_ c sx e Zd ZdZdddddd�eeje eeeeeje eje eje eeje d� � fd d �Z d 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=",") rk Nr r F)� initChars� bodyChars� asKeyword� excludeChars) � init_chars� body_charsr_ �max�exact� as_keyword� exclude_charsrn ro rp rq 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 k�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 tjk �r� d | _Y nX | jj | _ t | _ d S )Nz,invalid {}, initChars cannot be empty stringrk r r zUcannot specify a minimum length < 1; use Opt(Word()) if zero-length word is permittedr� Fr� �+� {{{},{}}}z[{}]{}r z{{0,{}}}z{}[{}]{}r\ z [{}][{}]{}z\b) r3 r, r� r� r� r. r� rn rn �sorted� initCharsOrig� bodyCharsOrigro � maxSpecified�minLen�maxLenr rJ r� r� rp r �reStringr �re�escape�compile�errorrI �re_match� _WordRegexr� ) r( rr rs r_ rt ru rv rw rn ro rp rq �repeatr5 r* r+ r, v 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)� re_escaper# r6 )r r )r} � max_repr_lenr* r* r+ � charsAsStr� s z-Word._generateDefaultName.<locals>.charsAsStrz W:({}, {})zW:({})r r\ z{{{}}}z {{{},...}}ry )rn ro r� r~ r r )r( r� �baser* r* r+ r� � s � zWord._generateDefaultNameTc C s� || | j kr t||| j| ��|}|d7 }t|�}| j}|| j }t||�}||k rj|| |krj|d7 }qLd}|| | jk r�d}nV| jr�||k r�|| |kr�d}n6| j r�|dkr�||d |ks�||k r�|| |kr�d}|r�t||| j| ��||||� fS )Nr FTr ) rn r� r� r ro r r_ r~ r} rp ) r( r� r� r� r] r � bodycharsrf �throwExceptionr* r* r+ r s8 ��� �zWord.parseImpl)rk Nr r r FN)T) r. r3 r4 r? r` r� r� r� rl r, r� r r? r* r* r5 r+ rm 5 s8 B � ��q rm 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)TrO r* r* r* r+ r� % s r� c sD e Zd ZdZdddd�eeeje eeje d�� fdd�Z� Z S ) �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)rp rq )�charsetrv rw rp rq c sd |p|}|p|}t � j|d||d� d�t| j��| _|rHd�| j�| _t�| j�| _| jj| _ d S )Nr )ru rp rq z[{}]z\b{}\b) r3 r, r� r rn r� r� r� rI r� )r( r� rv rw rp rq r5 r* r+ r, 5 s �z Char.__init__)FN) r. r3 r4 r? r` rl r� r� r, r? r* r* r5 r+ r� / s ���r� c s� e Zd ZdZdddd�eeejef e e e e d�� fdd�Z e dd � �Ze d d � �Z e d d � �Z dd� Zddd�Zd dd�Zd dd�Zeed�dd�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�rJ|s0td��d| _| | _| _|| _n8t |d�rzt |d�rz|| _|j | _| _|| _nt d��d| j | _ d| _ || _|| _| jr�| j| _| jr�| j| _dS )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() insteadNr� rI zCRegex may only be constructed with a string or a compiled RE objectr� F)r3 r, r r" r� �_rer� r� r� r� r� rJ r� r� r� r� �parseImplAsGroupListr �parseImplAsMatch)r( r� r� r� r� r� r� r5 r* r+ r, c s0 � zRegex.__init__c C sJ | j r | j S zt�| j| j�W S tjk rD td�| j���Y nX d S )Nz&invalid pattern ({!r}) passed to Regex)r� r� r� r� r� r� r� r� r� r* r* r+ r� � s �zRegex.rec C s | j jS r& )r� rI r� r* r* r+ r� � s zRegex.re_matchc C s | � d�d k S �Nrk )r� r� r* r* r+ r� � s zRegex.mayReturnEmptyc C s d� t| j��dd��S )NzRe:({})z\\�\)r� r< r� r7 r� 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= r1 �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= r1 r* r* r+ r� � s zRegex.parseImplAsGroupListc C s4 | � ||�}|s t||| j| ��|�� }|}||fS r& )r� r� r� r^ r� r* r* r+ r� � s zRegex.parseImplAsMatch)�replrL c 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& )r� r* r+ r� � s zRegex.sub.<locals>.pac s �j �� | d �S r� )r� �subr� �r� r( r* r+ r� � s )r� r� r� r� r )r( r� r� r* r� r+ r� � s z Regex.sub)r FF)T)T)T)r. r3 r4 r? r r r� � RegexFlagr� rl r, r% r� r� r� r r� r� r` ru r� r? r* r* r5 r+ r� J s4 �� �. r� c s� e Zd ZdZdZdddddddd�eeje eje eeeje eeeje eje eeje ed� � fd d �Z d 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� rk NFT)� quoteChar�escChar�escQuote�unquoteResults� endQuoteChar�convertWhitespaceEscapes) � quote_char�esc_char� esc_quote� multiline�unquote_results�end_quote_char�convert_whitespace_escapesr� r� r� r� r� r� c sf t � �� | p|} | p|} | o |} | p(|} | o0|} |p8|}|�� }|sNtd��| d kr\|} 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 k �r�t| �nd�7 }n4d� _|d�|t� jd �| d k �r�t| �nd�7 }d�t�� j�d|dt�� j�g�� _z(t�� j� j�� _� j� _� jj� _ W n( tj k �rH td�� j���Y nX d� j � _ d� _ d� _!d S )Nz%quote_char cannot be the empty stringz'endQuoteChar cannot be the empty stringr rk z{}(?:{})�|z {}(?:{}.)z(.)r z{}(?:c 3 s: | ]2}d � t�� jd|� �t�� j|d� ��V qdS )z (?:{}(?!{}))N)r� r� r� r� )r< ri r� r* r+ r� N s ��z(QuotedString.__init__.<locals>.<genexpr>r� �)z {}(?:[^{}{}])z{}(?:[^{}\n\r{}])z(?:z)*z$invalid pattern {!r} passed to Regexr� FT)"r3 r, r� r� r� r � quoteCharLen�firstQuoteCharr� �endQuoteCharLenr� r� r� r� r� r� r� �escCharReplacePatternrn �range� MULTILINE�DOTALLr� r r� r� r� rI r� r� rJ r� r� r� )r( r� r� r� r� r� r� r� r� r� r� r� r� r� �sep� inner_patternr5 r� 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 {})r� r� r r" r� r� r* r* r+ r� s �z!QuotedString._generateDefaultNamec C s� || | j kr| �||�p d }|s2t||| j| ��|�� }|�� }| jr�|| j| j � }t |t �r�d|kr�| j r�| j D ]\}}|� ||�}qx| jr�t�| jd|�}| jr�|� | j| j�}||fS )Nr� z\g<1>)r� r� r� r� r^ r� r� r� r� r r" r� �ws_mapr7 r� r� r� r� r� r� )r( r� r� r� r= r1 �wslit�wscharr* r* r+ r � s( �� zQuotedString.parseImpl)rk NNFTNT)T) r. r3 r4 r? r� r` r� r� rl r, r� r r? r* r* r5 r+ r� � sB & � ��qr� 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'] rk r r )�notChars)� not_charsr_ rt ru 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� )r3 r, r� r� r� � notCharsSetr� r~ r r rJ r� r� r� )r( r� r_ rt ru r� r5 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( � not_chars_strr* r* r+ r� � s z CharsNotIn._generateDefaultNameTc C s� | j }|| |kr"t||| j| ��|}|d7 }t|| j t|��}||k r`|| |kr`|d7 }qB|| | jk r~t||| j| ��||||� fS r )r� r� r� r_ r r r~ )r( r� r� r� �notcharsr] �maxlenr* r* r+ r � s zCharsNotIn.parseImpl)rk r r r )Trl r* r* r5 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� r� r� r� r� � u u u u u u u u u u u u u u u u u � r r )�wsr_ rt ru c sz t � �� |� _� jd�� fdd�� jD ��dd� d� _d� j � _|� _ |dkr\|� _ nt � _ |dkrv|� _ |� _ d S )Nrk c 3 s | ]}|� j kr|V qd S r& )� matchWhitery r� r* r+ r� ! s z!White.__init__.<locals>.<genexpr>T�r� r� r ) r3 r, r� r� rn � whiteStrsr� rJ r� r~ r r )r( r� r_ rt ru r5 r� r+ r, s � zWhite.__init__c C s d� dd� | jD ��S )Nrk c s s | ]}t j| V qd S r& )r� r� ry r* r* r+ r� 4 s z-White._generateDefaultName.<locals>.<genexpr>)rn r� r� r* r* r+ r� 3 s zWhite._generateDefaultNameTc C s� || | j kr t||| j| ��|}|d7 }|| j }t|t|��}||k rb|| | j krb|d7 }qB|| | jk r�t||| j| ��||||� fS r )r� r� r� r r_ r r~ )r( r� r� r� r] rf r* r* r+ r 6 s zWhite.parseImpl)r� r r r )T) r. r3 r4 r? r� r` r� r, r� r r? r* r* r5 r+ r� � s8 �r� c s e Zd Z� fdd�Z� ZS )� PositionTokenc s t � �� d| _d| _d S r rB r� r5 r* r+ r, G s zPositionToken.__init__)r. r3 r4 r, r? r* r* r5 r+ r� F s r� 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& )r3 r, r� )r( r� r5 r* r+ r, R 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 V s � �� zGoToColumn.preParseTc C sD t ||�}|| j kr"t||d| ��|| j | }|||� }||fS )NzText not in expected column)r� r� )r( r� r� r� �thiscol�newlocr1 r* r* r+ r c s zGoToColumn.parseImpl)T) r. r3 r4 r? r� r, r r r? r* r* r5 r+ r� M s r� 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) r3 r, r� r� r� �orig_whiteChars�discardrT r� r> r� r� r5 r* r+ r, � s zLineStart.__init__c C sT |dkr |S | j �||�}d| jkrL|||d � dkrL| j �||d �}q$|S d S )Nr r� r )r> r r� )r( r� r� r1 r* r* r+ r � s zLineStart.preParseTc C s* t ||�dkr|g fS t||| j| ��d S r )r� r� r� r r* r* r+ r � s zLineStart.parseImpl)T)r. r3 r4 r? r, r r r? r* r* r5 r+ r� l s r� 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� Fr� zExpected end of line)r3 r, r� r� r� r� r� r5 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)TrD r* r* r5 r+ r� � s r� 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�r3 r, r� r� r5 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)TrD r* r* r5 r+ r� � s r� c s* e Zd ZdZ� fdd�Zddd�Z� ZS )rU zG Matches if current position is at the end of the parse string c s t � �� d| _d S )NzExpected end of textr� r� r5 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 r� r r* r* r+ r � s zStringEnd.parseImpl)TrD r* r* r5 r+ rU � s rU 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_charsr� c s. |t kr |n|}t� �� t|�| _d| _d S )NzNot at the start of a word)� printablesr3 r, r� r� r� �r( r� r� r5 r* r+ r, � s zWordStart.__init__Tc C s@ |dkr8||d | j ks(|| | j kr8t||| j| ��|g fS �Nr r )r� r� r� r r* r* r+ r � s � �zWordStart.parseImpl)T� r. r3 r4 r? r� r` r, r r? r* r* r5 r+ r� � s r� 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. r� r� c s4 |t kr |n|}t� �� t|�| _d| _d| _d S )NFzNot at the end of a word)r� r3 r, r� r� r� r� r� r5 r* r+ r, � s zWordEnd.__init__Tc C sP t |�}|dkrH||k rH|| | jks8||d | jkrHt||| j| ��|g fS r� )r r� r� r� )r( r� r� r� r r* r* r+ r s ��zWordEnd.parseImpl)Tr� r* r* r5 r+ r� � s r� c s� e Zd ZdZd eje ed�� fdd� Ze e d�dd�Z ed�d d �Z d eed �� fd d� Z d eed �� fdd� Z ed�� fdd� Zdd� Zed�� fdd� Zd!dd�dd�Zed�� fdd� Zd"� fd d � 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� _nnt|t �r�t|�}t dd� |D ��r�� fdd�|D �}t|�� _n,zt|�� _W n t k r� |g� _Y nX d� _ d S )Nc s s | ]}t |t�V qd S r& )r r" )r< r� r* r* r+ r� s z+ParseExpression.__init__.<locals>.<genexpr>c 3 s& | ] }t |t�r� �|�n|V qd S r& )r r" r� �r< r r� r* r+ r� s �F) r3 r, r �_generatorTyper� r" r� r� ru r �anyr� r� �r( r� r� r5 r� r+ r, s( � zParseExpression.__init__rK c C s | j d d � S r& )r� r� r* r* r+ r� + s zParseExpression.recursec C s | j �|� d | _| S r& )r� r� r� r{ r* r* r+ r� . s zParseExpression.appendTr� c 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> ; s z4ParseExpression.leave_whitespace.<locals>.<listcomp>)r3 r� r� �r( r� r r5 r* r+ r� 3 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> G s z5ParseExpression.ignore_whitespace.<locals>.<listcomp>)r3 r� r� r� r5 r* r+ r� @ s z!ParseExpression.ignore_whitespacec sj t |t�r>|| jkrft� �|� | jD ]}|�| jd � q&n(t� �|� | jD ]}|�| jd � qP| S �Nr� )r r� r� r3 r� r� )r( r| r r5 r* r+ r� L s zParseExpression.ignorec C s d� | jjt| j��S �Nz{}:({}))r� r� r. r` r� r� r* r* r+ r� X s z$ParseExpression._generateDefaultNamec s0 | j r | S t� �� | jD ] }|�� qt| j�dk�r | jd }t|| j�r�|js�|jd kr�|j s�|jd d � | jd g | _d | _ | j |j O _ | j |j O _ | jd }t|| j��r |j�s |jd k�r |j �s | jd d� |jd d � | _d | _ | j |j O _ | j |j O _ dt | � | _| S )Nr\ r r r� r� )r� r3 rR r� r r r� r� r� r� r� r� r� r` r� )r( r r| r5 r* r+ rR [ sD ���� ���� zParseExpression.streamlineNc C sB |d k r |ng d d � | g }| j D ]}|�|� q$| �g � d S r& )r� r� r� )r( r� �tmpr r* r* r+ r� � s zParseExpression.validatec s t � �� }dd� | jD �|_|S )Nc S s g | ] }|� � �qS r* r� r� r* r* r+ r> � s z(ParseExpression.copy.<locals>.<listcomp>)r3 r� r� �r( r1 r5 r* r+ r� � s zParseExpression.copyc sj t jr\tj| jkr\| jD ]B}t|t�r|jrtj|jkrtj d� d|t | �j |j�dd� qt � �||�S �NzY{}: setting results name {!r} on {} expression collides with {!r} on contained expressionrR r# �� stacklevel)rF rR r[ r� r� r ru r� �warningsrH r� r� r. r3 r� �r( rJ r� r r5 r* r+ r� � s2 ��� ������ z ParseExpression._setResultsName)F)T)T)N)F)r. r3 r4 r? r� r ru rl r, r r� r� r� r� r� r� rR r� r� r� r1 r2 r? r* r* r5 r+ r� s )r� c st e Zd ZdZG dd� de�Zdeje e d�� fdd� Z ed�� fd d � Z dd d �Z d d� Z dd� Zdd� Z� ZS )rz 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 = Word(alphas)[1, ...] 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||� | �� d S r& )r3 r, r� )r( r� r r5 r* r+ r, � s zAnd._ErrorStop.__init__c C s dS )N�-r* r� r* r* r+ r� � s z#And._ErrorStop._generateDefaultName)r. r3 r4 r, r� r? r* r* r5 r+ r� � s r� T)� exprs_argr� c s t |�}|r�t|kr�g }t|�D ]`\}}|tkrv|t|�d k rlt� ||d jd }|�t|�d�� q�td��q |�|� q ||d d �< t � � ||� | jr�t dd� | jD ��| _ t | jd t�s�| j| jd j| jd jd� | jd j| _nd | _nd | _ d | _d S ) Nr r� r~ z0cannot construct And with sequence ending in ...c s s | ] }|j V qd S r& �r� r� r* r* r+ r� � s z And.__init__.<locals>.<genexpr>r r� FT)r� rx rd r rT r� r� r r r3 r, r r� r r� r� r� r� r� r� )r( r r� r� r� ri r� � skipto_argr5 r* r+ r, � s2 � �z And.__init__rK c sH | j r�tdd� | j d d� D ��r�t| j d d� �D ]^\}}|d krFq4t|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 |�|kr�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 �r� N)r r� r� ry r� r* r* r+ r� � s � �z!And.streamline.<locals>.<genexpr>r� r c S s g | ]}|d k r|�qS r& r* r� r* r* r+ r> � s z"And.streamline.<locals>.<listcomp>c S s t |dt|| ��S )N� parent_anchor)�setattrr� )r} r~ r �cur_r* r* r+ r� s �z And.streamline.<locals>.<lambda>c s s | ] }|j V qd S r& r r� r* r* r+ r� s )r� r� rd r r� ry r3 rR re r� r� �add� IndentedBlockr r� �nextr� r r� )r( ri r �prev�cur�seen�subsr5 r* r+ rR � s@ ���� �zAnd.streamlinec C s | j d j|||dd�\}}d}| j dd � D ]�}t|�tjkrFd}q.|r�z|�|||�\}}W q� tk rv � Y q� tk r� } zd |_t�|��W 5 d }~X Y q� t k r� t|t |�| j | ��Y q�X n|�|||�\}}|s�|� � r.||7 }q.||fS )Nr Fr\ r T) r� r� r� rz r� �ParseSyntaxExceptionr5 r� �_from_exceptionr r r� �haskeys) r( r� r� r� � resultlist� errorStopr � exprtokensr; r* r* r+ r s< � � z And.parseImplc C s t |t�r| �|�}| �|�S r& �r r" r� r� r{ r* r* r+ �__iadd__3 s z And.__iadd__c C s6 |d d � | g }| j D ]}|�|� |js q2qd S r& )r� r� r� r� r* r* r+ r� 8 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& rl r� r* r* r+ r� @ s z+And._generateDefaultName.<locals>.<genexpr>r r �{}r� �{�})rn r� r �r( �innerr* r* r+ r� ? s &zAnd._generateDefaultName)T)T)r. r3 r4 r? rT r� r� r ru rl r, rR r r r� r� r? r* r* r5 r+ rz � s � �!- rz c sj e Zd ZdZdeje ed�� fdd� Zed�� fdd� Z dd d �Z d d � Z dd� Z d� fdd� Z � ZS )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+ r� \ s z Or.__init__.<locals>.<genexpr>c s s | ] }|j V qd S r& r� r� r* r* r+ r� ] s T�r3 r, r� r� r� r r� r� r5 r* r+ r, Y s z Or.__init__rK c s^ t � �� | jrTtdd� | jD ��| _tdd� | jD ��| _tdd� | jD ��| _nd| _| S )Nc s s | ] }|j V qd S r& r r� r* r* r+ r� d s z Or.streamline.<locals>.<genexpr>c s s | ] }|j V qd S r& �r� r� r* r* r+ r� e s c s s | ]}|j ot|t� V qd S r& �r� r r� r� r* r* r+ r� f s F)r3 rR r� r� r� r� r r� r� r5 r* r+ rR a s � z Or.streamlineTc C s� d}d }g }g }t dd� | jD ��r0| �||�}| jD ]�}z|j||dd�} W n� tk r� } z"d | _|| _|�| � d }d}W 5 d } ~ X Y q6 tk r� } z"|s�d | _| j |kr�| }| j }W 5 d } ~ X Y q6 t k �r t |�|k�rt|t |�|j | �}t |�}Y q6X |�| |f� q6|�r|j td�dd� |�sT|d d } | �|||�S d } |D ]�\}}|| d k�rz| S z|�|||�\} }W n@ tk �r� } z d | _| j |k�r�| }| j }W 5 d } ~ X Y n.X | |k�r�| |f S | | d k�r\| |f} �q\| d k�r| S |�rft |�dk�rZ|j d d � d � |d j |d j k�rZ|j d d � d � |d }|�|d k �r~| j |_|�nt||d| ��d S )Nr� c s s | ] }|j V qd S r& )r� r� r* r* r+ r� r s z Or.parseImpl.<locals>.<genexpr>T�r+ r )r� �reverser r c S s | j S r& �r� �r r* r* r+ r� � r� z Or.parseImpl.<locals>.<lambda>�r� c S s | j tt| j�� fS r& �r� r r` � parserElementr$ r* r* r+ r� � r� � no defined alternatives to match)r r� r r- r� r� r' r� r� r� r r r� �sortr r� r� )r( r� r� r� � maxExcLoc� maxExceptionrd �fatalsr �loc2�pfer' � best_expr�longest�loc1�expr1r� � max_fatalr* r* r+ r m 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& rl r� r* r* r+ r� � s z*Or._generateDefaultName.<locals>.<genexpr>r �rn r� r� r* r* r+ r� � s zOr._generateDefaultNamec sR t jrDtj| jkrDtdd� | jD ��rDtjd�d|t | �j �dd� t � � ||�S )Nc s s$ | ] }t |t�otj|jkV qd S r& �r rz r[ rQ r� r� r* r* r+ r� � 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; enclose contained argument in GrouprQ r# r� � rF rQ r[ r� r� r� r rH r� r� r. r3 r� �r( rJ r� r5 r* r+ r� � s$ ������ zOr._setResultsName)F)T)F)r. r3 r4 r? r� r ru rl r, rR r r4 r� r� r? r* r* r5 r+ r� G s Rr� c sj e Zd ZdZdeje ed�� fdd� Zed�� fdd� Z dd d �Z d d � Z dd� Z d� fdd� Z � ZS )r� 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+ r� � s z&MatchFirst.__init__.<locals>.<genexpr>c s s | ] }|j V qd S r& r� r� r* r* r+ r� � s Tr r� r5 r* r+ r, � s zMatchFirst.__init__rK 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+ r� s z(MatchFirst.streamline.<locals>.<genexpr>c s s | ] }|j V qd S r& r r� r* r* r+ r� s c s s | ]}|j ot|t� V qd S r& r r� r* r* r+ r� s FT) r� r3 rR r� r� r� r� r r� r� r5 r* r+ rR � s � zMatchFirst.streamlineTc C s� d}d }| j D ]�}z|�|||�W S tk rV } zd |_||_� W 5 d }~X Y q tk r� } z|j|krz|}|j}W 5 d }~X Y q tk r� t|�|kr�t|t|�|j | �}t|�}Y qX q|d k r�| j |_ |�nt||d| ��d S )Nr� r( ) r� r� r� r� r' r� r� r r r� r� ) r( r� r� r� r* r+ r r. r' r* r* r+ r sF � � �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& rl r� r* r* r+ r� 4 s z2MatchFirst._generateDefaultName.<locals>.<genexpr>r r5 r� r* r* r+ r� 3 s z MatchFirst._generateDefaultNamec sR t jrDtj| jkrDtdd� | jD ��rDtjd�d|t | �j �dd� t � � ||�S )Nc s s$ | ] }t |t�otj|jkV qd S r& r6 r� r* r* r+ r� < s � �z-MatchFirst._setResultsName.<locals>.<genexpr>r7 rQ r# r� r8 r9 r5 r* r+ r� 6 s$ ������ zMatchFirst._setResultsName)F)T)F)r. r3 r4 r? r� r ru rl r, rR r r: r� r� r? r* r* r5 r+ r� � s "r� c sT e Zd ZdZd eje ed�� fdd� Zed�� fdd� Z dd 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+ r� � s z Each.__init__.<locals>.<genexpr>T)r3 r, r� r r� r� �initExprGroupsr� r� r5 r* r+ r, � s z Each.__init__rK c s2 t � �� | jr(tdd� | jD ��| _nd| _| S )Nc s s | ] }|j V qd S r& r r� r* r* r+ r� � s z"Each.streamline.<locals>.<genexpr>T)r3 rR r� r r� r� r5 r* r+ rR � 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 k �rR } z$d |_ ||_ | � |� | � |� W 5 d }~X Y q� tk �rp | � |� Y q�X | � | j�t|�|�� ||k�r�|�|� q�|� kr�� �|� 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 r� r� r� r� r* r* r+ r� � s z!Each.parseImpl.<locals>.<genexpr>c S s g | ]}t |t�r|j�qS r* �r r� r� r� r* r* r+ r> � s z"Each.parseImpl.<locals>.<listcomp>c S s& g | ] }|j rt|tttf�s|�qS r* )r� r r� r� r� 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 r� r� r� r� r� r* r* r+ r> � s �c S s g | ]}t |tttf�s|�qS r* )r r� r� r� r� r* r* r+ r> � s FTr! r c S s | j S r& r# r$ r* r* r+ r� � r� z Each.parseImpl.<locals>.<lambda>r% r c S s | j tt| j�� fS r& r& r$ r* r* r+ r� � r� z, c S s g | ] }t |��qS r* rl r� r* r* r+ r> � s z*Missing one or more required elements ({})c s$ g | ] }t |t�r|j� kr|�qS r* r< r� ��tmpOptr* r+ r> � s )r; �dictr� �opt1map� optionals�multioptionals� multirequired�requiredr? r- r� r� r' r� r� r r� �remover r) r� rn r� r r� )r( r� r� r� �opt1�opt2�tmpLoc�tmpReqd�multis� matchOrder� keepMatching�failedr, �tmpExprsr r. r3 �missing� total_resultsrk r* r? r+ r � s� � � ��� � zEach.parseImplc C s dd� dd� | jD �� d S )Nr z & c s s | ]}t |�V qd S r& rl r� r* r* r+ r� � s z,Each._generateDefaultName.<locals>.<genexpr>r r5 r� r* r* r+ r� � s zEach._generateDefaultName)T)T) r. r3 r4 r? r� r ru rl r, rR r r� r? r* r* r5 r+ r� Q s 9 Wr� c s� e Zd ZdZd eeef ed�� fdd� Ze e d�dd�Z d d d �Z d eed �� fd d� Z d eed �� fdd� Z ed�� fdd� Zed�� fdd� Zdd� Zd dd�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 k r�|j | _ |j | _ | j |j |jd� |j| _|j| _|j| _| j�|j� d S )Nr� )r3 r, r r" � issubclassr� r@ r� r� r� r� r� r� r� r� r� r� r� r� rm �r( r� r� r5 r* r+ r, � s& �z ParseElementEnhance.__init__rK c C s | j d k r| j gS g S r& �r� r� r* r* r+ r� s zParseElementEnhance.recurseTc C s0 | j d k r | j j|||dd�S t||d| ��d S )NFr\ zNo expression defined)r� r� r� r r* r* r+ r s z ParseElementEnhance.parseImplr� c s6 t � �|� |r2| j�� | _| jd k r2| j�|� | S r& )r3 r� r� r� r� r5 r* r+ r� s z$ParseElementEnhance.leave_whitespacec s6 t � �|� |r2| j�� | _| jd k r2| j�|� | S r& )r3 r� r� r� r� r5 r* r+ r� $ s z%ParseElementEnhance.ignore_whitespacec sj t |t�r>|| jkrft� �|� | jd k rf| j�| jd � n(t� �|� | jd k rf| j�| jd � | S r� )r r� r� r3 r� r� r{ r5 r* r+ r� - s zParseElementEnhance.ignorec s" t � �� | jd k r | j�� | S r& )r3 rR r� r� r5 r* r+ rR 9 s z ParseElementEnhance.streamlinec C sB | |krt || g ��|d d � | g }| jd k r>| j�|� d S r& )�RecursiveGrammarExceptionr� r� )r( r� r� r* r* r+ r� ? s z#ParseElementEnhance._checkRecursionNc C sB |d kr g }|d d � | g }| j d k r4| j �|� | �g � d S r& �r� r� r� �r( r� r� r* r* r+ r� F s z ParseElementEnhance.validatec C s d� | jjt| j��S r� )r� r� r. r` r� r� r* r* r+ r� N s z(ParseElementEnhance._generateDefaultName)F)T)T)T)N)r. r3 r4 r? r ru r` rl r, r r� r r� r� r� rR r� r� r� r1 r2 r? r* r* r5 r+ rS � s rS 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� r| r[ r* r+ r� _ r� z0IndentedBlock._Indent.__init__.<locals>.<lambda>�r3 r, r� r� r �r( r\ r5 r[ r+ r, \ s z IndentedBlock._Indent.__init__�r. r3 r4 r� r, r? r* r* r5 r+ �_Indent[ s ra 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] r| r[ r* r+ r� e r� z7IndentedBlock._IndentGreater.__init__.<locals>.<lambda>r^ r_ r5 r[ r+ r, b s z%IndentedBlock._IndentGreater.__init__r` r* r* r5 r+ �_IndentGreatera s rb FT�r� �grouped)r� r� rd c s& t � j|dd� || _|| _d| _d S )NTr� r )r3 r, � _recursive�_groupedr )r( r� r� rd r5 r* r+ r, g 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 )Nrc zinner ����@c S s | S r& r* rW r* r* r+ r� � r� z)IndentedBlock.parseImpl.<locals>.<lambda>)rT r r� r- r� ra re rb r rf r� r� r r� r� �hexr� rV r� rU �Groupr� r ) r( r� r� r� � anchor_loc� indent_col�peer_detect_expr� inner_expr� sub_indent� nested_block�block�trailing_undentr� r* r* r+ r q s4 � * �zIndentedBlock.parseImpl)T) r. r3 r4 r? rT ra rb ru rl r, r r? r* r* r5 r+ r U 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 rW c s t � �|� d| _d S �NF�r3 r, r� �r( r� r5 r* r+ r, � s zAtStringStart.__init__Tc s$ |dkrt ||d��t� �|||�S )Nr znot found at string start)r� r3 r r r5 r* r+ r � s zAtStringStart.parseImpl)T� r. r3 r4 r? r ru r` r, r r? r* r* r5 r+ rs � s rs 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'] rW c s t � �|� d| _d S rt ru rv r5 r* r+ r, � s zAtLineStart.__init__Tc s* t ||�dkrt||d��t� �|||�S )Nr znot found at line start)r� r� r3 r r r5 r* r+ r � s zAtLineStart.parseImpl)Trw r* r* r5 r+ rx � s rx c s8 e Zd ZdZeeef d�� fdd� Zddd�Z� Z S ) � FollowedByac 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)) attr_expr[1, ...].parse_string("shape: SQUARE color: BLACK posn: upper left").pprint() prints:: [['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']] rW c s t � �|� d| _d S r� �r3 r, r� rv r5 r* r+ r, � s zFollowedBy.__init__Tc C s( | j j|||d�\}}|d d �= ||fS )Nr, )r� r� )r( r� r� r� r8 r1 r* r* r+ r � s zFollowedBy.parseImpl)Trw r* r* r5 r+ ry � s ry c sB e Zd ZdZd eeef eje 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__�slicer| r* r* r+ r� $ r� z%PrecededBy.__init__.<locals>.<lambda>)r3 r, r� r� r� r� ru r r" r r� rP rJ rm r� r r r� r| r` r� r� r� r� )r( r� r| r5 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 ]L} z |�|t |�| �\}}W n& t k r� } z| } W 5 d } ~ X Y q�X q�q�| �||fS r� ) ru r| r� r� r� r� rU rt r� r_ r r5 ) r( r� r� r� r] r8 r1 � test_expr�instring_slice� last_expr�offset�pber* r* r+ r & s& � zPrecededBy.parseImpl)N)r T) r. r3 r4 r? r ru r` r� r� r� r, r r? r* r* r5 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\ � locn_startr: �locn_end)r� r� r r� )r( r� r� r� r] r& r( r* r* r+ r \ s zLocated.parseImplN)T)r. r3 r4 r? r r* r* r* r+ r� @ s r� c s@ e Zd ZdZeeef d�� fdd� Zd dd�Zdd � Z � Z S ) r� 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 + ((AND | OR) + boolean_term)[...] # integers that are followed by "." are actually floats integer = Word(nums) + ~Char(".") rW c s, t � �|� d| _d| _dt| j� | _d S )NFTzFound unwanted token, )r3 r, r� r� r` r� r� rv r5 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 � s zNotAny.parseImplc C s dt | j� d S )Nz~{r �r` r� r� r* r* r+ r� � s zNotAny._generateDefaultName)T) r. r3 r4 r? r ru r` r, r r� r? r* r* r5 r+ r� j s r� c sp e Zd Zddd�eejeeef ejeeef d�� fdd�Zed�dd�Z dd 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� )r3 r, r� r r" r� r� )r( r� r� r� �enderr5 r* r+ r, � s z_MultipleMatch.__init__rK c C s, t |t�r| �|�}|d k r"| nd | _| S r& )r r" r� � not_ender)r( r� r* r* r+ r� � s z_MultipleMatch.stopOnTc C s� | j j}| j}| jd k }|r$| jj}|r2|||� ||||�\}}zV| j } |r\|||� | rl|||�} n|} ||| |�\}} | s�| �� rN|| 7 }qNW n ttfk r� Y nX ||fS r& ) r� r� r r� r! r� r r� r ) r( r� r� r� �self_expr_parse�self_skip_ignorables� check_ender� try_not_enderr& �hasIgnoreExprsre � tmptokensr* r* r+ r � s* z_MultipleMatch.parseImplFc sv t jrhtj| jkrh| jg| j�� D ]B}t|t�r$|jr$tj|jkr$t j d� d|t | �j |j�dd� q$t� �||�S r� )rF rR r[ r� r� r� r ru r� r rH r� r� r. r3 r� r r5 r* r+ r� � s2 ��������� z _MultipleMatch._setResultsName)N)T)F) r. r3 r4 ru r� r� r r` r, r� r r� r? r* r* r5 r+ r> � s ��� r> c @ s e Zd ZdZdd� ZdS )r� ar 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" attr_expr[1, ...].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� r� r* r* r+ r� � s z OneOrMore._generateDefaultNameN)r. r3 r4 r? r� r* r* r* r+ r� � s r� c sd e Zd ZdZd dd�eejeeef ejeeef d�� fdd�Z d � fdd � Z d d � Z � Z S )r� 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� Trz )r( r� r� r� r5 r* r+ r, s zZeroOrMore.__init__Tc sB zt � �|||�W S ttfk r< |tg | jd�f Y S X d S )Nr� )r3 r r� r r r� r r5 r* r+ r s zZeroOrMore.parseImplc C s dt | j� d S )N�[z]...r� r� r* r* r+ r� s z ZeroOrMore._generateDefaultName)N)T) r. r3 r4 r? ru r� r� r r` r, r r� r? r* r* r5 r+ r� s ��� r� c @ s e Zd Zdd� Zdd� ZdS )� _NullTokenc C s dS rt r* r� r* r* r+ �__bool__$ s z_NullToken.__bool__c C s dS r� r* r� r* r* r+ r� ' s z_NullToken.__str__N)r. r3 r4 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 ) r� 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)r3 r, r� r� � defaultValuer� )r( r� r� r5 r* r+ r, T s z Opt.__init__Tc C sz | j }z|j|||dd�\}}W nP ttfk rp | j}|| jk rh|jr`t|g�}|||j< ql|g}ng }Y nX ||fS )NFr\ )r� r� r� r r� �_Opt__optionalNotMatchedr� r )r( r� r� r� � self_exprr& � default_valuer* r* r+ r \ s z Opt.parseImplc C sJ t | j�}t|�dkr>|dd t|�d � dkr>|dd� }q d| d S )Nr r r r� r� �])r` r� r r r* r* r+ r� l s &zOpt._generateDefaultName)T)r. r3 r4 r? r� r� r ru r` r r, r r� r? r* r* r5 r+ r� + s &� � r� c s^ e Zd ZdZd dd�eeef eeej eeef eeef d�� fdd�Z d d d �Z � Z S ) r a* Token for skipping over all undefined text until the matched expression is found. Parameters: - ``expr`` - target expression marking the end of the data to be skipped - ``include`` - 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| �includer� �fail_onr� c sd t � �|� |p|}|| _d| _d| _|| _d| _t|t�rJ| � |�| _ n|| _ dt | j � | _ d S )NTFzNo match found for )r3 r, � ignoreExprr� r� � includeMatchr� r r" r� r� r` r� r� )r( r| r� r� r� r� r5 r* r+ r, � s zSkipTo.__init__Tc C s |}t |�}| jj}| jd k r&| jjnd }| jd k r<| jjnd }|} | |kr�|d k r`||| �r`q�|d k r�z||| �} W qh tk r� Y q�Y qhX qhz||| ddd� W q� tt fk r� | d7 } Y qDX q�qDt||| j | ��| }|||� } t | �} | j �r||||dd�\}} | | 7 } || fS )NF)r� r� r r\ ) r r� r� r� r" r� r! r5 r� r r� r r� ) r( r� r� r� r� r r� �self_failOn_canParseNext�self_ignoreExpr_tryParse�tmploc�skiptext� skipresultrj r* r* r+ r � s< �� zSkipTo.parseImpl)FNN)T) r. r3 r4 r? r ru r` rl r� r� r, r r? r* r* r5 r+ r w s ? �� �r c s� e Zd ZdZd"ejeeef d�� fdd� Z dd� Z dd � Z � fd d �Z d d � Z d#� fdd� Zd$eed�dd�Zd%eed�dd�Zed�dd�Zd&dd�dd�Zdd � Zed�� fd d � 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 )Nr\ r� r Fr� )r� r� � caller_framer3 r, � lshift_liner{ r5 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� r� r\ r� ���)r� r� r r" r� r� r� r� r� r� r� r� r� r� rm r� r� r� r{ r* r* r+ � __lshift__ s � zForward.__lshift__c C s | |> S r& r* r{ r* r* r+ � __ilshift__0 s zForward.__ilshift__c sJ t jdd�d }tjr:|| jkr:tj| jkr:tjddd� t � � |�}|S )Nr\ r� r� z<using '<<' operator with '|' is probably an error, use '<<='r� ) r� r� rF rW r� r[ r� r rH r3 r� )r( r| � caller_liner1 r5 r* r+ r� 3 s ����� zForward.__or__c C s: | j d kr6tjr6tj| jkr6tjdt| jj | jj d� d S )NzIForward defined here but no expression attached later using '<<=' or '<<')�filenamer� ) r� rF rU r[ r� r � warn_explicit� UserWarningr� r� r� r� r* r* r+ �__del__B s �� ��zForward.__del__Tc sl | j d krvtjrvtj| jkrvddddg}tjdd�}tt|�dd�D ] \}}|j |krD|d } qhqDd }t j d |d � t j s�t� �|||�S t j��� t j} z:| || |f \} } t| t�r�| �| | �� fW W 5 Q R � S tk �r\ || d f} || d f} |d t||d| �f \} }| | < |�r0| | | | < zt� �||d �\}}W n. tk �rv t|t��rh� | | }}Y nX || k�r�|�r�| | \} } | | < | | = | | = | | �� f Y W 5 Q R � S | | = | |�� f Y W 5 Q R � S |�r@zt� �||d �| | < W n: tk �r> } z||f | | < | | < � W 5 d }~X Y nX ||f \} }| | < �q0Y nX W 5 Q R X d S )NrX rh rr rq �� r� r )r] r\ zGForward expression was never assigned a value, will not parse any inputr� TFz#Forward recursion without base case)r� rF rT r[ r� r� r� rd �reversedrJ r rH ru rA r3 r r r0 r r r� �KeyErrorr� )r( r� r� r� � parse_fnsr� ri �frmr� �memo�prev_loc� prev_result�act_key�peek_key� prev_peek�new_loc�new_peekr r5 r* r+ r P s� ����� � �� zForward.parseImplr� c C s d| _ | S rt r� r� r* r* r+ r� � s zForward.leave_whitespacec C s d| _ | S r� r� r� r* r* r+ r� � s zForward.ignore_whitespacerK c C s$ | j s d| _ | jd k r | j�� | S r� )r� r� rR r� r* r* r+ rR � s zForward.streamlinec C sJ |d kr g }| |kr<|d d � | g }| j d k r<| j �|� | �g � d S r& rY rZ r* r* r+ r� � s zForward.validatec C sN d| _ d}d z&| jd k r,t| j�d d� }nd}W 5 | jjd | � S X )Nz: ...r6 z: i� �None)r� r� r. r� r` )r( � retStringr* r* r+ r� � s z Forward._generateDefaultNamec s* | j d k rt� �� S t� }|| K }|S d S r& )r� r3 r� r/ r� r5 r* r+ r� � s z Forward.copyFc sH t jr:tj| jkr:| jd kr:tjd�d|t| �j �dd� t � � ||�S )NzO{}: setting results name {!r} on {} expression that has no contained expressionrS r# r� ) rF rS r[ r� r� r rH r� r� r. r3 r� )r( rJ r� r5 r* r+ r� � s ��� ��zForward._setResultsName)N)T)T)T)N)F)r. r3 r4 r? r� r� r ru r` r, r� r� r� r� r rl r� r� rR r� r� r� r� r1 r2 r? r* r* r5 r+ r/ � s " _ r/ c s0 e Zd ZdZdeeef d�� fdd� Z� ZS )�TokenConverterzW Abstract subclass of :class:`ParseExpression`, for converting parsed results. FrW c s t � �|� d| _d S rt )r3 r, r� rV r5 r* r+ r, � s zTokenConverter.__init__)F) r. r3 r4 r? r ru r` r, r? r* r* r5 r+ r� � s r� c sT e Zd ZdZddd�eeeeje d�� fdd�Z ed �� 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...) rk TN)� joinString)r� � join_string�adjacentr� c sD t � �|� |d k r|n|}|r(| �� || _d| _|| _d| _d S r� )r3 r, r� r� r� r� r� )r( r� r� r� r� r5 r* r+ r, s zCombine.__init__rK c s$ | j rt�| |� n t� �|� | S r& )r� ru r� r3 r{ r5 r* r+ r� " s zCombine.ignorec C sP |� � }|d d �= |td�|�| j��g| jd�7 }| jrH|�� rH|gS |S d S )Nrk )r )r� r rn � _asStringListr� r� r� r )r( r� r� r �retToksr* r* r+ r ) s �zCombine.postParse)rk T) r. r3 r4 r? ru r` rl r� r� r, r� r r? r* r* r5 r+ r� � s ���r� c s2 e Zd ZdZdeed�� fdd� Zdd� Z� ZS ) rj 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� )r3 r, r� � _asPythonList)r( r� r� r5 r* r+ r, K 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 P s � �zGroup.postParse)F� r. r3 r4 r? ru rl r, r r? r* r* r5 r+ rj 6 s rj c s2 e Zd ZdZdeed�� fdd� Zdd� Z� ZS ) r ar 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(attr_expr[1, ...].parse_string(text).dump()) # instead of OneOrMore(expr), parse using Dict(Group(expr)[1, ...]) - Dict will auto-assign names result = Dict(Group(attr_expr)[1, ...]).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� )r3 r, r� � _asPythonDict)r( r� r� r5 r* r+ r, � s z Dict.__init__c C s6 t |�D ]�\}}t|�dkr q|d }t|t�r<t|��� }t|�dkrXtd|�||< qt|�dkr�t|d t�s�t|d |�||< qz |�� }W n" t k r� t d�}|d �Y nX |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 rk r\ zdcould not extract dict values from parsed results - Dict expression must contain Grouped expressions)rd r r r� r` r� r r r� r r� r r� r� �as_dict) r( r� r� r ri �tok�ikey� dictvaluer� r* r* r+ r � s8 � ��zDict.postParse)Fr� r* r* r5 r+ r [ s )r c sl e Zd ZdZdeeef ed�� fdd� Zdd�� fdd � Z dd�� fd d � Z d d � Z ed�dd�Z � Z S )r� a� Converter for ignoring the results of a parsed expression. Example:: source = "a, b, c,d" wd = Word(alphas) wd_list1 = wd + (',' + 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 + (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`.) FrT c s" |dkrt t� �}t� �|� d S )N.)ry rC r3 r, rV r5 r* r+ r, � s zSuppress.__init__ru rK c s, t | jt�r tt|��| S t� �|�S d S r& )r r� ry r� r r3 r} r{ r5 r* r+ r} � s zSuppress.__add__c s, t | jt�r tt|��| S t� �|�S d S r& )r r� ry r� r r3 r� r{ r5 r* r+ r� � s zSuppress.__sub__c C s g S r& r* r r* r* r+ r � s zSuppress.postParsec C s | S r& r* r� r* r* r+ r� � s zSuppress.suppress)F)r. r3 r4 r? r ru r` rl r, r} r� r r� r? r* r* r5 r+ r� � s r� )r� rL c s t � �� � fdd�}� j|_|S )as 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 = wd[1, ...].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 n8 tk r� } ztj�d�||�� � W 5 d }~X Y nX tj�d�||�� |S )N���r# r �.z$>>entering {}(line: {!r}, {}, {!r}) z <<leaving {} (exception: {}) z<<leaving {} (ret: {!r}) ) r. r r� r� �stderrr� r� r� r )�paArgs�thisFuncr} r~ r r1 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\ )ru c C s |d d S r� r* r| r* r* r+ r� r� r� z\\0?[xX][0-9a-fA-F]+c C s t t|d �d�d��S )Nr z\0xr� )�chrr� r� r| r* r* r+ r� # r� z \\0[0-7]+c C s t t|d dd � d��S )Nr r r$ )r� r� r| r* r* r+ r� & r� z\]r r� �^�negate�bodyr� )r} rL c sF dd� � z"d� � fdd�t�| �jD ��W S tk r@ Y dS X 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 )Nrk c s s | ]}t |�V qd S r& )r� ry r* r* r+ r� Q s z+srange.<locals>.<lambda>.<locals>.<genexpr>r r )r r rn r� �ord)�pr* r* r+ r� O s �zsrange.<locals>.<lambda>rk c 3 s | ]}� |�V qd S r& r* )r< �part�� _expandedr* r+ r� T s zsrange.<locals>.<genexpr>N)rn �_reBracketExprrX r� r )r} r* r� r+ �srange4 s �"r� c s, � �fdd�}t �dt �d�j�}||_|S )a^ 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 = Word(hexnums)[1, ...].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)) upperword[1, ...].run_tests(''' my kingdom for a horse ''') wd = Word(alphas).set_parse_action(token_map(str.title)) wd[1, ...].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 | ]}�|f� �� �qS r* r* )r< �tokn�r� r) r* r+ r> s z)token_map.<locals>.pa.<locals>.<listcomp>r* r| r� r* r+ r� ~ s ztoken_map.<locals>.par. r� )r� r. )r) r� r� r� r* r� r+ � token_mapY s %r� 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_localsr� r ru r� r� )rJ �varr* r* r+ �autoname_elements� s r� 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 ru )r< r� r* r* r+ r> � s r� )r# )NF)F)F)F)��osr� r r r r r r r r r r �abcr r �enumr rw r� r r� r� �collections.abcr r� �types�operatorr � functoolsr � threadingr �pathlibr �utilr r r r r r r r rJ r rI � exceptions�actionsrk r r �unicoder! �maxsizer r` �bytesr" r� r� � version_infor% r5 rF r[ rc re rP r� rl rt � warnoptions�environr �sumr rz r� r� r� r� r� r r_ rt r� � GeneratorTyper� r� r r r r r� r� r� �ascii_uppercase�ascii_lowercase�alphas�Latin1� identchars�identbodychars�nums�hexnumsrZ rn � printabler� r{ � StackSummaryr� r� r� r� r� r� ru ry r@ rT rC r� rL r� rP r\ r^ r_ rm r� r� r� r� r� r� r� r� r� r� r� rU r� r� r� rz r� r� r� rS r rs rx ry r{ r� r� r> r� r� r� r� r r/ r� r� rj r r� r� r� r� r� r� r� r� r � _escapedPunc�_escapedHexChar�_escapedOctChar� _singleChar� _charRanger� r� r� r� r� �dbl_quoted_string�sgl_quoted_stringr� �unicode_string� alphas8bit�punc8bitr� �valuesr� �tokenMap�conditionAsParseAction�nullDebugAction�sglQuotedString�dblQuotedString� quotedString� unicodeString� lineStart�lineEnd� stringStart� stringEnd�traceParseActionr* r* r* r+ �<module> s 0 , ! � �� �� ��� = � � � � �� �� *) -vY q EPM / " o (]@!$Q*+N !I w 9%W70 ���� ����%. �� �� ����