Home/ Questions/Q 7701883
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-31T23:06:01+00:00

I have my parse tree with me, now I have traversed in order on

  • 0

I have my parse tree with me, now I have traversed in order on the parse tree and a Symbol table is generated too.
But how do I build the AST for this?

Here is what I have gathered (some unreliable resources):

  • In your parse tree you go inOrder I.e
    Take the leftmost child, The parent then, and then the list of other children.
  • If you come across anything like SEMICOL, Parenthesis, do not add it to AST, if there is only one child to a node, remove that node, and use child instead.

Is this all I need to do?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Update based on comment

    In your example the parse tree might contain a statement node like this

    (int) -> (ageArray) -> ([) -> (30) -> (]) -> (;)

    The professor expects something like

    (intArray) -> (ageArray) -> (30)

    I guess.

    You are making the solution to simple. It is not simply a matter of traversing your tree and throwing some stuff out. ASTs represent the constructs of the program language. In order to build an AST you first have to design what the AST is going to look like.

    For example, an “IF” node might be designed as having a boolean equation element (this in itself is probably a tree too), a true statement tree and a false statement tree.

    You have to design what all the elements are going to look like based on the language you are compiling. Once you have that design then often a lexer is used on the parse tree to generate the AST.

    • 0