abstract-syntax-tree

I like to take the v8 engine and to transform its code to other programming language based on this for example if i understand it right first step i need to get the parse tree my question is : can i get it already from v8 or do i need to generate it from the js code . what is the easer way ? It looks hard to get the AST (Annotated Syntax Tree, the Parse tree) from V8 itself but there are plenty of other parsers for JavaScript that will do what you're looking for. I'd recommend having a look at Esprima ( http://esprima.org/ ) which is a JavaScript parser written in JavaScript. This allows you

Is it possible to grab the AST of a block from Ruby itself? I've had a look at both ParseTree and ruby_parser, but they both seem to have sketchy support (from what I've read) for Ruby 1.9.2. I need something that works well with 1.9.2. Ripper is included in MRI 1.9 out of the box. ruby-1.9.2-p180 :004 > require 'ripper' => true ruby-1.9.2-p180 :005 > Ripper.sexp("def a; end") => [:program, [[:def, [:@ident, "a", [1, 4]], [:params, nil, nil, nil, nil, nil], [:bodystmt, [[:void_stmt]], nil, nil, nil]]]] In 1.8, Ruby executes the code by traversing the AST, so it is possible to get the AST for a

Abstract problem description: The way I see it, unparsing means to create a token stream from an AST, which when parsed again produces an equal AST. So parse(unparse(AST)) = AST holds. This is the equal to finding a valid parse tree which would produce the same AST. The language is described by a context free S-attributed grammar using a eBNF variant. So the unparser has to find a valid 'path' through the traversed nodes in which all grammar constraints hold. This bascially means to find a valid allocation of AST nodes to grammar production rules. This is a constraint satisfaction problem (CSP

I would like to create an automatic Flowchart-like visualization to simple Java Logic, for this I need to parse Java Source code, I have 2 candidates, ANTLR and javax.lang.model of Java 6. Neither are easy. I have yet to find a single working example that will be even remotely close to what I want to achieve. I want to find simple variable declarations, assignments, and flows (if, for, switch, boolean conditions etc) Is there a simple example or tutorial for either of these? I found very few ANTLR examples (non of them are working out of the box without significant "homework") and absolutely

As it is known that Typescript is completely opensource now. which is available at Tyescript . I am building an application that will get Typescript code as input and give output the AST of the given code. Provide me a proper way to extract this AST(Abstract Syntax Tree) of input Typescript code rather than comppliling it and converting it into Javascript. Basic code: const fileNames = ["C:\\MyFile.ts"]; const compilerOptions: ts.CompilerOptions = { // compiler options go here if any... // look at ts.CompilerOptions to see what's available }; const program = ts.createProgram(fileNames,

Is there a open source java api that allows to compare two Abstract Syntax Trees of java source code? I would like to see the differences between the two syntax trees, similar to how it is done in diff tools. Most diff tools compare lines, not syntax trees (see Wikipedia article for discussion ). There are some techical papers that talk about how to do syntax tree compares, e.g., Diff/TS: A Tool for Fine-Grained Structural Change Analysis There are no APIs for computing tree differences available anywhere as far as I know. The problem is more complex than it first sounds, if you want to get a