You visited us 1 times! Enjoying our articles? Unlock Full Access!

Accounting Database

Consider the ...

Question

Consider the following Parse Tree

What will be the Abstract Syntax Tree for the above Parse Tree?

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B
Abstract Syntax Tree is short representation of Parse Tree. AST contain leaf node as operand and non leaf node as operand. Parentheses, commas, semicolons can be ommited is AST.

Suggest Corrections

Similar questions

E \to E + E

E \to (E * E)

E \to id

\begin{matrix} E \to E_{1} # T & {E . value = E_{1} . value * T . value} | T & {E . value = T . value} T \to T_{1} & F & {T . value = T_{1} . value + F . value} | F & {T . value = F . value} F \to num & {F . value = num . value} \end{matrix}

S_{1}

S_{2}

\to

\to

\to

Join BYJU'S Learning Program