h`i S SK Jr S SKrS SKrS SKrS SKrS SKrS SKJrJrJ r J
r
S SK J r S SK
Jr S SKrS SKrSr\ " \5 r0 r\R( " SS9rS S jrS!S
jr\R0 " S S 5 5 r\" S
5 r " S S\R6 5 r " S S\R6 5 r " S S\\ 5 r S"S#S jjr S$S jr S% S&S jjr! S'S jr"\R0 " S S5 5 r# " S S5 r$S(S jr%S r&S)S jr'\& S* S+S jj5 r(g), ) annotationsN)GenericTypeVarCallableIterable)Template)StringIOa {% if not embed %}
{% endif %}
{% if not head %}
{% else %}
{{ head | safe }}
{% endif %}
{% if not embed %}
{% endif %}
{{ body | safe }}
{% for diagram in diagrams %}
{{ diagram.title }}
{{ diagram.text }}
{{ diagram.svg }}
{% endfor %}
{% if not embed %}
{% endif %}
)startc U [ ; a [ U $ [ R " SSU 5 nUSS R 5 ( d SU 3nUR 5 R S5 nU S[
[ 5 S 3=[ U ' nU$ )zC
Converts a string into a valid HTML bookmark (ID or anchor name).
z[^a-zA-Z0-9-]+-Nr
z04d)_bookmark_lookupresubisalphalowerstripnext
_bookmark_ids)sbookmarks L/var/www/html/env/lib/python3.13/site-packages/pyparsing/diagram/__init__.py_make_bookmarkr ? s "" vv'a0H BQ< ! !xj> ~~ %%c*H(0z4
3Fs2K%LLQ( O c SU ; a U $ [ R " S5 R 5 R U 5 n[ R
" SSU5 nU$ )N
z#.*$z\s*\n\s* ) pyparsingRegexsuppresstransform_stringr r ) regex_str collapseds r _collapse_verbose_regexr& U sJ 9 (113DDYOI{B 2I r c L \ rS rSr% SrS\S' S\S' SrS\S ' \S
5 rS r g) NamedDiagram] zC
A simple structure for associating a name with a railroad diagram
strnameintindexNzrailroad.DiagramItemdiagramc 0 [ U R 5 nU$ N)r r+ )selfr s r r NamedDiagram.bookmarkg s !$)),r )
__name__
__module__ __qualname____firstlineno____doc____annotations__r. propertyr __static_attributes__r3 r r r( r( ] s0 I J$(G
!(
r r( Tc 4 ^ \ rS rSrSrSrSU 4S jjrSrU =r$ )EachItemp z
Custom railroad item to compose a:
- Group containing a
- OneOrMore containing a
- Choice of the elements in the Each
with the group label indicating that all must be matched
z[ALL]c > [ R " [ U5 S-
/UQ76 n[ R " US9n[ TU ] X0R S9 g )Nr
item)label)railroadChoicelen OneOrMoresuper__init__ all_label)r1 items choice_itemone_or_more_item __class__s r rI EachItem.__init__{ sD ooc%j1n=u= #--;?
) @r r3 )returnNone) r4 r5 r6 r7 r8 rJ rI r;
__classcell__rN s @r r> r> p s IA Ar r> c 0 ^ \ rS rSrSrSU 4S jjrSrU =r$ )
AnnotatedItem z;
Simple subclass of Group that creates an annotation label
c : > [ TU ] X!( a SU S3OSS9 g )N[]r rB rC )rH rI )r1 rC rB rN s r rI AnnotatedItem.__init__ s!
d%AeWA,RHr r3 )rC r* rP rQ )r4 r5 r6 r7 r8 rI r; rR rS s @r rU rU s I Ir rU c P \ rS rSrSrS S jr\S
S j5 r\S 5 r S S jr
Sr g) EditablePartial zz
Acts like a functools.partial, but can be edited. In other words, it represents a type that hasn't yet been
constructed.
c ( Xl X l X0l g r0 funcargskwargs)r1 ra rb rc s r rI EditablePartial.__init__ s r c * [ U[ U5 US9$ )z
If you call this function in the same way that you would call the constructor, it will store the arguments
as you expect. For example EditablePartial.from_call(Fraction, 1, 3)() == Fraction(1, 3)
r` )r] list)clsra rb rc s r from_callEditablePartial.from_call s DtDz&IIr c U R S $ )Nr+ )rc r1 s r r+ EditablePartial.name s {{6""r c < U R R 5 nU R R 5 n[ R " U R
5 nUR U R ; a XR UR 5 -
nU R
" U0 UD6$ )z,
Evaluate the partial and return the result
)rb copyrc inspectgetfullargspecra varargspop)r1 rb rc arg_specs r __call__EditablePartial.__call__ sy yy~~ !!# ))$))4 t{{ * JJx / /0 0Dyy$)&))r )rb ra rc N)ra Callable[..., T]rb rf rc dictrP rQ )ra rv rP EditablePartial[T])rP r< ) r4 r5 r6 r7 r8 rI classmethodrh r: r+ rt r; r3 r r r] r] s;
J J # #
*r r] c / nU H nUR c M [ 5 n UR S5 nUR R UR US9 UR nUR S:X a US-
nUR USUR 5 UR S.5 M [ R " SX1S.UD6$ ! [
a( UR R
UR 5 Nf = f) z
Given a list of NamedDiagram, produce a single HTML string that visualises those diagrams
:params kwargs: kwargs to be passed in to the template
css)r{ r z (root)r )titletextsvgr )diagramsembedr3 )r. r getwriteStandalonewriteAttributeErrorwriteSvgr+ r- appendgetvaluer templaterender)r r rc datar. ior{ r| s r railroad_to_htmlr s
D ?? "
Z /**U#C OO + +BHH# + > ==A Y E 2;;=gN^N^
$ ?? @D @ @@ / OO $ $RXX . /s 5C/C43C4c [ U [ 5 ( a; [ U R 5 U l [ U R 5 U l U " 5 $ [ U [
5 ( a U Vs/ s H n[ U5 PM sn$ [ U [ 5 ( a/ U R 5 VVs0 s H u p!U[ U5 _M snn$ U $ s snf s snnf )zK
Recursively resolves a collection of Partials into whatever type they are
)
isinstancer] resolve_partialrb rc rf rw rK )partialxkeys r r r s '?++&w||4 ( 8y GT " ",34Gq"G44 GT " "6=mmoFoFC_Q''oFF 5Fs *C*C
c
[ U=( d 0 S9n[ U USUUUUS9 [ U 5 nXv; a, U R ( d SXg l Xg R XvSS9 [
UR R 5 5 n[ U5 S: a [ 5 n / n
U Hb n U R S:X a M U R c M$ U R U ; d M6 U R U R 5 U
R U 5 Md U
V s/ s H n [ U 5 PM n
n OU V s/ s H n [ U 5 PM n
n [ U
S S
9$ s sn f s sn f ) a
Convert a pyparsing element tree into a list of diagrams. This is the recommended entrypoint to diagram
creation if you want to access the Railroad tree before it is converted to HTML
:param element: base element of the parser being diagrammed
:param diagram_kwargs: kwargs to pass to the Diagram() constructor
:param vertical: (optional) - int - limit at which number of alternatives should be
shown vertically instead of horizontally
:param show_results_names - bool to indicate whether results name annotations should be
included in the diagram
:param show_groups - bool to indicate whether groups should be highlighted with an unlabeled
surrounding box
:param show_hidden - bool to indicate whether internal elements that are typically hidden
should be shown
)diagram_kwargsN)lookupparentverticalshow_results_names show_groups show_hiddenr T)forcer
z...c U R $ r0 r- )diags r to_railroad.. s TZZr )r )ConverterState_to_diagram_elementid
customNamer+ mark_for_extractionrf r valuesrF setaddr r sorted)elementr r r r r r root_iddiagsseen
deduped_diagsdr resolveds r to_railroadr s8 . >+?R
@F- kG!!#%FO ++G4+H
'') *E
5zA~u
Avvvv!affD&8 $$Q'
=JJMOG,MJ =BBEOG,EB ( 7 88 K Cs E$E c 8 U c g[ [ U5 5 U : $ )z>
Returns true if we should return a vertical list of elements
F)rF _visible_exprs)
specificationexprss r _should_verticalr s" >%()]::r c \ rS rSr% SrS\S' S\S' S\S' S\S ' S
rS \S ' S
rS
\S' SrS\S' Sr S\S' S SS jjr
Sr g
) ElementStatei) z4
State recorded for an individual pyparsing Element
pyparsing.ParserElementr r] convertedr r, numberNr* r+ ztyping.Optional[int] parent_indexFboolextractcompletec V SU l U R ( dL U( a X0l O>U R R ( a U R R U l OSU l U( d+ U R ( a- [ U R 5 ( a UR
U5 ggg)a~
Called when this instance has been seen twice, and thus should eventually be extracted into a sub-diagram
:param el_id: id of the element
:param state: element/diagram state tracker
:param name: name to use for this element's text
:param force: If true, force extraction now, regardless of the state of this. Only useful for extracting the
root element when we know we're finished
Tr N)r r+ r r r _worth_extractingextract_into_diagram)r1 el_idstater+ r s r r ElementState.mark_for_extraction@ sq yy (( LL 3 3
T]]'8 'F'F & &u - (G]r )r r+ )NF)r r, r r r+ r* r r ) r4 r5 r6 r7 r8 r9 r+ r r r r r; r3 r r r r ) sz
%$ KD#)-L&-GTHd RW..!/.7:.JN. .r r c v \ rS rSrSrSSS jjrSS jrSS jrSS jrSS jr SS jr
SS
jr SS jr SS jr
S
rg)r i^ zJ
Stores some state that persists between recursions into the element tree
Nc z 0 U l 0 U l SU l SU l U=( d 0 U l [ 5 U l g )Nr
r )_element_diagram_statesr
unnamed_indexr- r r extracted_diagram_names)r1 r s r rI ConverterState.__init__c s7 @B$BD
"#
$2$8b14$r c X R U' g r0 r )r1 r values r __setitem__ConverterState.__setitem__p s ,1$$S)r c U R U $ r0 r r1 r s r __getitem__ConverterState.__getitem__s s ++C00r c U R U g r0 r r s r __delitem__ConverterState.__delitem__v s ( ( -r c XR ; $ r0 r r s r __contains__ConverterState.__contains__y s 2222r c 0 X $ ! [ a Us $ f = fr0 )KeyError)r1 r defaults r r ConverterState.get| s# 9 N s c D U =R S-
sl U R $ )zD
Generate a number used in the name of an otherwise unnamed diagram
r
)r rk s r generate_unnamed ConverterState.generate_unnamed s!
a !!!r c D U =R S-
sl U R $ )z+
Generate a number used to index a diagram
r
r rk s r generate_index ConverterState.generate_index s
a
zzr c X nUR ( a S[ UR 5 3n[ R [
R UR US9nSUR R ; a XBR R S' O?SUR R ; a% XBR R S UR ' UR R [
R :X a UR R S nO UR n[ R [ UR [ R " [
R U40 U R D6UR S9U R U' X g)z
Used when we encounter the same token twice in the same tree. When this
happens, we replace all instances of that token with a terminal, and
create a new subdiagram for the token
#r} hrefrB rK )r+ r. r- N)r r r+ r] rh rD NonTerminalrc r r ra Groupr( Diagramr r r )r1 r positionr retcontents r r #ConverterState.extract_into_diagram s9 ; ??~hmm456D!++H,@,@x}}[_+`C ///14&&v.HOO 2 22IL&&w/0E0EF " "hnn 4 ((//7G ((G . 8 8 #-- '-1-@-@ //
9
e
Kr )r r r r r- r r0 )r typing.Optional[dict]rP rQ )r r, r r )r r, rP r )r r, )rP r, )r r, )r4 r5 r6 r7 r8 rI r r r r r r r r r; r3 r r r r ^ s4 721.3 " r r c F U R 5 n[ S U 5 5 $ )z
Returns true if this element is worth having its own sub-diagram. Simply, if any of its children
themselves have children, then its complex enough to extract
c 3 @ # U H oR 5 v M g 7fr0 )recurse).0childs r $_worth_extracting.. s 5H5}}Hs )r any)r childrens r r r s!
H 5H5 55r c P ^ S SU 4S jjjnU$ )z
decorator to ensure enhancements to a diagram item (such as results name annotations)
get applied on return from _to_diagram_element (we do this since there are several
returns in _to_diagram_element)
c > T " U UUUUUUUU5 n U( a[ U bX U R n
U
( aE U R ( a SOSn [ R [ R
U [
U
5 U 3S9n U $ )Nr *rZ ) resultsName modalResultsr] rh rD r repr)
r r r r r- name_hintr r r r element_results_name modal_tagfns
r _inner0_apply_diagram_item_enhancements.._inner s
#/#*#6#6 #")"6"6BC %// NN !"6 7 8 D 0
r NNr NFFFr r r typing.Optional[EditablePartial]r r r r, r- r, r r* r r r r r r rP r r3 )r r s ` r _apply_diagram_item_enhancementsr s "& #( ! !#(#0# # #
#
# !# # #
*# #J Mr c [ R [ R [ R R 4nU Vs/ s H n[ X!5 ( a M UPM sn$ s snf r0 )r ParseElementEnhance
PositionTokenAnd
_ErrorStopr )r non_diagramming_exprses r r r sX %%
A!3
s A A c r U R 5 n U=( d( U R =( d [ U 5 R n
[ U 5 n U R
n U R ( dj [
U [ R [ R 45 ( a; U ( a4 U S R ( d U
n
OSn
[ U R UUUUU
UUUS9 $ [ U 5 ( a UR U 5 nU( ad UR bW UR XUS9 S[! UR 5 3n[" R% [& R( UR US9nU$ XR* ; aM UR* U R, S n[" R% [& R( US[! U5 3S9nU$ U R. ( d U( d g[
U [ R0 5 ( a U ( d g[3 [5 S U 5 5 5 S :X aF [3 U 5 S
: a7 [" R% [& R6 S [9 [3 U 5 5 S 9nGO[; X95 ( a$ [" R% [& R< / S
9nGO[" R% [& R> / S
9nGOb[
U [ R@ [ RB 45 ( aa U ( d g[; X95 ( a% [" R% [& RD S/ S
9nGO[" R% [& RF / S
9nGO[
U [ RH 5 ( a" U ( d g[" R% [J / S
9nGO[
U [ RL 5 ( a [" R% [N SS S9nGOW[
U [ RP 5 ( a [" R% [N SS S9nGO [
U [ RR 5 ( a [" R% [N SS S9nGO[
U [ RT 5 ( aG U( a [" R% [N S S S9nGO[" R% [& RT SU S9nGO}[
U [ RV 5 ( ah [ U 5 R RY 5 nUS:X a$ [" R% [& R> / S
9nGO[" R% [N US S9nGO[
U [ RZ 5 ( a$ [" R% [& R\ S S9nGO[
U [ R6 5 ( a U R^ bT UUUUUUUU/n[ U R^ R ) U R - S Ra U R 5 /UQ76 $ [" R% [& R6 SS9nGO[
U [ Rb 5 ( a U R^ bT UUUUUUUU/n[ U R^ R ) U R - S Ra U R 5 /UQ76 $ [" R% [& Rb S S9nGOk[
U [ Rd 5 ( a U R ( d SnGO7[
U [ Rf 5 ( a# [" R% [& R> / S
9nO[3 U 5 S: a+ U ( d$ [" R% [& RT S U
S9nO[
U [ Rh 5 ( a: [k U Rl 5 n[" R% [& Rn U5 nOb[3 U 5 S: a# [" R% [& R> / S
9nO0[" R% [& Rn U Rp 5 nUnUc g[s U UUUURu 5 S9X+' U R ( a X+ R XU R 5 SnU H nSUR, ; a UR, S Rw US5 [ UUUUUUUUS9nUbL SUR, ; a UUR, S' Mf SUR, ; a UUR, S U' US -
nM M SUR, ; d M UR, S U M U( ap SUR, ; a [3 UR, S 5 S:X d SUR, ; a4 UR, S c$ [" R% [& Rn U
5 nX; a SX+ l< X; a X+ Rz ( at X+ Rx ( aa UR} U 5 UbM UR* U R, S nS[! U5 3n[" R% [& R( UUS9nU$ ) a
Recursively converts a PyParsing Element to a railroad Element
:param lookup: The shared converter state that keeps track of useful things
:param index: The index of this element within the parent
:param parent: The parent of this element in the output tree
:param vertical: Controls at what point we make a list of elements vertical. If this is an integer (the default),
it sets the threshold of the number of items before we go vertical. If True, always go vertical, if False, never
do so
:param name_hint: If provided, this will override the generated name
:param show_results_names: bool flag indicating whether to add annotations for results names
:param show_groups: bool flag indicating whether to show groups using bounding box
:param show_hidden: bool flag indicating whether to show elements that are typically hidden
:returns: The converted version of the input element, but as a Partial that hasn't yet been constructed
r N)r r r r- r r r r )r+ r r r+ c 3 P # U H oR UR 4v M g 7fr0 )r+ r )r r s r r &_to_diagram_element..Y s :EqFFAMM*Es $&r
r )rB repeat)rK NOT)rC rB LOOKAHEAD
LOOKBEHINDrZ tokenconverterrA )r
..)r r r r r rK )r r r r- r r r rB T)?r r typer4 r r r r ForwardLocatedr exprr r r+ r r r] rh rD r r rc show_in_diagramr
rF r rG r* r StackSequenceOr
MatchFirstrE HorizontalChoiceEachr> NotAnyrU
FollowedBy
PrecededByr TokenConverterr OptOptional not_enderset_name
ZeroOrMoreEmptyr r! r& patternTerminal defaultNamer r insertr r r )r r r r r- r r r r r r+ r r propagated_name looked_upr r r} rC rb collapsed_pattterminalir rB s r r r sp 4
OO E D** Dd7m.D.DD
wKE".. !!!!
Qx**&*O&*O*LL!! % -'9 + +
!!JJu% 3
) )%i ) H~inn567D!++H,@,@y~~\`+aCJ
oo
% ??5)008D!++$$4.:N9O6P , C J " ";'9==)) s:E:: ;q @SZRS^!++""CE
O , C h
.
.!++HNN"+EC!++H,=,=R+HC GillI,@,@ A B B H , ,!++HOOQb+IC!++H,E,ER+PC GY^^ , , '''; GY - - . . ''
U'L GY 1 1 2 2 ''
[r'R GY 1 1 2 2 ''
\PR'S GY__ - - !++M"+MC!++T1E , C
GY 5 5 6 6W
&&,,. $ $!++H,=,=R+HC!++MR+PC GY]] + + ''(9(9'C GY 0 0 1 1 (" D '##(((7<<7@II',,W
''(:(:'F GY 1 1 2 2 (" D '##(((7<<7=FFw||T
''(;(;"'E GY__ - -g6H6H GY : : ; ; ''(9(9'D Ua 4 ''Rt'L GY__ - -0 A ''(9(9>J Ua ''(9(9'D",,X->->@S@ST
{ !$$& FM
))%9K9KL A cjj JJw & &q$ /" 1##
#%)
6"CJJ&)-
7#A&Q '
"
7#A&5 : CJJ 3szz'':#;q#@ cjj SZZ%7%? ''(9(94@
!%
6=00V]5K5K##E* ???5)008D~d+,-D!++$$4d , C Jr )r r* rP r* )r$ r* rP r* )F)r list[NamedDiagram]rP r* )r rx rP r< )N FFF)r r r r r r, r r r r r r rP r8 )r r, r !Iterable[pyparsing.ParserElement]rP r )r r rP r )r r: r r ))
__future__r itertoolsrD r dataclassestypingr r r r jinja2r r r ro r jinja2_template_sourcer r countr r r& dataclassr( r< r r> rU r] r r r r r r r r r r r3 r r rC s "
" H * + a(
,
CLAx~~ A"IHNN I'*gaj '*TA6
$ -1 $
;9
$;9);9 ;9 ;9
;9
;9 ;9| ; ; @ ; ;
1. 1. 1.hR Rj6,^
" " $ y
$y ,y
y y
y
y y y y &y "yr