Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Ask HN: Compiler frameworks for AST Transformations?

news.ycombinator.com

Post reply on HN
Print view View original

1–4 of 4 posts

Ask HN: Compiler frameworks for AST Transformations?

#1

Post by ianbertolacci »

Are there any compiler frameworks that tools to parse code (C/C++ at a minimum), and analyse, transform, and manipulate the AST?

We've been using the Rose compiler framework (http://rosecompiler.org/) in our group for some time. However, it's not my favorite and I'd like to use an alternative.

I've been wondering if there was something similar that was better maintained and supported. LLVM seems like an obvious choice, but it's too low level to be really effective. We would end up writing a lot more analysis to discover things that are obvious at high-level representations ("Is that a for loop?").

Looking for something: 1) very accessible; other people should be able to build and use my transformations with relative ease. 2) well documented; no mysterious functions and types that I have to use. 3) easy-to-use/intuitive (for compiler writers).

Thanks!

Re: Ask HN: Compiler frameworks for AST Transformations?

#2

Post by _RPM »

I think it is great that you are into this kind of stuff. I am as well, as I find it one of the most interesting things to do. "The AST" is subjective, however. We know it is a tree data structure, but most compilers implemented it differently. Also, AST generation is typically derived from the parsing stage, then the AST is taken to be compiled. I think you should look into GNU Bison.

Re: Ask HN: Compiler frameworks for AST Transformations?

#3

Post by ianbertolacci »

_RPM wrote: post #2

I think it is great that you are into this kind of stuff. I am as well, as I find it one of the most interesting things to do. "The AST" is subjective, however. We know it is a tree data structure, but most compilers implemented it differently. Also, AST generation is typically derived from the parsing stage, then the AST is taken to be compiled. I think you should look into GNU Bison.

Bison is a great tool for parsing grammars.

However, I'm more looking for a tool that, on its own, can be used as a full compiler, with the added ability to put myself in the middle of the front and back end.

LLVM has a similar ability where you can develop a pass over the IR and manipulate it.

Post reply on HN