B M§aã@s„dZddlmZmZddlmZddlmZGdd„deƒZ Gdd„deƒZ Gd d „d e ƒZ Gd d „d ƒZ d d„ZGdd„dƒZdS)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``). é)ÚDictÚType)Útree)ÚReservedStringc@seZdZdZdd„ZdS)ÚParserSyntaxErrorz_ Contains error information about the parser tree. May be raised as an exception. cCs||_||_dS)N)ÚmessageÚ error_leaf)Úselfrr©r ú+lib/python3.7/site-packages/parso/parser.pyÚ__init__&szParserSyntaxError.__init__N)Ú__name__Ú __module__Ú __qualname__Ú__doc__r r r r r r src@seZdZdZdd„ZdS)ÚInternalParseErrorz¦ 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. cCs6t |d||j||f¡||_t|_||_||_dS)Nz#%s: type=%r, value=%r, start_pos=%r)Ú Exceptionr ÚnameÚmsgÚtypeÚvalueÚ start_pos)r rÚtype_rrr r r r 2s zInternalParseError.__init__N)r rrrr r r r r r+src@seZdZdd„ZdS)ÚStackcs‡fdd„}t|ƒƒS)Nc3sLxFtˆƒD]:}x*|jjD]}t|tƒr0|jVq|VqW|jjs Pq WdS)N)ÚreversedÚdfaÚ transitionsÚ isinstancerrÚis_final)Z stack_nodeÚ transition)r r r Úiterate=s   z@Stack._allowed_transition_names_and_token_types..iterate)Úlist)r r r )r r Ú)_allowed_transition_names_and_token_types<s z/Stack._allowed_transition_names_and_token_typesN)r rrr"r r r r r;src@s(eZdZdd„Zedd„ƒZdd„ZdS)Ú StackNodecCs||_g|_dS)N)rÚnodes)r rr r r r MszStackNode.__init__cCs|jjS)N)rÚ from_rule)r r r r Ú nonterminalQszStackNode.nonterminalcCsd|jj|j|jfS)Nz %s(%s, %s))Ú __class__r rr$)r r r r Ú__repr__UszStackNode.__repr__N)r rrr Úpropertyr&r(r r r r r#Ls r#cCs,|jjr(y |j|Stk r&YnX|S)N)rZcontains_syntaxZreserved_syntax_stringsÚKeyError)Úgrammarrrr r r Ú_token_to_transitionYs  r,c@sŒeZdZUdZiZeeeej fe d<ej Z iZ eeeejfe d<ejZddd„Zdd „Zd d „Zd d „Zdd„Zdd„Zdd„ZdS)Ú BaseParseraIParser engine. A Parser instance contains state pertaining to the current token sequence, and should not be used concurrently by different threads to parse separate token sequences. See python/tokenize.py for how to get input tokens by a string. When a syntax error occurs, error_recovery() is called. Únode_mapÚleaf_mapÚ file_inputFcCs||_||_||_dS)N)Ú _pgen_grammarÚ_start_nonterminalÚ_error_recovery)r Z pgen_grammarZstart_nonterminalÚerror_recoveryr r r r wszBaseParser.__init__cCs’|jj|jd}tt|ƒgƒ|_x|D]}| |¡q(WxR|jd}|jjsbt d|j |j |j ƒ‚t |jƒdkrz| ¡q<| |j|j¡SqrrrÚprefixrr r r r4’s   zBaseParser.error_recoverycCs8y|j||ƒ}Wn tk r2| ||¡}YnX|S)N)r.r*Ú default_node)r r&ZchildrenZnoder r r r<šs zBaseParser.convert_nodecCs6y|j||||ƒStk r0| |||¡SXdS)N)r/r*Ú default_leaf)r rrrBrr r r Ú convert_leaf¡szBaseParser.convert_leafc Csè|j}|j}|\}}}}t|||ƒ}xty|djj|} PWq&tk rt|djjrb| ¡n| |¡dSYq&t k r”t d|||ƒ‚Yq&Xq&W| j |d_x| j D]} |  t| ƒ¡q®W| ||||¡} |dj  | ¡dS)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. r5Nztoo much input)r1r7r,rrr*rr;r4Ú IndexErrorrZnext_dfaZ dfa_pushesÚappendr#rEr$) r r>r+r7rrrrBrZplanÚpushZleafr r r r8§s(       zBaseParser._add_tokencCsL|j ¡}t|jƒdkr$|jd}n| |jj|j¡}|jdj |¡dS)Nr6rr5)r7Úpopr:r$r<rr%rG)r r?Znew_noder r r r;Çs   zBaseParser._popN)r0F)r rrrr.rÚstrrrZBaseNodeÚ__annotations__ZNoderCr/ZLeafrDr r@r4r<rEr8r;r r r r r-es   r-N)rÚtypingrrZparsorZparso.pgen2.generatorrrrrr!rr#r,r-r r r r Ús