xz-ASTCodeGenerator.__init__.. s< F F F x !x00 F F F N) cfg_filename
parse_cfgfilenode_cfg)selfr s r __init__zASTCodeGenerator.__init__ sC )F F$($6$6|$D$DF F F
r Nc t t | j }|t z
}| j D ] }|| dz z
} | | dS )z< Generates the code into file, an open file buffer.
)r z
N)r _PROLOGUE_COMMENT
substituter _PROLOGUE_CODEr generate_sourcewrite)r filesrcr s r generatezASTCodeGenerator.generate sz ())44 * 5 , , ~
7 7H 8++--6 6CC
3r c # K t |d 5 }|D ]}| }|r| d r.| d }| d }| d }|dk s ||k s||k rt d|d|d |d
| }||dz | }|r d | d D ng } || fV d
d
d
d
S # 1 swxY w Y d
S )
ze Parse the configuration file and yield pairs of
(name, contents) for each node.
r#:[] zInvalid line in z:
Nc 6 g | ]}| S r )strip)r vs r r z2ASTCodeGenerator.parse_cfgfile..6 s ===17799===r ,)openr(
startswithfind RuntimeErrorsplit)
r filenameflinecolon_i
lbracket_i
rbracket_ir valvallists
r r z ASTCodeGenerator.parse_cfgfile% s} (C
$A
$
$zz|| ts 3 3 ))C.. !YYs^^
!YYs^^
Q;;*"7"7:;S;S&,hhhPTPTPT'UVVVHWH~:>*45ADL==ciinn===="Gm####
$ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $s CC::C>C>)r )N)__name__
__module__ __qualname__r r r r r r r r sO F F F F
$ $ $ $ $r r c 6 e Zd ZdZd Zd Zd Zd Zd Zd Z dS ) r
z Node configuration.
name: node name
contents: a list of contents - attributes and child nodes
See comment at the top of the configuration file for details.
c || _ g | _ g | _ g | _ g | _ |D ]}| d }| j | | d r| j | a| d r| j | | j | d S )N*z**)r all_entriesattrchild seq_childrstripappendendswith)r r r
entry clean_entrys r r zNodeCfg.__init__B s
( (E ,,s++K # #K 0 0 0~~d##
(%%k2222 $$
(
!!+.... '''' ( (r c | }|d| z z
}|d| z z
}|d| z z
}|S )Nr& ) _gen_init
_gen_children _gen_iter_gen_attr_namesr r s r r zNodeCfg.generate_sourceT se nn td((**** tdnn&&&& td**,,,,
r c d| j z }| j rId | j }d d | j D }|dz
}d|z }nd}d}|d|z z
}|d |z z
}| j d
gz D ]}|d |d |d
z
}|S )Nzclass %s(Node):
z, c 3 @ K | ]}d | V dS )z'{0}'N)format)r es r z$NodeCfg._gen_init..` s. J JAgnnQ / / J J J J J Jr z, 'coord', '__weakref__'z(self, %s, coord=None)z'coord', '__weakref__'z(self, coord=None)z __slots__ = (%s)
z def __init__%s:
coordz
self.z = r& )r r> join)r r argsslotsarglistr s r rH zNodeCfg._gen_init[ s !DI- +99T -..DII J J9I J J JJJE / /E.5GG,E*G '%// &00$y0 ; ;D CtttTTT: :CC
r c d}| j rK|dz
}| j D ]}|dt | z z
}| j D ]}|dt | z z
}|dz
}n|dz
}|S )Nz def children(self):
z nodelist = []
zV if self.%(child)s is not None: nodelist.append(("%(child)s", self.%(child)s))
r@ zu for i, child in enumerate(self.%(child)s or []):
nodelist.append(("%(child)s[%%d]" %% i, child))
z return tuple(nodelist)
z return ()
r> r@ dictrA r r r@ rA s r rI zNodeCfg._gen_childreno s ) ) , ,C
+
+H 5)))+ +
"^
/
/ T 9---/ /
5 5CC ( (C
r c d}| j rT| j D ]}|dt | z z
}| j D ]}|dt | z z
}| j s | j s|dz
}n|dz
}|S )Nz def __iter__(self):
zH if self.%(child)s is not None:
yield self.%(child)s
rX zE for child in (self.%(child)s or []):
yield child
z return
yield
rY r[ s r rJ zNodeCfg._gen_iter s ) #
P
P9=A=N=N=NP P "^
K
K 048y4I4I4IK K J
'$.
'&'
"
#C
r c Z dd d | j D z dz }|S )Nz attr_names = ( c 3 K | ] }d |z V
dS )z%r, Nr )r nms r rQ z*NodeCfg._gen_attr_names.. s& ,M,MRVb[,M,M,M,M,M,Mr ))rS r? rL s r rK zNodeCfg._gen_attr_names s4 "RWW,M,M49,M,M,M%M%MMPSS
r N)
r8 r9 r: __doc__r r rH rI rJ rK r r r r
r
: sx ( ( ($ ( 0 6 r r
a #-----------------------------------------------------------------
# ** ATTENTION **
# This code was automatically generated from the file:
# $cfg_filename
#
# Do not modify it directly. Modify the configuration file and
# run the generator again.
# ** ** *** ** **
#
# pycparser: c_ast.py
#
# AST Node classes.
#
# Eli Bendersky [https://eli.thegreenplace.net/]
# License: BSD
#-----------------------------------------------------------------
a3
import sys
def _repr(obj):
"""
Get the representation of an object, with dedicated pprint-like format for lists.
"""
if isinstance(obj, list):
return '[' + (',\n '.join((_repr(e).replace('\n', '\n ') for e in obj))) + '\n]'
else:
return repr(obj)
class Node(object):
__slots__ = ()
""" Abstract base class for AST nodes.
"""
def __repr__(self):
""" Generates a python representation of the current node
"""
result = self.__class__.__name__ + '('
indent = ''
separator = ''
for name in self.__slots__[:-2]:
result += separator
result += indent
result += name + '=' + (_repr(getattr(self, name)).replace('\n', '\n ' + (' ' * (len(name) + len(self.__class__.__name__)))))
separator = ','
indent = '\n ' + (' ' * len(self.__class__.__name__))
result += indent + ')'
return result
def children(self):
""" A sequence of all children that are Nodes
"""
pass
def show(self, buf=sys.stdout, offset=0, attrnames=False, nodenames=False, showcoord=False, _my_node_name=None):
""" Pretty print the Node and all its attributes and
children (recursively) to a buffer.
buf:
Open IO buffer into which the Node is printed.
offset:
Initial offset (amount of leading spaces)
attrnames:
True if you want to see the attribute names in
name=value pairs. False to only see the values.
nodenames:
True if you want to see the actual node names
within their parents.
showcoord:
Do you want the coordinates of each Node to be
displayed.
"""
lead = ' ' * offset
if nodenames and _my_node_name is not None:
buf.write(lead + self.__class__.__name__+ ' <' + _my_node_name + '>: ')
else:
buf.write(lead + self.__class__.__name__+ ': ')
if self.attr_names:
if attrnames:
nvlist = [(n, getattr(self,n)) for n in self.attr_names]
attrstr = ', '.join('%s=%s' % nv for nv in nvlist)
else:
vlist = [getattr(self, n) for n in self.attr_names]
attrstr = ', '.join('%s' % v for v in vlist)
buf.write(attrstr)
if showcoord:
buf.write(' (at %s)' % self.coord)
buf.write('\n')
for (child_name, child) in self.children():
child.show(
buf,
offset=offset + 2,
attrnames=attrnames,
nodenames=nodenames,
showcoord=showcoord,
_my_node_name=child_name)
class NodeVisitor(object):
""" A base NodeVisitor class for visiting c_ast nodes.
Subclass it and define your own visit_XXX methods, where
XXX is the class name you want to visit with these
methods.
For example:
class ConstantVisitor(NodeVisitor):
def __init__(self):
self.values = []
def visit_Constant(self, node):
self.values.append(node.value)
Creates a list of values of all the constant nodes
encountered below the given node. To use it:
cv = ConstantVisitor()
cv.visit(node)
Notes:
* generic_visit() will be called for AST nodes for which
no visit_XXX method was defined.
* The children of nodes for which a visit_XXX was
defined will not be visited - if you need this, call
generic_visit() on the node.
You can use:
NodeVisitor.generic_visit(self, node)
* Modeled after Python's own AST visiting facilities
(the ast module of Python 3.0)
"""
_method_cache = None
def visit(self, node):
""" Visit a node.
"""
if self._method_cache is None:
self._method_cache = {}
visitor = self._method_cache.get(node.__class__.__name__, None)
if visitor is None:
method = 'visit_' + node.__class__.__name__
visitor = getattr(self, method, self.generic_visit)
self._method_cache[node.__class__.__name__] = visitor
return visitor(node)
def generic_visit(self, node):
""" Called if no explicit visitor function exists for a
node. Implements preorder visiting of the node.
"""
for c in node:
self.visit(c)
N)stringr objectr r
r r r r r re s '$ '$ '$ '$ '$v '$ '$ '$Tj j j j jf j j j\ (Ur