U er@s^ddlmZddlmZddlmZmZmZGdddZd ddZ d d Z e d krZe dS) ) load_parser)InstantiateVarsChart)ApplicationExpressionLambdaExpressionVariablec@s*eZdZdZddZddZd ddZd S) CooperStorezK A container for handling quantifier ambiguity via Cooper storage. cCsJ||_g|_z|d|_|d|_Wn tk rDtd|YnXdS)z :param featstruct: The value of the ``sem`` node in a tree from ``parse_with_bindops()`` :type featstruct: FeatStruct (with features ``core`` and ``store``) ZCOREZSTOREz$%s is not a Cooper storage structureN) featstructreadingscorestoreKeyErrorprint)selfrrX/var/www/html/assets/scripts/venv/lib/python3.8/site-packages/nltk/sem/cooper_storage.py__init__s zCooperStore.__init__ccsLdd}|rBt|D]*\}}||||D]}|f|Vq,qndVdS)z{ :return: An iterator over the permutations of the input list :type lst: list :rtype: iter cSs|d|||ddS)Nr)Zlst0indexrrr'z&CooperStore._permute..rN) enumerate_permute)rlstremoverxyrrrr!s zCooperStore._permuteFcCst||jD]n\}}|r,td|d|j}|D]:}t|j\}}t|t|j |}|rhtd|| }q6|j |qdS)aI Carry out S-Retrieval of binding operators in store. If hack=True, serialize the bindop and core as strings and reparse. Ugh. Each permutation of the store (i.e. list of binding operators) is taken to be a possible scoping of quantifiers. We iterate through the binding operators in each permutation, and successively apply them to the current term, starting with the core semantic representation, working from the inside out. Binding operators are of the form:: bo(\P.all x.(man(x) -> P(x)),z1) zPermutation %srz N) rrr r r tupleargsrrvariablesimplifyr append)rtracepermZ store_permtermZbindopZquantZvarexrrr s_retrieve/s   zCooperStore.s_retrieveN)F)__name__ __module__ __qualname____doc__rrr$rrrrr srNcCs,|sd}t||td}|}t||S)zC Use a grammar with Binding Operators to parse a sentence. z#grammars/book_grammars/storage.fcfg)r!Z chart_class)rrsplitlistparse)sentenceZgrammarr!parsertokensrrrparse_with_bindopsPs r/cCsddlm}d}ttd|td|j|dd}|D]}||d}ttdtd |jD] }t|qnttd td t|jttd td |jd dtd td t |j D]\}}t|dd|qqs  C