B >?[B@s:ddlmZmZddlmZddlmZddlmZddl m Z m Z eZ Gddde ZGdd d e ZeGd d d e ZeGd d d eZGdddeZGdddeZeGdddeZeGdddeZeGddde ZGdddeZGdddeZGdddeZddZed kr6ed!S)")print_functionunicode_literals) string_types)Counter)python_2_unicode_compatible) LogicParserAPPc@s*eZdZdZdZdZeegZeegZdS)Tokens()z-oN)__name__ __module__ __qualname__OPENCLOSEIMPZPUNCTTOKENSrr3lib/python3.7/site-packages/nltk/sem/linearlogic.pyr s r c@sHeZdZdZddZddZddZdd Zd d Zd d Z ddZ dS)LinearLogicParserz!A linear logic expression parser.cCs4t|tdtjdddi|_|jtjg7_dS)N)r__init__rr rZoperator_precedenceZright_associated_operations)selfrrrr"s zLinearLogicParser.__init__cCstjS)N)r r)rrrrget_all_symbols(sz!LinearLogicParser.get_all_symbolscCs0|tjkr|||S|tjkr,|||SdS)N)r rZhandle_variablerZ handle_open)rtokcontextrrrhandle+s   zLinearLogicParser.handlecCs|tjkrtSdSdS)N)r r ImpExpression)rrrrrget_BooleanExpression_factory1s z/LinearLogicParser.get_BooleanExpression_factorycCs |||S)Nr)rfactoryfirstsecondrrrmake_BooleanExpression7sz(LinearLogicParser.make_BooleanExpressioncCsT|t|rP|drP|dtjkrP||t}|tjt ||d}|S)zAttempt to make an application expression. If the next tokens are an argument in parens, then the argument expression is a function being applied to the arguments. Otherwise, return the argument expression.rN) Z has_priorityrZinRangetokenr rZprocess_next_expressionZassertNextTokenrApplicationExpression)rZ expressionrargumentrrrattempt_ApplicationExpression:s    z/LinearLogicParser.attempt_ApplicationExpressioncCs |drt|St|SdS)Nr)isupperVariableExpressionConstantExpression)rnamerrrmake_VariableExpressionGs z)LinearLogicParser.make_VariableExpressionN) r r r__doc__rrrr r$r(r-rrrrrs rc@s8eZdZeZeddZd ddZddZdd Z dS) ExpressioncCs |j|S)N)_linear_logic_parserparse)clssrrr fromstringSszExpression.fromstringNcCs t|||S)N)r&)rotherZ other_indicesrrrapplytoWszExpression.applytocCs ||S)N)r6)rr5rrr__call__ZszExpression.__call__cCsd|jj|fS)Nz<%s %s>) __class__r )rrrr__repr__]szExpression.__repr__)N) r r rrr0 classmethodr4r6r7r9rrrrr/Ns   r/c@sXeZdZdddZdddZddZdd Zd d Zd d ZddZ ddZ ddZ dS)AtomicExpressionNcCs&t|tst||_|sg}||_dS)z :param name: str for the constant name :param dependencies: list of int for the indices on which this atom is dependent N) isinstancerAssertionErrorr, dependencies)rr,r>rrrrcs zAtomicExpression.__init__cCs|r||kr||S|SdS)z If 'self' is bound by 'bindings', return the atomic to which it is bound. Otherwise, return self. :param bindings: ``BindingDict`` A dictionary of bindings used to simplify :return: ``AtomicExpression`` Nr)rbindingsrrrsimplifyos zAtomicExpression.simplifycCsg|_|gfS)a3 From Iddo Lev's PhD Dissertation p108-109 :param index_counter: ``Counter`` for unique indices :param glueFormulaFactory: ``GlueFormula`` for creating new glue formulas :return: (``Expression``,set) for the compiled linear logic and any newly created glue formulas )r>)r index_counterglueFormulaFactoryrrr compile_pos|szAtomicExpression.compile_poscCsg|_|gfS)a3 From Iddo Lev's PhD Dissertation p108-109 :param index_counter: ``Counter`` for unique indices :param glueFormulaFactory: ``GlueFormula`` for creating new glue formulas :return: (``Expression``,set) for the compiled linear logic and any newly created glue formulas )r>)rrArBrrr compile_negszAtomicExpression.compile_negcCs||j|_dS)N)Zinitialize_labelr,lower)rfstructrrrinitialize_labelssz"AtomicExpression.initialize_labelscCs|j|jko|j|jkS)N)r8r,)rr5rrr__eq__szAtomicExpression.__eq__cCs ||k S)Nr)rr5rrr__ne__szAtomicExpression.__ne__cCs|j}|jr|d|j7}|S)Nz%s)r,r>)rZaccumrrr__str__szAtomicExpression.__str__cCs t|jS)N)hashr,)rrrr__hash__szAtomicExpression.__hash__)N)N) r r rrr@rCrDrGrHrIrJrLrrrrr;as   r;c@seZdZddZdS)r+cCs^t|tstt|trBy|t||fgStk r>YqNXn ||krN|St|||dS)a If 'other' is a constant, then it must be equal to 'self'. If 'other' is a variable, then it must not be bound to anything other than 'self'. :param other: ``Expression`` :param bindings: ``BindingDict`` A dictionary of all current bindings :return: ``BindingDict`` A new combined dictionary of of 'bindings' and any new binding :raise UnificationException: If 'self' and 'other' cannot be unified in the context of 'bindings' N)r<r/r=r* BindingDictVariableBindingExceptionUnificationException)rr5r?rrrunifys  zConstantExpression.unifyN)r r rrPrrrrr+sr+c@seZdZddZdS)r*cCsVt|tsty"||kr|S|t||fgSWn tk rPt|||YnXdS)a 'self' must not be bound to anything other than 'other'. :param other: ``Expression`` :param bindings: ``BindingDict`` A dictionary of all current bindings :return: ``BindingDict`` A new combined dictionary of of 'bindings' and the new binding :raise UnificationException: If 'self' and 'other' cannot be unified in the context of 'bindings' N)r<r/r=rMrNrO)rr5r?rrrrPs zVariableExpression.unifyN)r r rrPrrrrr*sr*c@s^eZdZddZdddZddZdd Zd d Zd d ZddZ ddZ ddZ ddZ dS)rcCs,t|tstt|tst||_||_dS)z :param antecedent: ``Expression`` for the antecedent :param consequent: ``Expression`` for the consequent N)r<r/r= antecedent consequent)rrQrRrrrrszImpExpression.__init__NcCs||j||j|S)N)r8rQr@rR)rr?rrrr@szImpExpression.simplifycCsXt|tsty$||j|j||j|j|Stk rRt|||YnXdS)a Both the antecedent and consequent of 'self' and 'other' must unify. :param other: ``ImpExpression`` :param bindings: ``BindingDict`` A dictionary of all current bindings :return: ``BindingDict`` A new combined dictionary of of 'bindings' and any new bindings :raise UnificationException: If 'self' and 'other' cannot be unified in the context of 'bindings' N)r<rr=rQrPrRrNrO)rr5r?rrrrPs $zImpExpression.unifycCs6|j||\}}|j||\}}t||||fS)a3 From Iddo Lev's PhD Dissertation p108-109 :param index_counter: ``Counter`` for unique indices :param glueFormulaFactory: ``GlueFormula`` for creating new glue formulas :return: (``Expression``,set) for the compiled linear logic and any newly created glue formulas )rQrDrRrCr)rrArBaa_newcc_newrrrrCszImpExpression.compile_posc Cs`|j||\}}|j||\}}|}|j||d||t|g}||||gfS)aG From Iddo Lev's PhD Dissertation p108-109 :param index_counter: ``Counter`` for unique indices :param glueFormulaFactory: ``GlueFormula`` for creating new glue formulas :return: (``Expression``,list of ``GlueFormula``) for the compiled linear logic and any newly created glue formulas zv%s)rQrCrRrDgetr>appendset) rrArBrSrTrUrVZ fresh_indexZnew_vrrrrDs  zImpExpression.compile_negcCs|j||j|dS)N)rQrGrR)rrFrrrrGs zImpExpression.initialize_labelscCs$|j|jko"|j|jko"|j|jkS)N)r8rQrR)rr5rrrrHs  zImpExpression.__eq__cCs ||k S)Nr)rr5rrrrIszImpExpression.__ne__cCsdtj|jtj|jtjfS)Nz %s%s %s %s%s)r rrQrrRr)rrrrrJs zImpExpression.__str__cCs tdt|jtjt|jfS)Nz%s%s%s)rKrQr rrR)rrrrrL%szImpExpression.__hash__)N) r r rrr@rPrCrDrGrHrIrJrLrrrrrs   rc@s@eZdZdddZdddZddZdd Zd d Zd d ZdS)r&Nc Cs|}|}t|tstt|ts,tt}y>t|trH||j7}t|tr\||j7}||j ||7}Wn4t k r}zt d|||fWdd}~XYnX|rt |jj |kst d||ft |jj |krt d||f||_||_||_dS)aY :param function: ``Expression`` for the function :param argument: ``Expression`` for the argument :param argument_indices: set for the indices of the glue formula from which the argument came :raise LinearLogicApplicationException: If 'function' cannot be applied to 'argument' given 'argument_indices'. zCannot apply %s to %s. %sNzODependencies unfulfilled when attempting to apply Linear Logic formula %s to %szbDependencies not a proper subset of indices when attempting to apply Linear Logic formula %s to %s)r@r<rr=r/rMr&r?rQrPrOLinearLogicApplicationExceptionrYr>functionr')rr[r'Zargument_indicesZ function_simpZ argument_simpr?errrr-s4    "  zApplicationExpression.__init__cCs|s |j}|j|jS)a= Since function is an implication, return its consequent. There should be no need to check that the application is valid since the checking is done by the constructor. :param bindings: ``BindingDict`` A dictionary of bindings used to simplify :return: ``Expression`` )r?r[r@rR)rr?rrrr@Ys zApplicationExpression.simplifycCs$|j|jko"|j|jko"|j|jkS)N)r8r[r')rr5rrrrHgs  zApplicationExpression.__eq__cCs ||k S)Nr)rr5rrrrInszApplicationExpression.__ne__cCs d|jtjd|jtjS)Nz%s)r[r rr'r)rrrrrJqszApplicationExpression.__str__cCs tdt|jtjt|jfS)Nz%s%s%s)rKrQr rrR)rrrrrLtszApplicationExpression.__hash__)N)N) r r rrr@rHrIrJrLrrrrr&+s  , r&c@sVeZdZdddZddZddZdd Zd d Zd d ZddZ ddZ ddZ dS)rMNcCs:i|_t|tr|}|r6x|D]\}}|||<q"WdS)z :param bindings: list [(``VariableExpression``, ``AtomicExpression``)] to initialize the dictionary dict {``VariableExpression``: ``AtomicExpression``} to initialize the dictionary N)dr<dictitems)rr?vbrrrr|s  zBindingDict.__init__cCs^t|tstt|tst||ks(t|j|d}|rB||krN||j|<n td|dS)a A binding is consistent with the dict if its variable is not already bound, OR if its variable is already bound to its argument. :param variable: ``VariableExpression`` The variable bind :param binding: ``Expression`` The expression to which 'variable' should be bound :raise VariableBindingException: If the variable cannot be bound in this dictionary Nz*Variable %s already bound to another value)r<r*r=r/r]rWrN)rvariableZbindingexistingrrr __setitem__s    zBindingDict.__setitem__cCsJt|tst|j|}x,|rDy|j|}Wqtk r@|SXqWdS)zD Return the expression to which 'variable' is bound N)r<r*r=r]KeyError)rrbZ intermediaterrr __getitem__s zBindingDict.__getitem__cCs ||jkS)N)r])ritemrrr __contains__szBindingDict.__contains__cCspyFt}x|jD]}|j|||<qWx|jD]}|j|||<q.W|Stk rjtd||fYnXdS)a :param other: ``BindingDict`` The dict with which to combine self :return: ``BindingDict`` A new dict containing all the elements of both parameters :raise VariableBindingException: If the parameter dictionaries are not consistent with each other zAAttempting to add two contradicting VariableBindingsLists: %s, %sN)rMr]rN)rr5Zcombinedr`rrr__add__s  zBindingDict.__add__cCs ||k S)Nr)rr5rrrrIszBindingDict.__ne__cCst|tst|j|jkS)N)r<rM TypeErrorr])rr5rrrrHs zBindingDict.__eq__cs"ddfddjDdS)N{z, c3s |]}d|j|fVqdS)z%s: %sN)r]).0r`)rrr sz&BindingDict.__str__..})joinr])rr)rrrJszBindingDict.__str__cCsd|S)NzBindingDict: %sr)rrrrr9szBindingDict.__repr__)N) r r rrrdrfrhrirIrHrJr9rrrrrMzs  rMc@s eZdZdS)rNN)r r rrrrrrNsrNc@seZdZddZdS)rOcCst|d|||fdS)Nz Cannot unify %s with %s given %s) Exceptionr)rrSrar?rrrrszUnificationException.__init__N)r r rrrrrrrOsrOc@s eZdZdS)rZN)r r rrrrrrZsrZcCsztj}t|dt|dt|dt|dt|dt|dt|dt|ddS) Nfz(g -o f)z((g -o G) -o G)z g -o h -o fz (g -o f)(g)z (H -o f)(g)z((g -o G) -o G)((g -o f))z(H -o H)((g -o f)))r/r4printr@)Zlexprrrrdemos    rs__main__N)Z __future__rrZsixrZnltk.internalsrZ nltk.compatrZnltk.sem.logicrrZ_counterobjectr rr/r;r+r*rr&rMrprNrOrZrsr rrrrs2    /  C [ N Y