To help you get started, we've collected the most common ways that astor is being used within popular public projects.

pannous / angle / tests / ast_eval_inline.py View on Github

print("\n--------MEDIUM-------- (ok)\n")
	x = ast.dump(my_ast, annotate_fields=True, include_attributes=False)
	print(x)
	print("\n--------SHORT-------- (view-only)\n")
	x = ast.dump(my_ast, annotate_fields=False, include_attributes=False)
	print(x)
	print("")
	if do_exec: exec(expr)
	exit(0)

try:
	inline_ast = "set in execfile:"
	if sys.version < '3':execfile(ast_file)
	else: exec(open(ast_file).read())
	try:
		source = codegen.to_source(inline_ast)
		print(source)  # => CODE
	except Exception as ex:
		print(ex)
	my_ast = ast.fix_missing_locations(inline_ast)
	code = compile(inline_ast, "out/inline", 'exec')
	# if do_exec:
	exec(code)
except Exception as e:
	raise

View more ways to use astor

astor -- AST observe/rewrite

PyPI

Documentation

Source

License
3-clause BSD

Build status

astor is designed to allow easy manipulation of Python source via the AST.

There are some other similar libraries, but astor focuses on the following areas:

• Round-trip an AST back to Python[1]:
  • Modified AST doesn't need linenumbers, ctx, etc. or otherwise be directly compileable for the round-trip to work.
  • Easy to read generated code as, well, code
  • Can round-trip two different source trees to compare for functional differences, using the astor.rtrip tool (for example, after PEP8 edits).
• Dump pretty-printing of AST
  • Harder to read than round-tripped code, but more accurate to figure out what is going on.
  • Easier to read than dump from built-in AST module
• Non-recursive treewalk
  • Sometimes you want a recursive treewalk (and astor supports that, starting at any node on the tree), but sometimes you don't need to do that. astor doesn't require you to explicitly visit sub-nodes unless you want to:
  • You can add code that executes before a node's children are visited, and/or
  • You can add code that executes after a node's children are visited, and/or
  • You can add code that executes and keeps the node's children from being visited (and optionally visit them yourself via a recursive call)
  • Write functions to access the tree based on object names and/or attribute names
  • Enjoy easy access to parent node(s) for tree rewriting

[1] The decompilation back to Python is based on code originally written by Armin Ronacher. Armin's code was well-structured, but failed on some obscure corner cases of the Python language (and even more corner cases when the AST changed on different versions of Python), and its output arguably had cosmetic issues -- for example, it produced parentheses even in some cases where they were not needed, to avoid having to reason about precedence.

Other derivatives of Armin's code are floating around, and typically have fixes for a few corner cases that happened to be noticed by the maintainers, but most of them have not been tested as thoroughly as astor. One exception may be the version of codegen maintained at github by CensoredUsername. This has been tested to work properly on Python 2.7 using astor's test suite, and, as it is a single source file, it may be easier to drop into some applications that do not require astor's other features or Python 3.x compatibility.