
    Ng*                     X    d Z ddlZddlmZ  G d de          Z e            j        ZdS )a  
S-Expression Tokenizer

``SExprTokenizer`` is used to find parenthesized expressions in a
string.  In particular, it divides a string into a sequence of
substrings that are either parenthesized expressions (including any
nested parenthesized expressions), or other whitespace-separated
tokens.

    >>> from nltk.tokenize import SExprTokenizer
    >>> SExprTokenizer().tokenize('(a b (c d)) e f (g)')
    ['(a b (c d))', 'e', 'f', '(g)']

By default, `SExprTokenizer` will raise a ``ValueError`` exception if
used to tokenize an expression with non-matching parentheses:

    >>> SExprTokenizer().tokenize('c) d) e (f (g')
    Traceback (most recent call last):
      ...
    ValueError: Un-matched close paren at char 1

The ``strict`` argument can be set to False to allow for
non-matching parentheses.  Any unmatched close parentheses will be
listed as their own s-expression; and the last partial sexpr with
unmatched open parentheses will be listed as its own sexpr:

    >>> SExprTokenizer(strict=False).tokenize('c) d) e (f (g')
    ['c', ')', 'd', ')', 'e', '(f (g']

The characters used for open and close parentheses may be customized
using the ``parens`` argument to the `SExprTokenizer` constructor:

    >>> SExprTokenizer(parens='{}').tokenize('{a b {c d}} e f {g}')
    ['{a b {c d}}', 'e', 'f', '{g}']

The s-expression tokenizer is also available as a function:

    >>> from nltk.tokenize import sexpr_tokenize
    >>> sexpr_tokenize('(a b (c d)) e f (g)')
    ['(a b (c d))', 'e', 'f', '(g)']

    N)
TokenizerIc                        e Zd ZdZddZd ZdS )SExprTokenizera\  
    A tokenizer that divides strings into s-expressions.
    An s-expresion can be either:

      - a parenthesized expression, including any nested parenthesized
        expressions, or
      - a sequence of non-whitespace non-parenthesis characters.

    For example, the string ``(a (b c)) d e (f)`` consists of four
    s-expressions: ``(a (b c))``, ``d``, ``e``, and ``(f)``.

    By default, the characters ``(`` and ``)`` are treated as open and
    close parentheses, but alternative strings may be specified.

    :param parens: A two-element sequence specifying the open and close parentheses
        that should be used to find sexprs.  This will typically be either a
        two-character string, or a list of two strings.
    :type parens: str or list
    :param strict: If true, then raise an exception when tokenizing an ill-formed sexpr.
    ()Tc                 (   t          |          dk    rt          d          || _        |d         | _        |d         | _        t          j        t          j        |d                    dt          j        |d                              | _        d S )N   z'parens must contain exactly two stringsr      |)	len
ValueError_strict_open_paren_close_parenrecompileescape_paren_regexp)selfparensstricts      O/var/www/html/ai-engine/env/lib/python3.11/site-packages/nltk/tokenize/sexpr.py__init__zSExprTokenizer.__init__O   s    v;;!FGGG!!9"1IZy##<<biq	&:&:<<
 
    c                    g }d}d}| j                             |          D ]
}|                                }|dk    rE||||                                                                         z  }|                                }|| j        k    r|dz  }|| j        k    r| j        r*|dk    r$t          d|                                z            t          d|dz
            }|dk    rC|
                    |||                                                    |                                }| j        r|dk    rt          d|z            |t          |          k     r|
                    ||d                    |S )aQ  
        Return a list of s-expressions extracted from *text*.
        For example:

            >>> SExprTokenizer().tokenize('(a b (c d)) e f (g)')
            ['(a b (c d))', 'e', 'f', '(g)']

        All parentheses are assumed to mark s-expressions.
        (No special processing is done to exclude parentheses that occur
        inside strings, or following backslash characters.)

        If the given expression contains non-matching parentheses,
        then the behavior of the tokenizer depends on the ``strict``
        parameter to the constructor.  If ``strict`` is ``True``, then
        raise a ``ValueError``.  If ``strict`` is ``False``, then any
        unmatched close parentheses will be listed as their own
        s-expression; and the last partial s-expression with unmatched open
        parentheses will be listed as its own s-expression:

            >>> SExprTokenizer(strict=False).tokenize('c) d) e (f (g')
            ['c', ')', 'd', ')', 'e', '(f (g']

        :param text: the string to be tokenized
        :type text: str or iter(str)
        :rtype: iter(str)
        r   r	   z!Un-matched close paren at char %dz Un-matched open paren at char %dN)r   finditergroupstartsplitr   r   r   r   maxappendendr   )r   textresultposdepthmparens          r   tokenizezSExprTokenizer.tokenizeY   ss   6 #,,T22 	" 	"AGGIIEzz$sQWWYY/55777ggii(((
)))< VEQJJ$%H17799%TUUUAuqy))A::MM$sQUUWW}"5666%%''C< 	GEAII?#EFFFT??MM$stt*%%%r   N)r   T)__name__
__module____qualname____doc__r   r(    r   r   r   r   9   sA         *
 
 
 
0 0 0 0 0r   r   )r,   r   nltk.tokenize.apir   r   r(   sexpr_tokenizer-   r   r   <module>r0      sv   ) )V 
			 ( ( ( ( ( (P P P P PZ P P Pf  !!*r   