Databases
StackOverflow2013
Postsdbo
POTranslating Python for a Virtual Machine
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POTranslating Python for a Virtual Machine
    primarykey
    data
    text
    <p>I am currently working on a project involving a new faster execution environment/VM for Python on Linux. The python source is parsed into an intermediate AST, analyzed and the code for the target VM is generated JIT and cached. Due to the JIT nature of the proposed machine, speed is essential and I am writing it as native as possible. Currently its completely implemented in C apart a single python interface to the compiler module. Currently I am able to build the AST using the Python compiler module and have it in memory.</p> <p>For example the code:</p> <pre><code>class Test: def testFunc(arg1): print 'Arg is ' + arg1 </code></pre> <p>generates the AST</p> <pre><code>Module(None, Stmt([Class('Test', [], None, Stmt([Function(None, 'testFunc', ['arg1'], [], 0, None, Stmt([Printnl([Add((Const('Arg is '), Name('arg1')))], None)]))]), None)])) </code></pre> <p>What I want to know is a efficient method to parse this AST into a manipulable data structure like a tree, which can be traversed and the target code emitted. I am confused as to whether to go for a parser generator like Bison or Lemon or manually tokenize and parse it. Since the AST is obtained after extensive error checks, so no point of further error checks, hence I believe a parser generator is overkill. Python itself provides AST walkers but it slows it down. But then I am really not too sure how to go about manually deciphering it. I would really appreciate any algorithm or suggestion or if possible a native language implementation.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USSeki
    1. USRahul De
    plurals
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. COYou might want to move this question to http://cs.stackexchange.com/
      singulars
      1. POTranslating Python for a Virtual Machine
      1. USthefourtheye
    2. COthe `T` in `ast` stands for `tree`. It already a tree that you can traverse e.g., [Simple example of how to use `ast.NodeVisitor`?](http://stackoverflow.com/q/1515357/4279) or another simple example: [Extracting “extra” docstrings from Python code?](http://stackoverflow.com/q/9782793/4279)
      singulars
      1. POTranslating Python for a Virtual Machine
      1. USjfs
    3. COI mean I obtained this as a text string from the Python compiler module and want to parse this into a tree in memory preferably in a native language. I tried the python AST walker but its somewhat slow for really huge codes. What I need is a simple system which parses this and gives me the node name and values.
      singulars
      1. POTranslating Python for a Virtual Machine
      1. USRahul De
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload