/h,SSKrSSKJr "SS5rg)N) overriddenc6\rSrSrSrSrSrSrSrSr Sr g ) ParserIa A processing class for deriving trees that represent possible structures for a sequence of tokens. These tree structures are known as "parses". Typically, parsers are used to derive syntax trees for sentences. But parsers can also be used to derive other kinds of tree structure, such as morphological trees and discourse structures. Subclasses must define: - at least one of: ``parse()``, ``parse_sents()``. Subclasses may define: - ``grammar()`` c[5e)z+ :return: The grammar used by this parser. )NotImplementedError)selfs F/var/www/auris/envauris/lib/python3.13/site-packages/nltk/parse/api.pygrammarParserI.grammars "##cl[UR5(a [UR"U//UQ70UD65$[UR5(aSUR"U/UQ70UD645$[UR5(a[ UR"U/UQ70UD65$[ 5e)z :return: An iterator that generates parse trees for the sentence. When possible this list is sorted from most likely to least likely. :param sent: The sentence to be parsed :type sent: list(str) :rtype: iter(Tree) c30# UH nUcMUv M g7fN).0trees r ParserI.parse..1sCDCs )r parse_sentsnext parse_one parse_alliterrr sentargskwargss r parse ParserI.parse%s d&& ' '(($A$A&AB B  ' '!^^DB4B6BC   ' 't=d=f=> >%' 'r c$^^^UUU4SjU5$)zO Apply ``self.parse()`` to each element of ``sents``. :rtype: iter(iter(Tree)) c3P># UHnTR"U/TQ70TD6v M g7fr)r)rrrrr s r r&ParserI.parse_sents..@s$Ded 41$1&1es#&r)r sentsrrs` ``r rParserI.parse_sents;s EeDDr c@[UR"U/UQ70UD65$)z:rtype: list(Tree))listrrs r rParserI.parse_allBs DJJt5d5f566r cB[UR"U/UQ70UD6S5$)z:rtype: Tree or NoneN)rrrs r rParserI.parse_oneFs"DJJt5d5f5t<r3s%9=9=r