QvSrSSKJr SSKJr SSKJr SSKJr SSK J r SS K J r SS KJrJr "S S \ 5r g )aThis module implements an experimental Earley parser with a dynamic lexer The core Earley algorithm used here is based on Elizabeth Scott's implementation, here: https://www.sciencedirect.com/science/article/pii/S1571066108001497 That is probably the best reference for understanding the algorithm here. The Earley parser outputs an SPPF-tree as per that document. The SPPF tree format is better documented here: http://www.bramvandersanden.com/post/2014/06/shared-packed-parse-forest/ Instead of running a lexer beforehand, or using a costy char-by-char method, this parser uses regular expressions by necessity, achieving high-performance while maintaining all of Earley's power in parsing any CFG. ) defaultdict)Tree)UnexpectedCharacters)Token)Terminal)Parser) SymbolNode TokenNodec0\rSrSrSSS\4SjrSSjrSrg) r TFc [R"XX#XFU5 URVs/sHn[U5PM snUlXPlgs snfN) BaseParser__init__ignorer complete_lex) self lexer_conf parser_conf term_matcherresolve_ambiguityrdebug tree_classts 'lib/third_party/lark/parsers/xearley.pyrParser.__init__sEDkIZcmn,6,=,=>,=qx{,=> (?sA Nc r^^^^^^ ^ ^ ^ ^ UUU UUUU U U U 4 Sjn[[5mTRm TRRm 0/m Sm Sm SnTH6nTR XcTT 5 U"Xc5nUS:XaT S- m Sm OT S- m US- nM8 TR XcTT 5 U[ T5S- :XdeU$)Nc > 0n[U5GH/nT"URTU5nU(dM![URRUR S5UTT5nTUR 5R X0U45 TR(dMUR S5n[S[U55H{nT"URUSU*5nU(dM#[URRUR S5UTT5nTXR 5-R X0U45 M} GM2 TRHnT"UTU5nU(dMTUR 5RUVs/sHo3US4PM sn5 TUR 5RTUVs/sH+o3R(dMURT:XdM'X0S4PM- sn5 M [5n [5n TR U 5 TR 05 TUS-GHup;n U bTU lTS-U lUS-U lUR#5n U RU R$U4n['U TU R(5nX;aX.OUR+U[-U65U lU R.R1U RUR2U R$UR.U5 OUn U RTR4;aU R7U 5 GMU R7U 5 GM TUS- U (doT(dhU (da[9[;USS95n[=TUTTUVs1sHo3RRiM sn[U5[?SU55US9eU $s snfs snfs snf)a@The core Earley Scanner. This is a custom implementation of the scanner that uses the Lark lexer to match tokens. The scan list is built by the Earley predictor, based on the previously completed tokens. This ensures that at each phase of the parse we have a custom lexer context, allowing for more complex ambiguities.rr NcBURRR$r)ruleoriginnamekeys r-Parser._parse..scan..vsH\H\r%c38# UHoRv M g7fr)s).0is r .Parser._parse..scan..xsH^V]QRV]s)stateconsidered_rules) setexpectrr$groupendappendrrangelenrextend is_completer+end_line end_columnend_posadvancestartr type setdefaultr node add_familyr" TERMINALSaddlistsortedr frozenset)r-to_scan node_cacheitemmrr+jx next_to_scannext_setr?tokennew_itemlabel token_noder1columnsdelayed_matchesmatchr start_symbolstream terminals text_column text_line transitivess rscanParser._parse..scan#sqJG $++vq11dkk.. Ay+VA#AEEG,33dq\C(((GGAJ!&q#a&!1A %dkk1Sqb6 :A q$)$++*:*:AGGAJ9Va$b /%%' : A ADQ< Q "2%.[[!VQ'1#AEEG,33QX4ZQXAt_QX4Z[$AEEG,33QXYZQ[5LQ[_o_o_txtztzKuK_dt_Q[5LM!5LuH NN8 $   r "'6ac&:"U$%.EN'2QE$$%EEM#||~H%ZZ;E!*5)EJJ2G!HJ9>9LJ$5R\RgRghmoy|ApBSCHMMM,,XZZHNNTXT]T]_ij#H??dnn4 $$X.LL*'';* !$OL#'w<\(]#^ *61ilsNtlsdh{{O_O_lsNt+.wrss/ $-(0DZDr)