+ hmAX^RIHt^RIHtHt]!4t!RR4t!RR]4t!RR4t!R R ]4t !R R ] 4t !R R] 4t !RR]4t !RR]4t !RR4t!RR]4t!RR]4t!RR]4tRt]R8Xd ]!4R#R#))Counter)APP LogicParserc>]tRt^tRtRtRt]].t]].,tRt R#)Tokens()z-oN) __name__ __module__ __qualname____firstlineno__OPENCLOSEIMPPUNCTTOKENS__static_attributes__r 6/usr/lib/python3/dist-packages/nltk/sem/linearlogic.pyrrs' D E C 5ME cU]FrrcNa]tRt^toRtRtRtRtRtRt Rt Rt R t Vt R #) LinearLogicParserz!A linear logic expression parser.c\P!V4\^\P^R^/VnV;P \P., unR#)N)r__init__rrroperator_precedenceright_associated_operationsselfs&rrLinearLogicParser.__init__s@T"$'FJJ4#C  ((VZZL8(rc"\P#N)rrrs&rget_all_symbols!LinearLogicParser.get_all_symbols$s }}rcV\P9dVPW4#V\P8XdVP W4#R#r")rrhandle_variabler handle_open)rtokcontexts&&&rhandleLinearLogicParser.handle'sA fmm #''5 5 FKK ##C1 1 rc<V\P8Xd\#R#r")rr ImpExpression)rr(s&&rget_BooleanExpression_factory/LinearLogicParser.get_BooleanExpression_factory-s &**  rcV!W#4#r"r )rfactoryfirstseconds&&&&rmake_BooleanExpression(LinearLogicParser.make_BooleanExpression3s u%%rc TVP\V4'dVP^4'duVP^4\P 8XdQVP4VP \4pVP\P4\WR4pV#)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.N) has_priorityrinRangetokenrrprocess_next_expressionassertNextTokenrApplicationExpression)r expressionr)arguments&&& rattempt_ApplicationExpression/LinearLogicParser.attempt_ApplicationExpression6st   S' * *||A4::a=FKK#? 77<$$V\\22:N rchV^,P4'd \V4#\V4#)r)isupperVariableExpressionConstantExpression)rnames&&rmake_VariableExpression)LinearLogicParser.make_VariableExpressionCs) 7??  %d+ +%d+ +r)rN)r r r r__doc__rr#r*r.r4r?rFr__classdictcell__ __classdict__s@rrrs0+9 2  & ,,rrcTa]tRt^Jto]!4t]R4tRRltRt Rt Rt Vt R#) Expressionc8VPPV4#r")_linear_logic_parserparse)clsss&&r fromstringExpression.fromstringMs''--a00rNc\WV4#r")r<)rother other_indicess&&&rapplytoExpression.applytoQs$T-@@rc$VPV4#r")rXrrVs&&r__call__Expression.__call__Ts||E""rc<RVPP RV R2#)< >) __class__r rs&r__repr__Expression.__repr__Ws"4>>**+1TF!44rr r") r r r rrrO classmethodrSrXr\rcrrIrJs@rrMrMJs5,.11A#55rrMc^a]tRt^[toR RltR RltRtRtRtRt Rt R t R t R t VtR#) AtomicExpressionNc b\V\4'gQhWnV'g.pW nR#)zy :param name: str for the constant name :param dependencies: list of int for the indices on which this atom is dependent N) isinstancestrrE dependencies)rrErks&&&rrAtomicExpression.__init__\s* $$$$$ L(rc 2V'dW9d W,#V#)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`` r rbindingss&&rsimplifyAtomicExpression.simplifyhs (> !Krc .VnV.3#a  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 rkr index_counterglueFormulaFactorys&&&r compile_posAtomicExpression.compile_posubzrc .VnV.3#rsrtrus&&&r compile_negAtomicExpression.compile_negrzrcbVPVPP44VnR#r")initialize_labelrElowerrfstructs&&rinitialize_labels"AtomicExpression.initialize_labelss,,TYY__->? rcvVPVP8H;'dVPVP8H#r")rbrEr[s&&r__eq__AtomicExpression.__eq__s*~~0LLTYY%**5LLrc W8X*#r"r r[s&&r__ne__AtomicExpression.__ne__   rcvVPpVP'dVRVP,, pV#z%s)rErk)raccums& r__str__AtomicExpression.__str__s1      TD--- -E rc,\VP4#r")hashrErs&r__hash__AtomicExpression.__hash__sDIIr)rkrEr")r r r rrrprxr|rrrrrrrIrJs@rrgrg[s9 )   @M! rrgc&a]tRt^toRtRtVtR#)rDc \V\4'gQh\V\4'dV\W3.4,#W8XdV#\ WV4h \dLi;i)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' )rirMrC BindingDictVariableBindingExceptionUnificationException)rrVros&&&runifyConstantExpression.unifysk%,,,, e/ 0 0 +}o">>>]O"499 ,  sA A&%A&r Nr r r rrrrIrJs@rrDrDs::rrDc&a]tRt^toRtRtVtR#)rCc \V\4'gQhW8XdV#V\W3.4,# \dp\ YT4ThRp?ii;i)aX '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)rirMrrrrrVroes&&& rrVariableExpression.unifys\%,,,, E}+}o">>>' E&tH=1 D Es66 A AAr NrrJs@rrCrCsEErrCc`a]tRt^toRtR RltRtRtRtRt Rt R t R t R t R tVtR#)r-c ~\V\4'gQh\V\4'gQhWnW nR#)zk :param antecedent: ``Expression`` for the antecedent :param consequent: ``Expression`` for the consequent N)rirM antecedent consequent)rrrs&&&rrImpExpression.__init__s4 *j1111*j1111$$rNcVPVPPV4VPPV44#r")rbrrprrns&&rrpImpExpression.simplifys6~~ OO $ $X .0H0H0R  rc $\V\4'gQhVVPPVPV4,VPPVPV4,# \ dp\ YT4ThRp?ii;i)ah 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)rir-rrrrrrs&&& rrImpExpression.unifys%//// E//''(8(8(CD//''(8(8(CD  ( E&tH=1 D EsAA22 B= B  Bc VPPW4wr4VPPW4wrV\ W54WF,3#rs)rr|rrxr-)rrvrwaa_newcc_news&&& rrxImpExpression.compile_possB__00S __00S a#U]33rc VPPW4wr4VPPW4wrVVP 4pVP P V4V!RV,W704pWTV,V.,3#)a 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)rrxrr|getrkappend) rrvrwrrrr fresh_indexnew_vs &&& rr|ImpExpression.compile_negsw__00S __00S #'')  k*"5;#6=I5=E7*++rcrVPPV4VPPV4R#r")rrrrs&&rrImpExpression.initialize_labelss& ))'2 ))'2rcVPVP8H;'d;VPVP8H;'dVPVP8H#r")rbrrr[s&&rrImpExpression.__eq__ sO NNeoo - 4 45#3#33 4 45#3#33 rc W8X*#r"r r[s&&rrImpExpression.__ne__rrcRP\PVP\PVP \P 4#)z {}{} {} {}{})formatrrrrrrrs&rrImpExpression.__str__s8$$ KK OO JJ OO LL   rc\\VP4 \P \VP4 24#r")rrrrrrs&rrImpExpression.__hash__s2tDOO,-fjj\$t:O9PQRRr)rrr")r r r rrrprrxr|rrrrrrrIrJs@rr-r-s?% E& 4 ,3 ! SSrr-cLa]tRtRtoR RltR RltRtRtRtRt R t Vt R#) r<i!Nc  VP4pVP4p\V\4'gQh\V\4'gQh\ 4p\V\ 4'dWaP , p\V\ 4'dWbP , pWdPPWV4, pT'do\TPP4T8g\RT: RT: 24h\TPP4T8Xd\RT: RT: 24hYn Y nY`nR# \dp\RT RT RT 24ThRp?ii;i)a1 :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'. z Cannot apply z to z. NzGDependencies unfulfilled when attempting to apply Linear Logic formula zZDependencies not a proper subset of indices when attempting to apply Linear Logic formula )rprir-rMrr<rorrrLinearLogicApplicationExceptionsetrkfunctionr>)rrr>argument_indices function_simp argument_simprors&&&& rrApplicationExpression.__init__"sU!))+  ))+ -7777-4444= ($9::---($9::--- 0066}O OH }//<<=@PP5$m5=++889=MM5$m5 !   +$ 1 d=/A3G  sA1E E<"E77E<c tV'g VPpVPPV4P#)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`` )rorrprrns&&rrpApplicationExpression.simplifyNs+}}H}}%%h/:::rcVPVP8H;'d;VPVP8H;'dVPVP8H#r")rbrr>r[s&&rrApplicationExpression.__eq__\sK NNeoo - 0 0 / 0 0 / rc W8X*#r"r r[s&&rrApplicationExpression.__ne__crrcRVP,\P,RVP,,\P,#r)rrrr>rrs&rrApplicationExpression.__str__fs1dmm#fkk1D4==4HH6<<WWrc\\VP4 \P \VP4 24#r")rrrrrrs&rrApplicationExpression.__hash__is2tDOO,-fkk]4;P:QRSSr)r>rorr") r r r rrrprrrrrrIrJs@rr<r<!s,*!X ; !XTTrr<cZa]tRtRtoR RltRtRtRtRtRt R t R t R t R t VtR#)rimNc /Vn\V\4'dVP4pV'dVF wr#W0V&K R#R#)z :param bindings: list [(``VariableExpression``, ``AtomicExpression``)] to initialize the dictionary dict {``VariableExpression``: ``AtomicExpression``} to initialize the dictionary N)dridictitems)rrovbs&& rrBindingDict.__init__ns?  h % %~~'H  Q! rc \V\4'gQh\V\4'gQhW8wgQhVPP VR4pV'dW#8XdW PV&R#\ RV,4h)ac 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)rirCrMrrr)rvariablebindingexistings&&& r __setitem__BindingDict.__setitem__}st($67777':...."""66::h-7.&FF8 *<I rc \V\4'gQhVPV,pV'dVPV,pKR# \dTu#i;i)z4 Return the expression to which 'variable' is bound N)rirCrKeyError)rr intermediates&& r __getitem__BindingDict.__getitem__sX($67777vvh'  $#vvl3  $## $sA AAcWP9#r"r)ritems&&r __contains__BindingDict.__contains__svv~rc \4pVPFpVPV,W#&K VPFpVPV,W#&K V# \dp\RT: RT: 24ThRp?ii;i)z :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 z;Attempting to add two contradicting VariableBindingsLists: , N)rrr)rrVcombinedrrs&& r__add__BindingDict.__add__sz "}HVV"ffQi WW#ggaj O' *48%A  sAA B)A==Bc W8X*#r"r r[s&&rrBindingDict.__ne__rrcl\V\4'g\hVPVP8H#r")rir TypeErrorrr[s&&rrBindingDict.__eq__s'%--Ovv  rcaRRPV3Rl\SPP4444,R,#){rc3R<"TFq RSPV, 2xK R#5i)z: Nr).0rrs& r &BindingDict.__str__..s$Rrs#+ 9  ,, ,,^55"@z@F:):,E)E(VSJVSrITJITXV(V(r y P9P  i  3 zFr