Jump to content

Talk:Abstract syntax tree

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Euyyn (talk | contribs) at 23:37, 18 June 2006 (Wording). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Wording

"...since in an AST the grouping of operands is explicit in the tree structure." Wouldn't it make more sense to say "implicit."?

Please everybody sign posts adding 4 ~'s. It's implicit in the source code, where it is implied by the precedence and associativity rules, plus the arity of every operator (whether it is unary, binary, etc.). In the AST it is explicit: each operand node groups the operands it has as sons. --euyyn 23:37, 18 June 2006 (UTC)[reply]

Has anyone else ever thought of calling it the 'internal reptreesentation ...'?

NO

Confused about context

I'm afraid I'm a bit confused by the article. Does a parser create an abstract syntax tree as part of the compilation process for each individual program? That is, will there be a different abstract syntax tree for every C program I compile? Or is there one "abstract syntax tree" for the language of C, like with attribute grammars? -- Creidieki 18:07, 10 November 2005 (UTC)[reply]

Yes, the AST is created as part of the compilation process, so each different program has a different AST --Pezezin 11:53, 9 March 2006 (UTC)[reply]