a) how dehydra works internally on the AST.
b) can i access the whole tree in details using dehydra .
c) Is separate AST is created for each function in the code or whole code is built on one AST. if possible please provide me any sample of the AST for a particular code.
c) how loops are represented in AST??
d)can i get some examples of the running javascripts that i can run using dehydra over my c++ code or give me any link regarding javascripts samples( of dehydra) for testing purpose of AST of my c++ codes.

please reply soon.
ANKUR

Pork is nothing but a collection on Elsa hacks to make it grok refactoring code. “Pork on GCC” basically means having equivalent features in GCC. I think that’s a tromey-scale project. I dread the through of modifying parser code and adding/extending fe-specific AST nodes in GCC. It’s certainly possible and if someone wants to do it, I’ll gladly chat with them.
However, for us it’s easier to just maintain our Elsa version, than introduce such drastic changes to GCC.

I think before such a step is taken, I’d rather see IDEs start using the gcc plugin framework to aid with code-completion/browsing. It’s a reasonable first step towards using gcc for other source-related tasks.

I was wondering, though — any plans to get your changes into GCC? Maybe the GTY thing? If the assignment stuff is worked out you could get your own branch at the very least.

Also, I’m curious to know what it would take to base Pork on GCC.