Hi.
With module parser it is possible to access Python parse trees.
But this only works for 'external' source.
I would like to known if, at least in theory, it can be possible to
access Python parse trees from 'inside' a script.
As a simple example:
def on_parsing(ast):
...
@parsing -> on_parsing
some statement
This will call on_parsing function with the AST object generated from
the next statement:
on_parsing(parser.suit(somestatement))
Thanks and regards Manlio Perillo 5 1321
No. I don't think it's possible to read the parse tree used by the
interpreter, especially as it is being created. Here are a couple of
kludgy ideas that might come close, though:
1. Use introspection to have your on_parsing function locate the and
parse the code being executed. I'm not sure if you'll be able to
figure out _exactly_ where on_parsing is being called from (e.g. you
can probably only narrow it down to the statement, not the expression),
but you should be able to come close enough to be useful. The inspect
module and sys._getframe will come in handy. Note that this won't work
if you can't retrieve the source (as is the case with exec/eval)
2. Or, using the code module, start up your own interpreter inside of
the interpreter. Intercept and parse lines of source as they are fed
to this interpreter.
On a side note, check out the compiler module. You might find it to be
friendlier and more useful than parser.
On 3 Mar 2005 11:15:28 -0800, "Lonnie Princehouse"
<fi**************@gmail.com> wrote: No. I don't think it's possible to read the parse tree used by the interpreter, especially as it is being created. Here are a couple of kludgy ideas that might come close, though:
Is this a 'limitation' of the current version or it is impossible for
the architecture of CPython?
What about pypy? On a side note, check out the compiler module. You might find it to be friendlier and more useful than parser.
Thanks for the hint. It is what I want.
Unfortunately is seem to be not well documented.
Anyway, here is an example of what I would like to do:
#begin
def foo(**kwargs): print kwargs
foo(a = 1, b = 2, c = 3)
#end
In the current implementation kwargs is a dict, but I need to have the
keyword argument sorted.
Unfortunately subclassing fron dict and installing the class in the
__builtin__ module (with the name 'dict') does not work, CPython uses
only builtin types.
With the compiler module I can obtain the keyword arguments in the
order the were specified.
The problem is how to do this for every call to foo!
Thanks and regards Manlio Perillo
Manlio Perillo wrote: Anyway, here is an example of what I would like to do:
#begin def foo(**kwargs): print kwargs
foo(a = 1, b = 2, c = 3) #end
In the current implementation kwargs is a dict, but I need to have the keyword argument sorted. Unfortunately subclassing fron dict and installing the class in the __builtin__ module (with the name 'dict') does not work, CPython uses only builtin types.
With the compiler module I can obtain the keyword arguments in the order the were specified. The problem is how to do this for every call to foo!
Why not just pass the kind of argument you want? What is it you really need to do?
def foo(kwds): print kwds
foo(MyDict(a = 1, b = 2, c = 3))
Kent
Manlio Perillo wrote: On 3 Mar 2005 11:15:28 -0800, "Lonnie Princehouse" <fi**************@gmail.com> wrote:
No. I don't think it's possible to read the parse tree used by the interpreter, especially as it is being created. Here are a couple of kludgy ideas that might come close, though:
Is this a 'limitation' of the current version or it is impossible for the architecture of CPython? What about pypy?
On a side note, check out the compiler module. You might find it to be friendlier and more useful than parser.
Thanks for the hint. It is what I want. Unfortunately is seem to be not well documented.
Anyway, here is an example of what I would like to do:
#begin def foo(**kwargs): print kwargs
foo(a = 1, b = 2, c = 3) #end
In the current implementation kwargs is a dict, but I need to have the keyword argument sorted. Unfortunately subclassing fron dict and installing the class in the __builtin__ module (with the name 'dict') does not work, CPython uses only builtin types.
With the compiler module I can obtain the keyword arguments in the order the were specified. The problem is how to do this for every call to foo!
The nature of the interpreter is that the C code implementing function
calls specifically uses a dict created in C rather than using the
mechanisms that would be used to create a dict from within a python
program, so you have no way to "hook" your own implementation in to the
interpreter without modifying the C code.
Introspection does have its limits, and unfortunately that's one of
them. Sine the code that interprets the byte codes is pretty much all
written in C, there's no way to affect something that does not already
have Python run-time hooks provided (such as the __add__ method that
allows you to implement a specific response to the binary "+" operator).
What you probably need is a specific magic hook for the "**" operator,
but I'm not sure that's going to happen any time soon ...
regards
Steve
--
Meet the Python developers and your c.l.py favorites March 23-25
Come to PyCon DC 2005 http://www.pycon.org/
Steve Holden http://www.holdenweb.com/
On Sat, 05 Mar 2005 08:52:38 -0500, Kent Johnson <ke****@tds.net>
wrote: Manlio Perillo wrote: Anyway, here is an example of what I would like to do:
#begin def foo(**kwargs): print kwargs
foo(a = 1, b = 2, c = 3) #end
In the current implementation kwargs is a dict, but I need to have the keyword argument sorted. Unfortunately subclassing fron dict and installing the class in the __builtin__ module (with the name 'dict') does not work, CPython uses only builtin types.
With the compiler module I can obtain the keyword arguments in the order the were specified. The problem is how to do this for every call to foo!
Why not just pass the kind of argument you want? What is it you really need to do?
def foo(kwds): print kwds
foo(MyDict(a = 1, b = 2, c = 3))
Kent
I don't understand your code.
Here an example using OrderedDict from twisted: import twisted.python.util as util
foo(util.OrderedDict(a = 1, b = 2, c = 3))
{'a': 1, 'c': 3, 'b': 2}
Simply I can't use a dict.
I have to do, as an example example:
foo('a', 1, 'b', 2, 'c', 3)
or
foo(['a', 'b', 'c'], [1, 2, 3])
Thanks and regards Manlio Perillo This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics
by: Don Bruder |
last post by:
A week or two ago, I asked here about porting Python to C. Got some good
answers (Note 1) but now I've got another question. Actually, more a
request for clarification of a topic that both the...
|
by: mike420 |
last post by:
I think everyone who used Python will agree that its syntax is
the best thing going for it. It is very readable and easy
for everyone to learn. But, Python does not a have very good
macro...
|
by: Kenneth McDonald |
last post by:
I can't see anything about this in the notes on the upcoming
2.4 on python.org, but for some reason I thought I remembered
seeing that a balanced tree sequence type would be included
in Python in...
|
by: Oleg Paraschenko |
last post by:
Hello,
maybe of some interest:
http://pysch.sourceforge.net/ast.html
--
Oleg
|
by: Davor |
last post by:
Is it possible to write purely procedural code in Python, or the OO
constructs in both language and supporting libraries have got so
embedded that it's impossible to avoid them? Also, is anyone...
|
by: gaudetteje |
last post by:
I've been searching high and low for a way to simply convert a small
XML configuration file to Python data structures. I came across gnosis
XML tools, but need a built-in option for doing...
|
by: M1st0 |
last post by:
where I can find the grammar of python bytecode ? ( better if is in BCF
).
|
by: 63q2o4i02 |
last post by:
Hi, I'm interested in using python to start writing a CAD program for
electrical design. I just got done reading Steven Rubin's book, I've
used "real" EDA tools, and I have an MSEE, so I know what...
|
by: Mark Tarver |
last post by:
How do you compare Python to Lisp? What specific advantages do you
think that one has over the other?
Note I'm not a Python person and I have no axes to grind here. This is
just a question for...
|
by: BarryA |
last post by:
What are the essential steps and strategies outlined in the Data Structures and Algorithms (DSA) roadmap for aspiring data scientists? How can individuals effectively utilize this roadmap to progress...
|
by: Hystou |
last post by:
There are some requirements for setting up RAID:
1. The motherboard and BIOS support RAID configuration.
2. The motherboard has 2 or more available SATA protocol SSD/HDD slots (including MSATA, M.2...
|
by: marktang |
last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However,...
|
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers,...
|
by: jinu1996 |
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven...
|
by: Hystou |
last post by:
Overview:
Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows...
|
by: tracyyun |
last post by:
Dear forum friends,
With the development of smart home technology, a variety of wireless communication protocols have appeared on the market, such as Zigbee, Z-Wave, Wi-Fi, Bluetooth, etc. Each...
|
by: agi2029 |
last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development project—planning, coding, testing,...
|
by: isladogs |
last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM).
In this session, we are pleased to welcome a new...
| |