Parse Tree and Expression Tree Quiz Online Practice Test

1. Which statement accurately describes a parse tree for a given grammar?

Each parse tree corresponds to both leftmost and rightmost derivation trees

Each parse tree corresponds to a leftmost derivation tree

Each parse tree corresponds to a rightmost derivation tree

The number of parse trees equals the number of non-terminals

2. In the syntax analysis phase of a compiler, which data structure is commonly utilized?

Tree

Stack

Linked List

Queue

3. Given the starting symbol X of a grammar with the transition rules below, compute the value of X as the root of the parse tree for the expression: 3 & 4 % 7.

X → X1 & B | B {X.value = X1.value + B.value, X.value = B.value}

B → B1 % D | D {B.value = B1.value * D.value, B.value = D.value}

D → num {D.value = num.value}

4. In parse trees, do internal nodes always denote non-terminals and leaf nodes denote terminals?

Yes, always

No, never

Sometimes, depending on the grammar

It varies by parse tree type

5. Is a parse tree built using the tokens generated by the lexical analyser?

Yes

Only with specific compilers

It varies by parsing method

6. Given that *, +, and - are standard arithmetic operators with * having the lowest precedence, + the highest, and - in between, and that + and * are left-associative while - is right-associative, what is the result of the expression 3 - 8 + 2 - 9 * 3?

7. Which option accurately describes the computational complexity of GLR parsing?

O(|G| x n)

O(|G|2 x n)

O(|G| x n2)

O(|G|2 x n2)

8. To obtain the original input string during parse tree evaluation, which traversal method is employed?

Pre-order traversal

In-order traversal

Post-order traversal

Breadth-first traversal

9. In an expression tree, what do the leaves always contain?

Operators

Operands

Null values

Expressions

10. Is it possible for a node to have zero children?

Yes

Only in specific tree types

It varies based on tree structure

11. What do the non-leaf nodes of an expression tree contain?

Only operands

Only operators

Both operands and operators

Expressions

12. An expression tree is categorized as a type of:

Binary search tree

Fibonacci tree

Binary tree

Treap

13. The expression formed by recursively generating a left operand, followed by an operator, and then a right operand is known as:

Prefix expression

Infix expression

Postfix expression

Parenthesized expression

14. What is the average depth of a binary tree?

O(N)

O(log N)

O(M log N)

O(√N)

15. Can an expression tree be constructed solely from infix expressions?

Yes

Only in specific cases

It depends on the type of expression

16. Which type of expression is typically used to construct an expression tree?

Postfix expression

Prefix expression

Infix expression

Parenthesized expression

17. What type of expression is ++a*bc*+defg?

Postfix expression

Infix expression

Prefix expression

Invalid expression

18. To remove nodes from an expression tree, which function is used?

Malloc

Calloc

Delete

Free

19. What happens when an operand is encountered in an expression tree algorithm?

Create a node and push it onto the stack

Pop nodes from the stack

Clear the stack

Merge all nodes

Test Name:	Parse Tree and Expression Tree Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	19 / 19
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Parse Tree and Expression Tree MCQ Quiz Online Practice Test