{ sY !-- bgggooc3 7 7 = = ? ? E E G GHH H!&&((
r% r r r r z) r r r namer9 alphas alphanumsdbl_quoted_stringr r;
remove_quotesr r r r r r
printablesr rB r r< r r r r r SkipTotag_body) tagStrxml suppress_LT suppress_GT tagAttrName tagAttrValueopenTagcloseTagr s @r# _makeTagsr N s &(## c'222+vy5 011K
(--//@@ OO fUmm
:eK(3--$?,$N O OPPQQ
R (c#w'''00AA++
%))++<<]KKd cO
O
O
fUmm
#445K5KLL hsmml :;;<
(c#w'''00AA++
wt}}v-3eDDDH Vg%&&&
x
S117799??AABBB hw !!
GKHL hhjj))G H r% tag_strc " t | d S )aP Helper to construct opening and closing tag expressions for HTML,
given a tag name. Matches tags in either upper or lower case,
attributes with namespaces and with quoted or unquoted values.
Example::
text = '| More info at the pyparsing wiki page | '
# make_html_tags returns pyparsing expressions for the opening and
# closing tags as a 2-tuple
a, a_end = make_html_tags("A")
link_expr = a + SkipTo(a_end)("link_text") + a_end
for link in link_expr.search_string(text):
# attributes in the tag (like "href" shown here) are
# also accessible as named results
print(link.link_text, '->', link.href)
prints::
pyparsing -> https://github.com/pyparsing/pyparsing/wiki
Fr r s r# make_html_tagsr
s 0 We $ $$r% c " t | d S )zHelper to construct opening and closing tag expressions for XML,
given a tag name. Matches tags only in the given upper/lower case.
Example: similar to :class:`make_html_tags`
Tr r s r#
make_xml_tagsr s Wd # ##r% any_open_tag
any_close_tagz_:zany tagc @ i | ]\ }}| d | S );)rstrip)rC kvs r# r{ r{ s( KKKtq!!((3--KKKr% z &(?Prs z);zcommon HTML entityc @ t | j S )zRHelper parser action to replace common HTML entities with their special characters)_htmlEntityMapgetentityr4 s r# replace_html_entityr s ah ' ''r% c e Zd ZdZdZdS )OpAssocr r` N)__name__
__module__ __qualname__LEFTRIGHTrj r% r# r r s D
EEEr% r base_exprop_listlparrparc Z G d dt }d|_ t }t |t rt | }t |t rt | }t |t
rt |t
s| t
||z |z z }n | ||z |z z }t | D ]V\ }}|dz dd \ } }
} } t | t rt
| } |
dk rZt | t t f rt | dk rt d | \ }
}d
|
| }nd | }d |
cxk rdk sn t d
| t j t j fvrt d t | }| t j u r|
d k r) ||| z t
|| d z z }n|
dk rW| / ||| z |z t
|| |z d z z }nc |||z t
|d z }n=|
dk r@ |||
z |z |z |z t
|t) |
|z |z |z z z }n| t j u r|
d k rKt | t* st+ | } || j |z t
| |z z }n|
dk rX| . ||| z |z t
|| |z d z z }na |||z t
||d z z }n9|
dk r3 |||
z |z |z |z t
||
z |z |z |z z }| r._FBTc @ | j || |g fS rA )r try_parse)selfinstringr doActionss r# parseImplz%infix_notation.._FB.parseImpl( s# I # . . .7Nr% NT)r r r r, rj r% r# _FBr& ' s( r% r. z FollowedBy>rA N r` z@if numterms=3, opExpr must be a tuple or list of two expressionsz {}{} termz{} termr z6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity)r .)r` .)
FollowedByr r8 r r r r r r r r tupler rF r r r r r r r r r r; setName)r r! r" r# r. r lastExprr operDefopExprarityrightLeftAssocpaopExpr1opExpr2 term_namethisExprr s r# infix_notationr> s b j
!CL
))C$ ~~$ ~~
tX & & 3:dH+E+E 3 uTCZ$%6 7 77 s
T 12 (( < <
7-4w->,C)~r fh ' ' ?"66v>>F A:: fudm44
F q8H8H V & GW#**7G< > > QRR R #II . .y 9 9 W\ ) )zz C6 1 2 2U8fVn;T5U5U U !% #Hv$5$@ A AE FX$5v#>>E E !II !$Hx$7 8 85&AQ;R;R RII! C w&1G;hF (Yw/AG/Kh/V%W%WWXX Y w}
,
,zz!&#.. ) [[F C h 6 7 7%@Q:R:R R !% #Hv$5$@ A AE FX$5v#>>E E !II !$Hx$7 8 85 8F#33< < !II ! C w&1G;hF (W,x7'AHLMM N /"udm,,
/* *B///**2...i(*33I>>>HC Jr% c dd fd fd}fd}fd}t t d }t t | z d }t | d } t | d }
|rSt t | |z t | t | z t | z z |
z } n\t t | t | t | z t | z z t |
z } |
fd
| fd | t t z | d S )
a
(DEPRECATED - use IndentedBlock class instead)
Helper method for defining space-delimited indentation blocks,
such as those used to define block statements in Python source code.
Parameters:
- ``blockStatementExpr`` - expression defining syntax of statement that
is repeated within the indented block
- ``indentStack`` - list created by caller to manage indentation stack
(multiple ``statementWithIndentedBlock`` expressions within a single
grammar should share a common ``indentStack``)
- ``indent`` - boolean indicating whether block must be indented beyond
the current level; set to ``False`` for block of left-most statements
(default= ``True``)
A valid block must contain at least one ``blockStatement``.
(Note that indentedBlock uses internal parse actions which make it
incompatible with packrat parsing.)
Example::
data = '''
def A(z):
A1
B = 100
G = A2
A2
A3
B
def BB(a,b,c):
BB1
def BBA():
bba1
bba2
bba3
C
D
def spam(x,y):
def eggs(z):
pass
'''
indentStack = [1]
stmt = Forward()
identifier = Word(alphas, alphanums)
funcDecl = ("def" + identifier + Group("(" + Opt(delimitedList(identifier)) + ")") + ":")
func_body = indentedBlock(stmt, indentStack)
funcDef = Group(funcDecl + func_body)
rvalue = Forward()
funcCall = Group(identifier + "(" + Opt(delimitedList(rvalue)) + ")")
rvalue << (funcCall | identifier | Word(nums))
assignment = Group(identifier + "=" + rvalue)
stmt << (funcDef | assignment | identifier)
module_body = stmt[1, ...]
parseTree = module_body.parseString(data)
parseTree.pprint()
prints::
[['def',
'A',
['(', 'z', ')'],
':',
[['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
'B',
['def',
'BB',
['(', 'a', 'b', 'c', ')'],
':',
[['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
'C',
'D',
['def',
'spam',
['(', 'x', 'y', ')'],
':',
[[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]]
Nc " d d d < d S Nrj )
backup_stacks indentStacks r# reset_stackz"indentedBlock..reset_stack s &r* AAAr% c |t | k rd S t || }|d k r.|d k rt | |d t | |d d S )NrB zillegal nestingznot a peer entry)rF colrS r, r- r. curColrD s r# checkPeerIndentz&indentedBlock..checkPeerIndent sp A;; FQ [_ $ $ B''$Q+<=== A'9:: : % $r% c t || }|d k r | d S t | |d )NrB znot a subentry)rG appendrS rH s r# checkSubIndentz%indentedBlock..checkSubIndent sL Q KO # # v & & & & & A'788 8r% c |t | k rd S t || }r|v st | |d |d k r d S d S )Nznot an unindentrB )rF rG rS r rH s r#
checkUnindentz$indentedBlock..checkUnindent sv A;; FQ :+ 5 5 A'899 9 KO # # OO $ #r% z INDENTr UNINDENTc : r d od nd S rA r )rC s r# r5 z indentedBlock.. s" -I
!!"%%.$T r% c S rA rj )re rf cdrE s r# r5 z indentedBlock.. s
kkmm r% zindented block)rL r LineEndset_whitespace_charssuppressr+ r; r r r r< set_fail_actionignorer )
blockStatementExprrD indentrC rJ rM rO NLrP PEERUNDENTsmExprrE s
` ` @r#
indentedBlockra { sX l QQQ (((+ + + + + +; ; ; ; ;9 9 9 9 9
79911%88AACC D DBgg00 @@@
J
J8
T
TF 77 # #O 4 4 = =b A AD
WW
%
%m
4
4
=
=j
I
IF
GG
u%7 8 883r77BCC
D
GGu%7 8 883r77BCC
D&kk
IIII ;;;;<<< g 1222 ??+ , ,,r% z/\*(?:[^*]|\*(?!/))*z*/zC style commentzz HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z
// commentzC++ style commentz#.*zPython style commentc < g | ]}t |t |S rj )r r )rC r s r#
rc % s7 ' ' '
*Q
">">'' ' 'r% _builtin_exprs)r FNNrA )FTFr- )\
html.entitieshtmlru typingr r coreutilr r r Unionr r boolOptionalr3 r$ r= rO rX r r r r r r r r r r Tupler
r __annotations__r9 r r r r
r entitieshtml5itemsr r r common_html_entityr Enumr InfixNotationOperatorArgType ParseActionInfixNotationOperatorSpecListr> ra r c_style_comment html_commentleave_whitespace rest_of_linedbl_slash_commentcpp_style_commentjava_style_commentpython_style_commentvarsvaluesrd
delimitedList countedArraymatchPreviousLiteralmatchPreviousExproneOfdictOforiginalTextFor
nestedExpr makeHTMLTags makeXMLTags
anyOpenTag anyCloseTagcommonHTMLEntityreplaceHTMLEntityopAssoc
infixNotation
cStyleComment htmlComment
restOfLinedblSlashCommentcppStyleCommentjavaStyleCommentpythonStyleCommentrj r% r# r s&
> > > > > > > > > > (+ $ $ 64 "'64 64 64
]"
#64 m# $64 64
64
64 64 64 64 64 64v 049I /3 9I 9I 9I
9Iom,9I _]
+ 9I
9I 9I 9I 9Ix = B!m !
! ! ! !L | | | |
$c)
*|| | |
| | | | | |~%/ %/} %/ %/ %/ %/ %/R ,02EI2 2 2
2$(2>B22 2 2 2jA- AM A A A A m
H ),(+.2!. } !.
} } } #}$ %} #}$ %} _]
+} }
} } } } }@ (0x}}((3-- 7 7 7 7 t%
3
%
&%
=- '(% % % %6$
3
%
&$
=- '($ $ $ $ ,nDT!""++I66 m LKt}/B/H/H/J/JKKKU>CHH^,D,DDtKLLUU
( ( (
d
%3eM3$6 7}c?Q9R RSS " $ $ &
$
$ '/hsmm&.hsmm b b b
+
,b ]"
#b ]"
# b
b b b bJ ;?b L- L- L- L-` '%% 7884?@@II $u'((11.AA &uU||,,..77GG E.//88 FF 1G E
!""T),==
( P& $ uV}}--.DEE 0
' 'tvv}}' ' ']#
- ' #
&
K% '
##% ) r%