]jSrSSKJrJr SSKJr SSKJr "SS\5r "SS\5r "S S \ 5r "S S 5r S r"SS5rg)a The ``Parser`` tries to convert the available Python code in an easy to read format, something like an abstract syntax tree. The classes who represent this tree, are sitting in the :mod:`parso.tree` module. The Python module ``tokenize`` is a very important part in the ``Parser``, because it splits the code into different words (tokens). Sometimes it looks a bit messy. Sorry for that! You might ask now: "Why didn't you use the ``ast`` module for this? Well, ``ast`` does a very good job understanding proper Python code, but fails to work as soon as there's a single line of broken code. There's one important optimization that needs to be known: Statements are not being parsed completely. ``Statement`` is just a representation of the tokens within the statement. This lowers memory usage and cpu time and reduces the complexity of the ``Parser`` (there's another parser sitting inside ``Statement``, which produces ``Array`` and ``Call``). )DictType)tree)ReservedStringc\rSrSrSrSrSrg)ParserSyntaxError zS Contains error information about the parser tree. May be raised as an exception. cXlX lgN)message error_leaf)selfr r s I/home/mande/repo/quber/.venv/lib/python3.13/site-packages/parso/parser.py__init__ParserSyntaxError.__init__&s  $)r r N__name__ __module__ __qualname____firstlineno____doc__r__static_attributes__rrrr s  %rrc\rSrSrSrSrSrg)InternalParseError+z Exception to signal the parser is stuck and error recovery didn't help. Basically this shouldn't happen. It's a sign that something is really wrong. c [RUU<SUR<SU<SU<35 Xl[UlX0lX@lg)Nz: type=z, value=z , start_pos=) Exceptionrnamemsgtypevalue start_pos)rr!type_r#r$s rrInternalParseError.__init__2s;4UI"? @  "r)r!r$r"r#Nrrrrrr+s  #rrc\rSrSrSrSrg)Stack;c0^U4Sjn[U"55$)Nc3># [T5HfnURRH,n[U[5(aUR v M(Uv M. URR (aMf g g7fr )reverseddfa transitions isinstancerr#is_final) stack_node transitionrs riterate@Stack._allowed_transition_names_and_token_types..iterate=s\&tn ",.."<" > ?s 77cHURnURnUupEpg[X$U5nUSRRUn U RUSlU RHn UR[U 55 M URXEXv5n USR RU 5 g![ aD USRR (aUR5 O-URU5 g[a [SXEU5ef=fM)z This is the only core function for parsing. Here happens basically everything. Everything is well prepared by the parser generator and we only apply the necessary steps here. r_Nztoo much input)rWrbrPr-r.rNr0rfr\ IndexErrorrnext_dfa dfa_pushesappendr9rzr=) rrjrOrbr%r#r$rqr2planpushleafs rrcBaseParser._add_tokens $$ */'i)'%@  TRy}}00< b OOD LL4 )$  vA b t$ 9==))IIK''. T()95SS TsB;;8D5DDc:URR5n[UR5S:XaURSnO0UR UR R UR5nURSRRU5 g)Nr`rr_)rbpoprer=rgr-r@r)rrknew_nodes rrfBaseParser._popsmjjnn syy>Q yy|H(():):CIIFH 2##H-r)rYrWrXrbN) file_inputF)rrrrrrTrstrrrBaseNode__annotations__NodertrULeafryrrlr\rgrzrcrfrrrrrRrResz 02Hd3T]]++,199L+-Hd3TYY'(-99L. E,O? %@ .rrRN)rtypingrrparsorparso.pgen2.generatorrrrrr5r(r9rPrRrrrrsV"0% % # # D" N N m.m.r